./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/02-base_26-malloc_struct.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/goblint-regression/02-base_26-malloc_struct.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! data-race) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '71b70db56146daaa7371fed58b975e1add8fa8ab54b0a1b08c677a431a619350'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/02-base_26-malloc_struct.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 71b70db56146daaa7371fed58b975e1add8fa8ab54b0a1b08c677a431a619350 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 15:33:25,626 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 15:33:25,696 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-07 15:33:25,702 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 15:33:25,702 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 15:33:25,729 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 15:33:25,732 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 15:33:25,732 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 15:33:25,732 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 15:33:25,733 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 15:33:25,733 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 15:33:25,734 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 15:33:25,734 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 15:33:25,734 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 15:33:25,735 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 15:33:25,735 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 15:33:25,735 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 15:33:25,735 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 15:33:25,735 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 15:33:25,735 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 15:33:25,735 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 15:33:25,736 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 15:33:25,736 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-07 15:33:25,736 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 15:33:25,736 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 15:33:25,736 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 15:33:25,736 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 15:33:25,736 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 15:33:25,736 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 15:33:25,736 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 15:33:25,736 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 15:33:25,736 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 15:33:25,736 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 15:33:25,737 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 15:33:25,737 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 15:33:25,737 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 15:33:25,737 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 15:33:25,737 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 15:33:25,737 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 15:33:25,737 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 15:33:25,737 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 15:33:25,737 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 71b70db56146daaa7371fed58b975e1add8fa8ab54b0a1b08c677a431a619350 [2024-11-07 15:33:26,048 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 15:33:26,059 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 15:33:26,062 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 15:33:26,065 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 15:33:26,065 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 15:33:26,067 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/02-base_26-malloc_struct.i [2024-11-07 15:33:27,449 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 15:33:27,802 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 15:33:27,803 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/02-base_26-malloc_struct.i [2024-11-07 15:33:27,827 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1525581fc/4379043bc87e455a826a958345f1e092/FLAGdb459eb61 [2024-11-07 15:33:27,847 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1525581fc/4379043bc87e455a826a958345f1e092 [2024-11-07 15:33:27,850 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 15:33:27,852 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 15:33:27,854 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 15:33:27,854 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 15:33:27,858 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 15:33:27,859 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:33:27" (1/1) ... [2024-11-07 15:33:27,862 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5053e288 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:33:27, skipping insertion in model container [2024-11-07 15:33:27,862 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:33:27" (1/1) ... [2024-11-07 15:33:27,909 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 15:33:28,342 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 15:33:28,359 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 15:33:28,412 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 15:33:28,509 INFO L204 MainTranslator]: Completed translation [2024-11-07 15:33:28,509 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:33:28 WrapperNode [2024-11-07 15:33:28,510 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 15:33:28,511 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 15:33:28,511 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 15:33:28,511 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 15:33:28,515 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:33:28" (1/1) ... [2024-11-07 15:33:28,532 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:33:28" (1/1) ... [2024-11-07 15:33:28,557 INFO L138 Inliner]: procedures = 365, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 58 [2024-11-07 15:33:28,558 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 15:33:28,559 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 15:33:28,559 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 15:33:28,559 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 15:33:28,565 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:33:28" (1/1) ... [2024-11-07 15:33:28,566 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:33:28" (1/1) ... [2024-11-07 15:33:28,573 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:33:28" (1/1) ... [2024-11-07 15:33:28,574 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:33:28" (1/1) ... [2024-11-07 15:33:28,588 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:33:28" (1/1) ... [2024-11-07 15:33:28,593 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:33:28" (1/1) ... [2024-11-07 15:33:28,594 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:33:28" (1/1) ... [2024-11-07 15:33:28,595 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:33:28" (1/1) ... [2024-11-07 15:33:28,601 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 15:33:28,602 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 15:33:28,602 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 15:33:28,602 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 15:33:28,603 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:33:28" (1/1) ... [2024-11-07 15:33:28,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 15:33:28,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 15:33:28,643 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 15:33:28,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 15:33:28,670 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-07 15:33:28,670 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-07 15:33:28,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-07 15:33:28,670 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-07 15:33:28,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-07 15:33:28,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 15:33:28,670 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-07 15:33:28,671 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-07 15:33:28,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-07 15:33:28,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 15:33:28,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 15:33:28,672 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-07 15:33:28,820 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 15:33:28,821 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 15:33:29,025 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-07 15:33:29,026 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 15:33:29,051 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 15:33:29,052 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-07 15:33:29,052 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:33:29 BoogieIcfgContainer [2024-11-07 15:33:29,052 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 15:33:29,054 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 15:33:29,055 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 15:33:29,059 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 15:33:29,059 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 03:33:27" (1/3) ... [2024-11-07 15:33:29,060 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@518c8f9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:33:29, skipping insertion in model container [2024-11-07 15:33:29,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:33:28" (2/3) ... [2024-11-07 15:33:29,061 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@518c8f9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:33:29, skipping insertion in model container [2024-11-07 15:33:29,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:33:29" (3/3) ... [2024-11-07 15:33:29,063 INFO L112 eAbstractionObserver]: Analyzing ICFG 02-base_26-malloc_struct.i [2024-11-07 15:33:29,075 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 15:33:29,075 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2024-11-07 15:33:29,075 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-07 15:33:29,134 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-07 15:33:29,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 95 transitions, 194 flow [2024-11-07 15:33:29,227 INFO L124 PetriNetUnfolderBase]: 0/94 cut-off events. [2024-11-07 15:33:29,231 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 15:33:29,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 94 events. 0/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 78 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-11-07 15:33:29,235 INFO L82 GeneralOperation]: Start removeDead. Operand has 99 places, 95 transitions, 194 flow [2024-11-07 15:33:29,242 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 98 places, 94 transitions, 191 flow [2024-11-07 15:33:29,255 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 15:33:29,267 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;@c49f5e5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 15:33:29,269 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2024-11-07 15:33:29,277 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 15:33:29,279 INFO L124 PetriNetUnfolderBase]: 0/18 cut-off events. [2024-11-07 15:33:29,279 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 15:33:29,279 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:33:29,280 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:33:29,281 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-07 15:33:29,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:33:29,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1486570224, now seen corresponding path program 1 times [2024-11-07 15:33:29,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:33:29,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232014980] [2024-11-07 15:33:29,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:33:29,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:33:29,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:33:29,540 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-07 15:33:29,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:33:29,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232014980] [2024-11-07 15:33:29,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232014980] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:33:29,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:33:29,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:33:29,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589296643] [2024-11-07 15:33:29,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:33:29,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:33:29,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:33:29,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:33:29,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:33:29,631 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 95 [2024-11-07 15:33:29,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 94 transitions, 191 flow. Second operand has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 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-07 15:33:29,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:33:29,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 95 [2024-11-07 15:33:29,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:33:29,729 INFO L124 PetriNetUnfolderBase]: 16/229 cut-off events. [2024-11-07 15:33:29,731 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-07 15:33:29,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 281 conditions, 229 events. 16/229 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 740 event pairs, 16 based on Foata normal form. 0/200 useless extension candidates. Maximal degree in co-relation 240. Up to 46 conditions per place. [2024-11-07 15:33:29,737 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 13 selfloop transitions, 2 changer transitions 0/93 dead transitions. [2024-11-07 15:33:29,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 93 transitions, 219 flow [2024-11-07 15:33:29,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:33:29,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:33:29,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 253 transitions. [2024-11-07 15:33:29,755 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.887719298245614 [2024-11-07 15:33:29,757 INFO L175 Difference]: Start difference. First operand has 98 places, 94 transitions, 191 flow. Second operand 3 states and 253 transitions. [2024-11-07 15:33:29,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 93 transitions, 219 flow [2024-11-07 15:33:29,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 93 transitions, 218 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 15:33:29,770 INFO L231 Difference]: Finished difference. Result has 98 places, 93 transitions, 192 flow [2024-11-07 15:33:29,774 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=192, PETRI_PLACES=98, PETRI_TRANSITIONS=93} [2024-11-07 15:33:29,778 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, 0 predicate places. [2024-11-07 15:33:29,780 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 93 transitions, 192 flow [2024-11-07 15:33:29,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 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-07 15:33:29,780 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:33:29,780 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] [2024-11-07 15:33:29,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 15:33:29,781 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-07 15:33:29,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:33:29,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1118414709, now seen corresponding path program 1 times [2024-11-07 15:33:29,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:33:29,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572467055] [2024-11-07 15:33:29,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:33:29,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:33:29,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:33:29,859 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-07 15:33:29,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:33:29,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572467055] [2024-11-07 15:33:29,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572467055] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:33:29,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:33:29,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:33:29,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040686887] [2024-11-07 15:33:29,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:33:29,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:33:29,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:33:29,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:33:29,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:33:29,895 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 95 [2024-11-07 15:33:29,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 93 transitions, 192 flow. Second operand has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 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-07 15:33:29,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:33:29,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 95 [2024-11-07 15:33:29,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:33:29,989 INFO L124 PetriNetUnfolderBase]: 24/301 cut-off events. [2024-11-07 15:33:29,989 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-07 15:33:29,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 370 conditions, 301 events. 24/301 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1307 event pairs, 24 based on Foata normal form. 0/280 useless extension candidates. Maximal degree in co-relation 343. Up to 61 conditions per place. [2024-11-07 15:33:29,992 INFO L140 encePairwiseOnDemand]: 90/95 looper letters, 13 selfloop transitions, 1 changer transitions 0/89 dead transitions. [2024-11-07 15:33:29,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 89 transitions, 212 flow [2024-11-07 15:33:29,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:33:29,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:33:29,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 249 transitions. [2024-11-07 15:33:29,995 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8736842105263158 [2024-11-07 15:33:29,995 INFO L175 Difference]: Start difference. First operand has 98 places, 93 transitions, 192 flow. Second operand 3 states and 249 transitions. [2024-11-07 15:33:29,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 89 transitions, 212 flow [2024-11-07 15:33:29,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 89 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:33:29,998 INFO L231 Difference]: Finished difference. Result has 94 places, 89 transitions, 182 flow [2024-11-07 15:33:29,998 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=182, PETRI_PLACES=94, PETRI_TRANSITIONS=89} [2024-11-07 15:33:29,999 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, -4 predicate places. [2024-11-07 15:33:30,000 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 89 transitions, 182 flow [2024-11-07 15:33:30,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 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-07 15:33:30,001 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:33:30,001 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] [2024-11-07 15:33:30,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 15:33:30,002 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-07 15:33:30,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:33:30,003 INFO L85 PathProgramCache]: Analyzing trace with hash -794414378, now seen corresponding path program 1 times [2024-11-07 15:33:30,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:33:30,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031798426] [2024-11-07 15:33:30,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:33:30,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:33:30,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:33:30,645 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-07 15:33:30,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:33:30,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031798426] [2024-11-07 15:33:30,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031798426] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:33:30,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:33:30,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 15:33:30,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023592335] [2024-11-07 15:33:30,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:33:30,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 15:33:30,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:33:30,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 15:33:30,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-07 15:33:30,834 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 95 [2024-11-07 15:33:30,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 89 transitions, 182 flow. Second operand has 6 states, 6 states have (on average 72.66666666666667) internal successors, (436), 6 states have internal predecessors, (436), 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-07 15:33:30,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:33:30,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 95 [2024-11-07 15:33:30,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:33:31,097 INFO L124 PetriNetUnfolderBase]: 185/657 cut-off events. [2024-11-07 15:33:31,097 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 15:33:31,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1064 conditions, 657 events. 185/657 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3570 event pairs, 52 based on Foata normal form. 0/617 useless extension candidates. Maximal degree in co-relation 1036. Up to 246 conditions per place. [2024-11-07 15:33:31,106 INFO L140 encePairwiseOnDemand]: 79/95 looper letters, 47 selfloop transitions, 41 changer transitions 0/153 dead transitions. [2024-11-07 15:33:31,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 153 transitions, 486 flow [2024-11-07 15:33:31,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 15:33:31,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 15:33:31,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 515 transitions. [2024-11-07 15:33:31,110 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9035087719298246 [2024-11-07 15:33:31,110 INFO L175 Difference]: Start difference. First operand has 94 places, 89 transitions, 182 flow. Second operand 6 states and 515 transitions. [2024-11-07 15:33:31,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 153 transitions, 486 flow [2024-11-07 15:33:31,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 153 transitions, 485 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 15:33:31,114 INFO L231 Difference]: Finished difference. Result has 102 places, 131 transitions, 439 flow [2024-11-07 15:33:31,114 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=439, PETRI_PLACES=102, PETRI_TRANSITIONS=131} [2024-11-07 15:33:31,115 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, 4 predicate places. [2024-11-07 15:33:31,115 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 131 transitions, 439 flow [2024-11-07 15:33:31,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 72.66666666666667) internal successors, (436), 6 states have internal predecessors, (436), 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-07 15:33:31,115 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:33:31,116 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] [2024-11-07 15:33:31,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 15:33:31,116 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-07 15:33:31,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:33:31,117 INFO L85 PathProgramCache]: Analyzing trace with hash 662746690, now seen corresponding path program 1 times [2024-11-07 15:33:31,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:33:31,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869741834] [2024-11-07 15:33:31,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:33:31,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:33:31,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:33:31,454 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-07 15:33:31,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:33:31,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869741834] [2024-11-07 15:33:31,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869741834] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:33:31,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:33:31,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 15:33:31,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420312068] [2024-11-07 15:33:31,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:33:31,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 15:33:31,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:33:31,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 15:33:31,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-07 15:33:31,631 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 95 [2024-11-07 15:33:31,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 131 transitions, 439 flow. Second operand has 6 states, 6 states have (on average 78.5) internal successors, (471), 6 states have internal predecessors, (471), 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-07 15:33:31,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:33:31,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 95 [2024-11-07 15:33:31,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:33:31,826 INFO L124 PetriNetUnfolderBase]: 231/994 cut-off events. [2024-11-07 15:33:31,827 INFO L125 PetriNetUnfolderBase]: For 291/338 co-relation queries the response was YES. [2024-11-07 15:33:31,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2068 conditions, 994 events. 231/994 cut-off events. For 291/338 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 6807 event pairs, 25 based on Foata normal form. 26/987 useless extension candidates. Maximal degree in co-relation 2036. Up to 180 conditions per place. [2024-11-07 15:33:31,836 INFO L140 encePairwiseOnDemand]: 84/95 looper letters, 67 selfloop transitions, 32 changer transitions 0/190 dead transitions. [2024-11-07 15:33:31,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 190 transitions, 869 flow [2024-11-07 15:33:31,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 15:33:31,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 15:33:31,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 529 transitions. [2024-11-07 15:33:31,839 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9280701754385965 [2024-11-07 15:33:31,839 INFO L175 Difference]: Start difference. First operand has 102 places, 131 transitions, 439 flow. Second operand 6 states and 529 transitions. [2024-11-07 15:33:31,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 190 transitions, 869 flow [2024-11-07 15:33:31,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 190 transitions, 869 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 15:33:31,849 INFO L231 Difference]: Finished difference. Result has 112 places, 161 transitions, 741 flow [2024-11-07 15:33:31,849 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=439, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=741, PETRI_PLACES=112, PETRI_TRANSITIONS=161} [2024-11-07 15:33:31,850 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, 14 predicate places. [2024-11-07 15:33:31,851 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 161 transitions, 741 flow [2024-11-07 15:33:31,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 78.5) internal successors, (471), 6 states have internal predecessors, (471), 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-07 15:33:31,851 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:33:31,851 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] [2024-11-07 15:33:31,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 15:33:31,852 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-07 15:33:31,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:33:31,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1263126400, now seen corresponding path program 1 times [2024-11-07 15:33:31,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:33:31,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481234224] [2024-11-07 15:33:31,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:33:31,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:33:31,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:33:31,926 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-07 15:33:31,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:33:31,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481234224] [2024-11-07 15:33:31,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481234224] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:33:31,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:33:31,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 15:33:31,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231929498] [2024-11-07 15:33:31,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:33:31,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:33:31,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:33:31,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:33:31,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:33:31,939 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 95 [2024-11-07 15:33:31,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 161 transitions, 741 flow. Second operand has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 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-07 15:33:31,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:33:31,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 95 [2024-11-07 15:33:31,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:33:31,984 INFO L124 PetriNetUnfolderBase]: 39/278 cut-off events. [2024-11-07 15:33:31,984 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2024-11-07 15:33:31,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 521 conditions, 278 events. 39/278 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 966 event pairs, 4 based on Foata normal form. 2/267 useless extension candidates. Maximal degree in co-relation 485. Up to 64 conditions per place. [2024-11-07 15:33:31,986 INFO L140 encePairwiseOnDemand]: 91/95 looper letters, 2 selfloop transitions, 4 changer transitions 0/110 dead transitions. [2024-11-07 15:33:31,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 110 transitions, 375 flow [2024-11-07 15:33:31,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:33:31,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:33:31,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 275 transitions. [2024-11-07 15:33:31,987 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9649122807017544 [2024-11-07 15:33:31,987 INFO L175 Difference]: Start difference. First operand has 112 places, 161 transitions, 741 flow. Second operand 3 states and 275 transitions. [2024-11-07 15:33:31,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 110 transitions, 375 flow [2024-11-07 15:33:31,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 110 transitions, 333 flow, removed 13 selfloop flow, removed 8 redundant places. [2024-11-07 15:33:31,991 INFO L231 Difference]: Finished difference. Result has 105 places, 110 transitions, 329 flow [2024-11-07 15:33:31,991 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=329, PETRI_PLACES=105, PETRI_TRANSITIONS=110} [2024-11-07 15:33:31,992 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, 7 predicate places. [2024-11-07 15:33:31,992 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 110 transitions, 329 flow [2024-11-07 15:33:31,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 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-07 15:33:31,992 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:33:31,992 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] [2024-11-07 15:33:31,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 15:33:31,992 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-07 15:33:31,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:33:31,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1313172452, now seen corresponding path program 1 times [2024-11-07 15:33:31,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:33:31,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601630717] [2024-11-07 15:33:31,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:33:31,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:33:32,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:33:32,297 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-07 15:33:32,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:33:32,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601630717] [2024-11-07 15:33:32,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601630717] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:33:32,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:33:32,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 15:33:32,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599112330] [2024-11-07 15:33:32,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:33:32,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 15:33:32,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:33:32,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 15:33:32,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-07 15:33:32,469 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 95 [2024-11-07 15:33:32,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 110 transitions, 329 flow. Second operand has 6 states, 6 states have (on average 77.66666666666667) internal successors, (466), 6 states have internal predecessors, (466), 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-07 15:33:32,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:33:32,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 95 [2024-11-07 15:33:32,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:33:32,640 INFO L124 PetriNetUnfolderBase]: 93/474 cut-off events. [2024-11-07 15:33:32,641 INFO L125 PetriNetUnfolderBase]: For 86/86 co-relation queries the response was YES. [2024-11-07 15:33:32,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 901 conditions, 474 events. 93/474 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2168 event pairs, 20 based on Foata normal form. 0/448 useless extension candidates. Maximal degree in co-relation 867. Up to 153 conditions per place. [2024-11-07 15:33:32,644 INFO L140 encePairwiseOnDemand]: 84/95 looper letters, 34 selfloop transitions, 22 changer transitions 0/131 dead transitions. [2024-11-07 15:33:32,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 131 transitions, 515 flow [2024-11-07 15:33:32,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 15:33:32,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 15:33:32,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 497 transitions. [2024-11-07 15:33:32,647 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8719298245614036 [2024-11-07 15:33:32,647 INFO L175 Difference]: Start difference. First operand has 105 places, 110 transitions, 329 flow. Second operand 6 states and 497 transitions. [2024-11-07 15:33:32,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 131 transitions, 515 flow [2024-11-07 15:33:32,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 131 transitions, 511 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 15:33:32,655 INFO L231 Difference]: Finished difference. Result has 114 places, 131 transitions, 507 flow [2024-11-07 15:33:32,655 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=507, PETRI_PLACES=114, PETRI_TRANSITIONS=131} [2024-11-07 15:33:32,656 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, 16 predicate places. [2024-11-07 15:33:32,656 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 131 transitions, 507 flow [2024-11-07 15:33:32,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 77.66666666666667) internal successors, (466), 6 states have internal predecessors, (466), 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-07 15:33:32,656 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:33:32,656 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] [2024-11-07 15:33:32,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 15:33:32,657 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-07 15:33:32,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:33:32,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1654409923, now seen corresponding path program 1 times [2024-11-07 15:33:32,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:33:32,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752575093] [2024-11-07 15:33:32,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:33:32,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:33:32,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:33:32,971 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-07 15:33:32,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:33:32,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752575093] [2024-11-07 15:33:32,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752575093] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:33:32,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:33:32,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 15:33:32,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607017279] [2024-11-07 15:33:32,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:33:32,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 15:33:32,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:33:32,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 15:33:32,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-07 15:33:33,090 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 95 [2024-11-07 15:33:33,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 131 transitions, 507 flow. Second operand has 6 states, 6 states have (on average 73.83333333333333) internal successors, (443), 6 states have internal predecessors, (443), 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-07 15:33:33,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:33:33,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 95 [2024-11-07 15:33:33,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:33:33,327 INFO L124 PetriNetUnfolderBase]: 195/727 cut-off events. [2024-11-07 15:33:33,327 INFO L125 PetriNetUnfolderBase]: For 309/315 co-relation queries the response was YES. [2024-11-07 15:33:33,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1814 conditions, 727 events. 195/727 cut-off events. For 309/315 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 4010 event pairs, 12 based on Foata normal form. 0/705 useless extension candidates. Maximal degree in co-relation 1775. Up to 295 conditions per place. [2024-11-07 15:33:33,335 INFO L140 encePairwiseOnDemand]: 80/95 looper letters, 56 selfloop transitions, 52 changer transitions 11/188 dead transitions. [2024-11-07 15:33:33,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 188 transitions, 1014 flow [2024-11-07 15:33:33,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 15:33:33,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 15:33:33,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 501 transitions. [2024-11-07 15:33:33,337 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8789473684210526 [2024-11-07 15:33:33,338 INFO L175 Difference]: Start difference. First operand has 114 places, 131 transitions, 507 flow. Second operand 6 states and 501 transitions. [2024-11-07 15:33:33,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 188 transitions, 1014 flow [2024-11-07 15:33:33,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 188 transitions, 976 flow, removed 19 selfloop flow, removed 0 redundant places. [2024-11-07 15:33:33,344 INFO L231 Difference]: Finished difference. Result has 124 places, 173 transitions, 931 flow [2024-11-07 15:33:33,344 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=931, PETRI_PLACES=124, PETRI_TRANSITIONS=173} [2024-11-07 15:33:33,344 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, 26 predicate places. [2024-11-07 15:33:33,345 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 173 transitions, 931 flow [2024-11-07 15:33:33,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 73.83333333333333) internal successors, (443), 6 states have internal predecessors, (443), 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-07 15:33:33,345 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:33:33,345 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] [2024-11-07 15:33:33,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 15:33:33,345 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-07 15:33:33,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:33:33,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1313883544, now seen corresponding path program 1 times [2024-11-07 15:33:33,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:33:33,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342002870] [2024-11-07 15:33:33,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:33:33,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:33:33,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:33:34,081 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-07 15:33:34,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:33:34,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342002870] [2024-11-07 15:33:34,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342002870] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:33:34,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:33:34,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 15:33:34,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670783841] [2024-11-07 15:33:34,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:33:34,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 15:33:34,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:33:34,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 15:33:34,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-11-07 15:33:34,445 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 95 [2024-11-07 15:33:34,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 173 transitions, 931 flow. Second operand has 10 states, 10 states have (on average 67.3) internal successors, (673), 10 states have internal predecessors, (673), 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-07 15:33:34,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:33:34,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 95 [2024-11-07 15:33:34,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:33:34,639 INFO L124 PetriNetUnfolderBase]: 187/691 cut-off events. [2024-11-07 15:33:34,639 INFO L125 PetriNetUnfolderBase]: For 720/750 co-relation queries the response was YES. [2024-11-07 15:33:34,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2116 conditions, 691 events. 187/691 cut-off events. For 720/750 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3782 event pairs, 19 based on Foata normal form. 21/705 useless extension candidates. Maximal degree in co-relation 2068. Up to 131 conditions per place. [2024-11-07 15:33:34,644 INFO L140 encePairwiseOnDemand]: 83/95 looper letters, 88 selfloop transitions, 36 changer transitions 16/220 dead transitions. [2024-11-07 15:33:34,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 220 transitions, 1545 flow [2024-11-07 15:33:34,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 15:33:34,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-07 15:33:34,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 712 transitions. [2024-11-07 15:33:34,647 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7494736842105263 [2024-11-07 15:33:34,647 INFO L175 Difference]: Start difference. First operand has 124 places, 173 transitions, 931 flow. Second operand 10 states and 712 transitions. [2024-11-07 15:33:34,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 220 transitions, 1545 flow [2024-11-07 15:33:34,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 220 transitions, 1502 flow, removed 18 selfloop flow, removed 1 redundant places. [2024-11-07 15:33:34,657 INFO L231 Difference]: Finished difference. Result has 138 places, 181 transitions, 1078 flow [2024-11-07 15:33:34,657 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=889, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1078, PETRI_PLACES=138, PETRI_TRANSITIONS=181} [2024-11-07 15:33:34,658 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, 40 predicate places. [2024-11-07 15:33:34,658 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 181 transitions, 1078 flow [2024-11-07 15:33:34,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 67.3) internal successors, (673), 10 states have internal predecessors, (673), 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-07 15:33:34,659 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:33:34,659 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] [2024-11-07 15:33:34,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 15:33:34,659 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-07 15:33:34,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:33:34,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1916998803, now seen corresponding path program 1 times [2024-11-07 15:33:34,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:33:34,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159984547] [2024-11-07 15:33:34,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:33:34,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:33:34,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:33:35,274 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-07 15:33:35,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:33:35,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159984547] [2024-11-07 15:33:35,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159984547] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:33:35,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:33:35,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 15:33:35,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406121327] [2024-11-07 15:33:35,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:33:35,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 15:33:35,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:33:35,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 15:33:35,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-07 15:33:35,570 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 95 [2024-11-07 15:33:35,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 181 transitions, 1078 flow. Second operand has 10 states, 10 states have (on average 68.7) internal successors, (687), 10 states have internal predecessors, (687), 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-07 15:33:35,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:33:35,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 95 [2024-11-07 15:33:35,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:33:35,884 INFO L124 PetriNetUnfolderBase]: 230/794 cut-off events. [2024-11-07 15:33:35,884 INFO L125 PetriNetUnfolderBase]: For 1369/1411 co-relation queries the response was YES. [2024-11-07 15:33:35,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2783 conditions, 794 events. 230/794 cut-off events. For 1369/1411 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 4565 event pairs, 8 based on Foata normal form. 28/818 useless extension candidates. Maximal degree in co-relation 2754. Up to 159 conditions per place. [2024-11-07 15:33:35,890 INFO L140 encePairwiseOnDemand]: 79/95 looper letters, 116 selfloop transitions, 67 changer transitions 17/263 dead transitions. [2024-11-07 15:33:35,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 263 transitions, 2090 flow [2024-11-07 15:33:35,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 15:33:35,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-07 15:33:35,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 706 transitions. [2024-11-07 15:33:35,892 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8257309941520468 [2024-11-07 15:33:35,893 INFO L175 Difference]: Start difference. First operand has 138 places, 181 transitions, 1078 flow. Second operand 9 states and 706 transitions. [2024-11-07 15:33:35,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 263 transitions, 2090 flow [2024-11-07 15:33:35,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 263 transitions, 2051 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-11-07 15:33:35,907 INFO L231 Difference]: Finished difference. Result has 144 places, 202 transitions, 1455 flow [2024-11-07 15:33:35,908 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=1050, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1455, PETRI_PLACES=144, PETRI_TRANSITIONS=202} [2024-11-07 15:33:35,908 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, 46 predicate places. [2024-11-07 15:33:35,908 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 202 transitions, 1455 flow [2024-11-07 15:33:35,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 68.7) internal successors, (687), 10 states have internal predecessors, (687), 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-07 15:33:35,909 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:33:35,909 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] [2024-11-07 15:33:35,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 15:33:35,909 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-07 15:33:35,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:33:35,910 INFO L85 PathProgramCache]: Analyzing trace with hash -781584510, now seen corresponding path program 1 times [2024-11-07 15:33:35,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:33:35,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293268998] [2024-11-07 15:33:35,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:33:35,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:33:35,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:33:36,507 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-07 15:33:36,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:33:36,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293268998] [2024-11-07 15:33:36,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293268998] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:33:36,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:33:36,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 15:33:36,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137474869] [2024-11-07 15:33:36,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:33:36,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 15:33:36,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:33:36,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 15:33:36,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-07 15:33:36,894 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 95 [2024-11-07 15:33:36,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 202 transitions, 1455 flow. Second operand has 11 states, 11 states have (on average 67.54545454545455) internal successors, (743), 11 states have internal predecessors, (743), 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-07 15:33:36,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:33:36,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 95 [2024-11-07 15:33:36,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:33:37,121 INFO L124 PetriNetUnfolderBase]: 199/789 cut-off events. [2024-11-07 15:33:37,122 INFO L125 PetriNetUnfolderBase]: For 2264/2344 co-relation queries the response was YES. [2024-11-07 15:33:37,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2988 conditions, 789 events. 199/789 cut-off events. For 2264/2344 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 4648 event pairs, 21 based on Foata normal form. 43/825 useless extension candidates. Maximal degree in co-relation 2927. Up to 168 conditions per place. [2024-11-07 15:33:37,129 INFO L140 encePairwiseOnDemand]: 84/95 looper letters, 93 selfloop transitions, 36 changer transitions 6/229 dead transitions. [2024-11-07 15:33:37,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 229 transitions, 2041 flow [2024-11-07 15:33:37,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 15:33:37,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-07 15:33:37,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 772 transitions. [2024-11-07 15:33:37,132 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.738755980861244 [2024-11-07 15:33:37,132 INFO L175 Difference]: Start difference. First operand has 144 places, 202 transitions, 1455 flow. Second operand 11 states and 772 transitions. [2024-11-07 15:33:37,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 229 transitions, 2041 flow [2024-11-07 15:33:37,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 229 transitions, 1993 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-11-07 15:33:37,152 INFO L231 Difference]: Finished difference. Result has 152 places, 200 transitions, 1479 flow [2024-11-07 15:33:37,153 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=1423, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1479, PETRI_PLACES=152, PETRI_TRANSITIONS=200} [2024-11-07 15:33:37,153 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, 54 predicate places. [2024-11-07 15:33:37,154 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 200 transitions, 1479 flow [2024-11-07 15:33:37,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 67.54545454545455) internal successors, (743), 11 states have internal predecessors, (743), 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-07 15:33:37,154 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:33:37,154 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] [2024-11-07 15:33:37,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 15:33:37,155 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-07 15:33:37,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:33:37,155 INFO L85 PathProgramCache]: Analyzing trace with hash -720812794, now seen corresponding path program 2 times [2024-11-07 15:33:37,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:33:37,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262556322] [2024-11-07 15:33:37,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:33:37,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:33:37,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:33:37,704 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-07 15:33:37,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:33:37,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262556322] [2024-11-07 15:33:37,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262556322] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:33:37,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:33:37,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 15:33:37,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469982197] [2024-11-07 15:33:37,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:33:37,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 15:33:37,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:33:37,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 15:33:37,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-07 15:33:38,022 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 95 [2024-11-07 15:33:38,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 200 transitions, 1479 flow. Second operand has 11 states, 11 states have (on average 67.54545454545455) internal successors, (743), 11 states have internal predecessors, (743), 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-07 15:33:38,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:33:38,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 95 [2024-11-07 15:33:38,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:33:38,314 INFO L124 PetriNetUnfolderBase]: 196/784 cut-off events. [2024-11-07 15:33:38,314 INFO L125 PetriNetUnfolderBase]: For 2440/2490 co-relation queries the response was YES. [2024-11-07 15:33:38,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2992 conditions, 784 events. 196/784 cut-off events. For 2440/2490 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 4619 event pairs, 21 based on Foata normal form. 28/805 useless extension candidates. Maximal degree in co-relation 2959. Up to 168 conditions per place. [2024-11-07 15:33:38,321 INFO L140 encePairwiseOnDemand]: 84/95 looper letters, 93 selfloop transitions, 34 changer transitions 7/228 dead transitions. [2024-11-07 15:33:38,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 228 transitions, 2057 flow [2024-11-07 15:33:38,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 15:33:38,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-07 15:33:38,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 837 transitions. [2024-11-07 15:33:38,325 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7342105263157894 [2024-11-07 15:33:38,325 INFO L175 Difference]: Start difference. First operand has 152 places, 200 transitions, 1479 flow. Second operand 12 states and 837 transitions. [2024-11-07 15:33:38,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 228 transitions, 2057 flow [2024-11-07 15:33:38,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 228 transitions, 1975 flow, removed 5 selfloop flow, removed 10 redundant places. [2024-11-07 15:33:38,346 INFO L231 Difference]: Finished difference. Result has 154 places, 198 transitions, 1455 flow [2024-11-07 15:33:38,347 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=1401, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1455, PETRI_PLACES=154, PETRI_TRANSITIONS=198} [2024-11-07 15:33:38,347 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, 56 predicate places. [2024-11-07 15:33:38,348 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 198 transitions, 1455 flow [2024-11-07 15:33:38,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 67.54545454545455) internal successors, (743), 11 states have internal predecessors, (743), 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-07 15:33:38,349 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:33:38,350 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] [2024-11-07 15:33:38,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 15:33:38,350 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-07 15:33:38,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:33:38,351 INFO L85 PathProgramCache]: Analyzing trace with hash -277143894, now seen corresponding path program 3 times [2024-11-07 15:33:38,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:33:38,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027681251] [2024-11-07 15:33:38,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:33:38,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:33:38,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:33:38,786 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-07 15:33:38,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:33:38,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027681251] [2024-11-07 15:33:38,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027681251] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:33:38,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:33:38,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 15:33:38,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758550304] [2024-11-07 15:33:38,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:33:38,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 15:33:38,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:33:38,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 15:33:38,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-07 15:33:39,248 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 95 [2024-11-07 15:33:39,249 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 198 transitions, 1455 flow. Second operand has 11 states, 11 states have (on average 67.54545454545455) internal successors, (743), 11 states have internal predecessors, (743), 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-07 15:33:39,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:33:39,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 95 [2024-11-07 15:33:39,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:33:39,690 INFO L124 PetriNetUnfolderBase]: 200/841 cut-off events. [2024-11-07 15:33:39,690 INFO L125 PetriNetUnfolderBase]: For 2518/2539 co-relation queries the response was YES. [2024-11-07 15:33:39,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3162 conditions, 841 events. 200/841 cut-off events. For 2518/2539 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 5199 event pairs, 21 based on Foata normal form. 13/847 useless extension candidates. Maximal degree in co-relation 3128. Up to 243 conditions per place. [2024-11-07 15:33:39,697 INFO L140 encePairwiseOnDemand]: 79/95 looper letters, 70 selfloop transitions, 42 changer transitions 12/218 dead transitions. [2024-11-07 15:33:39,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 218 transitions, 1896 flow [2024-11-07 15:33:39,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 15:33:39,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-07 15:33:39,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 911 transitions. [2024-11-07 15:33:39,700 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7376518218623481 [2024-11-07 15:33:39,700 INFO L175 Difference]: Start difference. First operand has 154 places, 198 transitions, 1455 flow. Second operand 13 states and 911 transitions. [2024-11-07 15:33:39,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 218 transitions, 1896 flow [2024-11-07 15:33:39,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 218 transitions, 1790 flow, removed 7 selfloop flow, removed 11 redundant places. [2024-11-07 15:33:39,722 INFO L231 Difference]: Finished difference. Result has 159 places, 204 transitions, 1566 flow [2024-11-07 15:33:39,722 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=1379, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1566, PETRI_PLACES=159, PETRI_TRANSITIONS=204} [2024-11-07 15:33:39,724 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, 61 predicate places. [2024-11-07 15:33:39,725 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 204 transitions, 1566 flow [2024-11-07 15:33:39,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 67.54545454545455) internal successors, (743), 11 states have internal predecessors, (743), 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-07 15:33:39,725 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:33:39,725 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] [2024-11-07 15:33:39,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 15:33:39,726 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-07 15:33:39,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:33:39,726 INFO L85 PathProgramCache]: Analyzing trace with hash -66813786, now seen corresponding path program 4 times [2024-11-07 15:33:39,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:33:39,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294953763] [2024-11-07 15:33:39,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:33:39,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:33:39,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:33:40,195 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-07 15:33:40,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:33:40,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294953763] [2024-11-07 15:33:40,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294953763] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:33:40,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:33:40,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 15:33:40,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606193378] [2024-11-07 15:33:40,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:33:40,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 15:33:40,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:33:40,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 15:33:40,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-07 15:33:40,556 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 95 [2024-11-07 15:33:40,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 204 transitions, 1566 flow. Second operand has 11 states, 11 states have (on average 67.54545454545455) internal successors, (743), 11 states have internal predecessors, (743), 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-07 15:33:40,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:33:40,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 95 [2024-11-07 15:33:40,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:33:40,839 INFO L124 PetriNetUnfolderBase]: 197/827 cut-off events. [2024-11-07 15:33:40,839 INFO L125 PetriNetUnfolderBase]: For 2503/2523 co-relation queries the response was YES. [2024-11-07 15:33:40,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3151 conditions, 827 events. 197/827 cut-off events. For 2503/2523 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 5088 event pairs, 21 based on Foata normal form. 13/833 useless extension candidates. Maximal degree in co-relation 3117. Up to 170 conditions per place. [2024-11-07 15:33:40,846 INFO L140 encePairwiseOnDemand]: 84/95 looper letters, 91 selfloop transitions, 37 changer transitions 7/229 dead transitions. [2024-11-07 15:33:40,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 229 transitions, 2122 flow [2024-11-07 15:33:40,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 15:33:40,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-07 15:33:40,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 898 transitions. [2024-11-07 15:33:40,849 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7271255060728745 [2024-11-07 15:33:40,850 INFO L175 Difference]: Start difference. First operand has 159 places, 204 transitions, 1566 flow. Second operand 13 states and 898 transitions. [2024-11-07 15:33:40,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 229 transitions, 2122 flow [2024-11-07 15:33:40,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 229 transitions, 2069 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-11-07 15:33:40,871 INFO L231 Difference]: Finished difference. Result has 158 places, 199 transitions, 1552 flow [2024-11-07 15:33:40,873 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=1507, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1552, PETRI_PLACES=158, PETRI_TRANSITIONS=199} [2024-11-07 15:33:40,874 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, 60 predicate places. [2024-11-07 15:33:40,874 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 199 transitions, 1552 flow [2024-11-07 15:33:40,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 67.54545454545455) internal successors, (743), 11 states have internal predecessors, (743), 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-07 15:33:40,874 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:33:40,874 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-07 15:33:40,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 15:33:40,875 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-07 15:33:40,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:33:40,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1774965859, now seen corresponding path program 1 times [2024-11-07 15:33:40,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:33:40,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270937902] [2024-11-07 15:33:40,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:33:40,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:33:40,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 15:33:40,897 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 15:33:40,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 15:33:40,943 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 15:33:40,943 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 15:33:40,944 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (13 of 14 remaining) [2024-11-07 15:33:40,947 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2024-11-07 15:33:40,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2024-11-07 15:33:40,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2024-11-07 15:33:40,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2024-11-07 15:33:40,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 14 remaining) [2024-11-07 15:33:40,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2024-11-07 15:33:40,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2024-11-07 15:33:40,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2024-11-07 15:33:40,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2024-11-07 15:33:40,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2024-11-07 15:33:40,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2024-11-07 15:33:40,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2024-11-07 15:33:40,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2024-11-07 15:33:40,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 15:33:40,952 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:33:41,003 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-07 15:33:41,003 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 15:33:41,009 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 03:33:41 BasicIcfg [2024-11-07 15:33:41,010 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 15:33:41,011 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 15:33:41,011 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 15:33:41,011 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 15:33:41,012 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:33:29" (3/4) ... [2024-11-07 15:33:41,012 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-07 15:33:41,065 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 15:33:41,065 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 15:33:41,068 INFO L158 Benchmark]: Toolchain (without parser) took 13214.31ms. Allocated memory was 100.7MB in the beginning and 234.9MB in the end (delta: 134.2MB). Free memory was 73.9MB in the beginning and 96.4MB in the end (delta: -22.5MB). Peak memory consumption was 108.9MB. Max. memory is 16.1GB. [2024-11-07 15:33:41,068 INFO L158 Benchmark]: CDTParser took 1.14ms. Allocated memory is still 83.9MB. Free memory is still 48.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 15:33:41,068 INFO L158 Benchmark]: CACSL2BoogieTranslator took 656.37ms. Allocated memory is still 100.7MB. Free memory was 73.8MB in the beginning and 72.3MB in the end (delta: 1.5MB). Peak memory consumption was 47.8MB. Max. memory is 16.1GB. [2024-11-07 15:33:41,068 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.59ms. Allocated memory is still 100.7MB. Free memory was 72.3MB in the beginning and 70.0MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 15:33:41,068 INFO L158 Benchmark]: Boogie Preprocessor took 42.36ms. Allocated memory is still 100.7MB. Free memory was 70.0MB in the beginning and 68.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 15:33:41,068 INFO L158 Benchmark]: RCFGBuilder took 450.65ms. Allocated memory is still 100.7MB. Free memory was 68.7MB in the beginning and 53.0MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 15:33:41,069 INFO L158 Benchmark]: TraceAbstraction took 11955.72ms. Allocated memory was 100.7MB in the beginning and 234.9MB in the end (delta: 134.2MB). Free memory was 52.6MB in the beginning and 102.3MB in the end (delta: -49.7MB). Peak memory consumption was 86.3MB. Max. memory is 16.1GB. [2024-11-07 15:33:41,069 INFO L158 Benchmark]: Witness Printer took 54.86ms. Allocated memory is still 234.9MB. Free memory was 102.3MB in the beginning and 96.4MB in the end (delta: 5.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 15:33:41,071 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.14ms. Allocated memory is still 83.9MB. Free memory is still 48.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 656.37ms. Allocated memory is still 100.7MB. Free memory was 73.8MB in the beginning and 72.3MB in the end (delta: 1.5MB). Peak memory consumption was 47.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.59ms. Allocated memory is still 100.7MB. Free memory was 72.3MB in the beginning and 70.0MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 42.36ms. Allocated memory is still 100.7MB. Free memory was 70.0MB in the beginning and 68.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 450.65ms. Allocated memory is still 100.7MB. Free memory was 68.7MB in the beginning and 53.0MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 11955.72ms. Allocated memory was 100.7MB in the beginning and 234.9MB in the end (delta: 134.2MB). Free memory was 52.6MB in the beginning and 102.3MB in the end (delta: -49.7MB). Peak memory consumption was 86.3MB. Max. memory is 16.1GB. * Witness Printer took 54.86ms. Allocated memory is still 234.9MB. Free memory was 102.3MB in the beginning and 96.4MB in the end (delta: 5.9MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 1245]: Data race detected Data race detected The following path leads to a data race: [L1227] 0 data *d; VAL [d={0:0}] [L1228] 0 pthread_mutex_t m = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [d={0:0}, m={1:0}] [L1237] 0 pthread_t id; VAL [d={0:0}, m={1:0}] [L1238] 0 data *z; VAL [d={0:0}, m={1:0}] [L1239] 0 d = malloc(sizeof(data)) VAL [d={-2:0}, m={1:0}] [L1240] 0 z = d VAL [d={-2:0}, m={1:0}, z={-2:0}] [L1241] FCALL, FORK 0 pthread_create(&id, ((void *)0), t_fun, ((void *)0)) VAL [\old(arg)={0:0}, d={-2:0}, id=-1, m={1:0}, z={-2:0}] [L1243] EXPR 0 d->x VAL [\old(arg)={0:0}, d={-2:0}, id=-1, m={1:0}, z={-2:0}] [L1243] 0 printf("%d\n",d->x) VAL [\old(arg)={0:0}, d={-2:0}, id=-1, m={1:0}, z={-2:0}] [L1245] EXPR 0 z->y VAL [\old(arg)={0:0}, d={-2:0}, id=-1, m={1:0}, z={-2:0}] [L1231] EXPR 1 d->x VAL [\old(arg)={0:0}, arg={0:0}, d={-2:0}, m={1:0}] [L1231] 1 d->x = 3 VAL [\old(arg)={0:0}, arg={0:0}, d={-2:0}, m={1:0}] [L1232] EXPR 1 d->y VAL [\old(arg)={0:0}, arg={0:0}, d={-2:0}, m={1:0}] [L1232] 1 d->y = 8 VAL [\old(arg)={0:0}, arg={0:0}, d={-2:0}, m={1:0}] [L1245] 0 printf("%d\n",z->y) VAL [\old(arg)={0:0}, arg={0:0}, d={-2:0}, id=-1, m={1:0}, z={-2:0}] Now there is a data race, but we were unable to determine exactly which statements and variables are involved. There could be a race between one of the statements * C: d->x = 3 [1231] * C: d->y = 8 [1232] * C: d->x = 3 [1231] * C: d->x = 3 [1231] * C: d->x = 3 [1231] * C: d = malloc(sizeof(data)) [1239] and C: printf("%d\n",z->y) [1245] - UnprovableResult [Line: 1239]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1240]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1243]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1243]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1241]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1231]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1231]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1232]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1232]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 129 locations, 14 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: 11.8s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1464 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1060 mSDsluCounter, 424 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 360 mSDsCounter, 500 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4784 IncrementalHoareTripleChecker+Invalid, 5284 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 500 mSolverCounterUnsat, 64 mSDtfsCounter, 4784 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1566occurred in iteration=12, InterpolantAutomatonStates: 101, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 740 NumberOfCodeBlocks, 740 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 657 ConstructedInterpolants, 0 QuantifiedInterpolants, 4135 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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 RESULT: Ultimate proved your program to be incorrect! [2024-11-07 15:33:41,100 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE