./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread/fib_unsafe-5-racy.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/pthread/fib_unsafe-5-racy.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', '146f0d3d7f309689872842ec2e107172ef6d7d230f0dea419a95cb8899767aeb'] 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/pthread/fib_unsafe-5-racy.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 146f0d3d7f309689872842ec2e107172ef6d7d230f0dea419a95cb8899767aeb --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 15:14:46,898 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 15:14:46,973 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:14:46,978 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 15:14:46,978 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 15:14:47,008 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 15:14:47,008 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 15:14:47,008 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 15:14:47,009 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 15:14:47,009 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 15:14:47,009 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 15:14:47,009 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 15:14:47,009 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 15:14:47,009 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 15:14:47,009 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 15:14:47,009 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 15:14:47,009 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 15:14:47,010 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 15:14:47,010 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 15:14:47,010 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 15:14:47,010 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 15:14:47,010 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 15:14:47,010 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-07 15:14:47,010 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 15:14:47,010 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 15:14:47,010 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 15:14:47,010 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 15:14:47,010 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 15:14:47,010 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 15:14:47,010 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 15:14:47,011 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 15:14:47,011 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 15:14:47,011 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 15:14:47,011 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 15:14:47,011 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 15:14:47,014 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 15:14:47,014 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 15:14:47,014 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 15:14:47,014 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 15:14:47,014 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 15:14:47,014 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 15:14:47,014 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 -> 146f0d3d7f309689872842ec2e107172ef6d7d230f0dea419a95cb8899767aeb [2024-11-07 15:14:47,315 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 15:14:47,323 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 15:14:47,326 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 15:14:47,327 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 15:14:47,328 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 15:14:47,329 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/fib_unsafe-5-racy.i [2024-11-07 15:14:48,653 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 15:14:48,953 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 15:14:48,953 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread/fib_unsafe-5-racy.i [2024-11-07 15:14:48,972 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a5c01688f/259751253d0b46949664947ee29e5001/FLAG1bdde5882 [2024-11-07 15:14:48,997 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a5c01688f/259751253d0b46949664947ee29e5001 [2024-11-07 15:14:48,999 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 15:14:49,001 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 15:14:49,002 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 15:14:49,002 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 15:14:49,006 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 15:14:49,007 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:14:48" (1/1) ... [2024-11-07 15:14:49,007 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b8f7a2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:14:49, skipping insertion in model container [2024-11-07 15:14:49,007 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:14:48" (1/1) ... [2024-11-07 15:14:49,039 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 15:14:49,291 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 15:14:49,306 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 15:14:49,354 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 15:14:49,396 INFO L204 MainTranslator]: Completed translation [2024-11-07 15:14:49,397 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:14:49 WrapperNode [2024-11-07 15:14:49,398 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 15:14:49,399 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 15:14:49,399 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 15:14:49,399 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 15:14:49,404 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:14:49" (1/1) ... [2024-11-07 15:14:49,421 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:14:49" (1/1) ... [2024-11-07 15:14:49,443 INFO L138 Inliner]: procedures = 163, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 114 [2024-11-07 15:14:49,445 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 15:14:49,446 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 15:14:49,446 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 15:14:49,446 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 15:14:49,452 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:14:49" (1/1) ... [2024-11-07 15:14:49,453 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:14:49" (1/1) ... [2024-11-07 15:14:49,457 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:14:49" (1/1) ... [2024-11-07 15:14:49,460 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:14:49" (1/1) ... [2024-11-07 15:14:49,469 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:14:49" (1/1) ... [2024-11-07 15:14:49,477 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:14:49" (1/1) ... [2024-11-07 15:14:49,478 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:14:49" (1/1) ... [2024-11-07 15:14:49,483 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:14:49" (1/1) ... [2024-11-07 15:14:49,485 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 15:14:49,485 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 15:14:49,485 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 15:14:49,485 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 15:14:49,486 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:14:49" (1/1) ... [2024-11-07 15:14:49,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 15:14:49,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 15:14:49,524 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:14:49,528 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:14:49,549 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-11-07 15:14:49,550 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-11-07 15:14:49,551 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-11-07 15:14:49,551 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-11-07 15:14:49,551 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-07 15:14:49,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 15:14:49,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-07 15:14:49,551 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-07 15:14:49,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 15:14:49,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 15:14:49,553 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:14:49,688 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 15:14:49,689 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 15:14:49,940 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-07 15:14:49,940 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 15:14:49,993 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 15:14:49,995 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-07 15:14:49,996 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:14:49 BoogieIcfgContainer [2024-11-07 15:14:49,996 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 15:14:49,999 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 15:14:50,000 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 15:14:50,004 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 15:14:50,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 03:14:48" (1/3) ... [2024-11-07 15:14:50,005 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60d55c2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:14:50, skipping insertion in model container [2024-11-07 15:14:50,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:14:49" (2/3) ... [2024-11-07 15:14:50,005 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60d55c2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:14:50, skipping insertion in model container [2024-11-07 15:14:50,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:14:49" (3/3) ... [2024-11-07 15:14:50,006 INFO L112 eAbstractionObserver]: Analyzing ICFG fib_unsafe-5-racy.i [2024-11-07 15:14:50,027 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 15:14:50,028 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2024-11-07 15:14:50,028 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-07 15:14:50,092 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-07 15:14:50,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 186 places, 188 transitions, 384 flow [2024-11-07 15:14:50,206 INFO L124 PetriNetUnfolderBase]: 9/186 cut-off events. [2024-11-07 15:14:50,209 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 15:14:50,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193 conditions, 186 events. 9/186 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 382 event pairs, 0 based on Foata normal form. 0/147 useless extension candidates. Maximal degree in co-relation 159. Up to 2 conditions per place. [2024-11-07 15:14:50,215 INFO L82 GeneralOperation]: Start removeDead. Operand has 186 places, 188 transitions, 384 flow [2024-11-07 15:14:50,221 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 184 places, 186 transitions, 378 flow [2024-11-07 15:14:50,228 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 15:14:50,241 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;@3e55d228, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 15:14:50,242 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2024-11-07 15:14:50,251 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 15:14:50,251 INFO L124 PetriNetUnfolderBase]: 0/21 cut-off events. [2024-11-07 15:14:50,251 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 15:14:50,251 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:14:50,252 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] [2024-11-07 15:14:50,253 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-07 15:14:50,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:14:50,258 INFO L85 PathProgramCache]: Analyzing trace with hash 959234546, now seen corresponding path program 1 times [2024-11-07 15:14:50,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:14:50,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937011785] [2024-11-07 15:14:50,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:14:50,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:14:50,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:14:50,396 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:14:50,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:14:50,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937011785] [2024-11-07 15:14:50,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937011785] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:14:50,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:14:50,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-07 15:14:50,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199793324] [2024-11-07 15:14:50,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:14:50,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 15:14:50,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:14:50,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 15:14:50,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 15:14:50,428 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 188 [2024-11-07 15:14:50,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 186 transitions, 378 flow. Second operand has 2 states, 2 states have (on average 168.5) internal successors, (337), 2 states have internal predecessors, (337), 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:14:50,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:14:50,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 188 [2024-11-07 15:14:50,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:14:50,524 INFO L124 PetriNetUnfolderBase]: 9/286 cut-off events. [2024-11-07 15:14:50,525 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-07 15:14:50,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 306 conditions, 286 events. 9/286 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 931 event pairs, 2 based on Foata normal form. 12/248 useless extension candidates. Maximal degree in co-relation 270. Up to 11 conditions per place. [2024-11-07 15:14:50,530 INFO L140 encePairwiseOnDemand]: 175/188 looper letters, 6 selfloop transitions, 0 changer transitions 0/171 dead transitions. [2024-11-07 15:14:50,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 171 transitions, 360 flow [2024-11-07 15:14:50,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 15:14:50,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-07 15:14:50,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 355 transitions. [2024-11-07 15:14:50,542 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9441489361702128 [2024-11-07 15:14:50,544 INFO L175 Difference]: Start difference. First operand has 184 places, 186 transitions, 378 flow. Second operand 2 states and 355 transitions. [2024-11-07 15:14:50,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 171 transitions, 360 flow [2024-11-07 15:14:50,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 171 transitions, 358 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:14:50,553 INFO L231 Difference]: Finished difference. Result has 173 places, 171 transitions, 346 flow [2024-11-07 15:14:50,556 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=346, PETRI_PLACES=173, PETRI_TRANSITIONS=171} [2024-11-07 15:14:50,559 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -11 predicate places. [2024-11-07 15:14:50,560 INFO L471 AbstractCegarLoop]: Abstraction has has 173 places, 171 transitions, 346 flow [2024-11-07 15:14:50,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 168.5) internal successors, (337), 2 states have internal predecessors, (337), 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:14:50,561 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:14:50,561 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] [2024-11-07 15:14:50,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 15:14:50,562 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-07 15:14:50,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:14:50,563 INFO L85 PathProgramCache]: Analyzing trace with hash -529477545, now seen corresponding path program 1 times [2024-11-07 15:14:50,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:14:50,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13760260] [2024-11-07 15:14:50,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:14:50,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:14:50,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:14:50,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:14:50,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:14:50,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13760260] [2024-11-07 15:14:50,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13760260] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:14:50,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:14:50,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:14:50,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35197415] [2024-11-07 15:14:50,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:14:50,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:14:50,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:14:50,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:14:50,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:14:50,697 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 188 [2024-11-07 15:14:50,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 171 transitions, 346 flow. Second operand has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 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:14:50,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:14:50,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 188 [2024-11-07 15:14:50,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:14:50,779 INFO L124 PetriNetUnfolderBase]: 30/366 cut-off events. [2024-11-07 15:14:50,779 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 15:14:50,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 439 conditions, 366 events. 30/366 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1651 event pairs, 8 based on Foata normal form. 0/296 useless extension candidates. Maximal degree in co-relation 436. Up to 41 conditions per place. [2024-11-07 15:14:50,786 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 13 selfloop transitions, 2 changer transitions 0/172 dead transitions. [2024-11-07 15:14:50,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 172 transitions, 380 flow [2024-11-07 15:14:50,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:14:50,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:14:50,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 496 transitions. [2024-11-07 15:14:50,792 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8794326241134752 [2024-11-07 15:14:50,792 INFO L175 Difference]: Start difference. First operand has 173 places, 171 transitions, 346 flow. Second operand 3 states and 496 transitions. [2024-11-07 15:14:50,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 172 transitions, 380 flow [2024-11-07 15:14:50,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 172 transitions, 380 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 15:14:50,796 INFO L231 Difference]: Finished difference. Result has 174 places, 170 transitions, 348 flow [2024-11-07 15:14:50,796 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=348, PETRI_PLACES=174, PETRI_TRANSITIONS=170} [2024-11-07 15:14:50,797 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -10 predicate places. [2024-11-07 15:14:50,797 INFO L471 AbstractCegarLoop]: Abstraction has has 174 places, 170 transitions, 348 flow [2024-11-07 15:14:50,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 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:14:50,798 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:14:50,798 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] [2024-11-07 15:14:50,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 15:14:50,798 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-07 15:14:50,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:14:50,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1749844589, now seen corresponding path program 1 times [2024-11-07 15:14:50,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:14:50,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90901094] [2024-11-07 15:14:50,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:14:50,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:14:50,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:14:50,848 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:14:50,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:14:50,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90901094] [2024-11-07 15:14:50,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90901094] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:14:50,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:14:50,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:14:50,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195323875] [2024-11-07 15:14:50,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:14:50,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:14:50,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:14:50,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:14:50,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:14:50,868 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 188 [2024-11-07 15:14:50,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 170 transitions, 348 flow. Second operand has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 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:14:50,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:14:50,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 188 [2024-11-07 15:14:50,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:14:50,921 INFO L124 PetriNetUnfolderBase]: 20/222 cut-off events. [2024-11-07 15:14:50,921 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-07 15:14:50,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 290 conditions, 222 events. 20/222 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 806 event pairs, 4 based on Foata normal form. 0/191 useless extension candidates. Maximal degree in co-relation 286. Up to 25 conditions per place. [2024-11-07 15:14:50,924 INFO L140 encePairwiseOnDemand]: 184/188 looper letters, 12 selfloop transitions, 2 changer transitions 0/170 dead transitions. [2024-11-07 15:14:50,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 170 transitions, 378 flow [2024-11-07 15:14:50,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:14:50,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:14:50,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 496 transitions. [2024-11-07 15:14:50,926 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8794326241134752 [2024-11-07 15:14:50,926 INFO L175 Difference]: Start difference. First operand has 174 places, 170 transitions, 348 flow. Second operand 3 states and 496 transitions. [2024-11-07 15:14:50,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 170 transitions, 378 flow [2024-11-07 15:14:50,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 170 transitions, 374 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:14:50,930 INFO L231 Difference]: Finished difference. Result has 172 places, 168 transitions, 344 flow [2024-11-07 15:14:50,930 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=344, PETRI_PLACES=172, PETRI_TRANSITIONS=168} [2024-11-07 15:14:50,931 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -12 predicate places. [2024-11-07 15:14:50,931 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 168 transitions, 344 flow [2024-11-07 15:14:50,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 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:14:50,932 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:14:50,932 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:14:50,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 15:14:50,932 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-07 15:14:50,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:14:50,933 INFO L85 PathProgramCache]: Analyzing trace with hash -934832415, now seen corresponding path program 1 times [2024-11-07 15:14:50,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:14:50,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511251245] [2024-11-07 15:14:50,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:14:50,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:14:50,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:14:50,999 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:14:50,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:14:51,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511251245] [2024-11-07 15:14:51,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511251245] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:14:51,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:14:51,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:14:51,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174384199] [2024-11-07 15:14:51,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:14:51,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:14:51,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:14:51,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:14:51,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:14:51,029 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 188 [2024-11-07 15:14:51,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 168 transitions, 344 flow. Second operand has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 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:14:51,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:14:51,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 188 [2024-11-07 15:14:51,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:14:51,100 INFO L124 PetriNetUnfolderBase]: 16/288 cut-off events. [2024-11-07 15:14:51,101 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 15:14:51,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 288 events. 16/288 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1079 event pairs, 7 based on Foata normal form. 0/242 useless extension candidates. Maximal degree in co-relation 327. Up to 26 conditions per place. [2024-11-07 15:14:51,104 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 12 selfloop transitions, 2 changer transitions 0/168 dead transitions. [2024-11-07 15:14:51,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 168 transitions, 372 flow [2024-11-07 15:14:51,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:14:51,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:14:51,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 495 transitions. [2024-11-07 15:14:51,107 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8776595744680851 [2024-11-07 15:14:51,107 INFO L175 Difference]: Start difference. First operand has 172 places, 168 transitions, 344 flow. Second operand 3 states and 495 transitions. [2024-11-07 15:14:51,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 168 transitions, 372 flow [2024-11-07 15:14:51,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 168 transitions, 368 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:14:51,111 INFO L231 Difference]: Finished difference. Result has 171 places, 167 transitions, 342 flow [2024-11-07 15:14:51,111 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=342, PETRI_PLACES=171, PETRI_TRANSITIONS=167} [2024-11-07 15:14:51,112 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -13 predicate places. [2024-11-07 15:14:51,112 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 167 transitions, 342 flow [2024-11-07 15:14:51,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 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:14:51,113 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:14:51,113 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:14:51,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 15:14:51,113 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-07 15:14:51,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:14:51,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1890395950, now seen corresponding path program 1 times [2024-11-07 15:14:51,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:14:51,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427491726] [2024-11-07 15:14:51,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:14:51,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:14:51,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:14:51,160 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:14:51,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:14:51,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427491726] [2024-11-07 15:14:51,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427491726] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:14:51,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:14:51,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:14:51,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457493129] [2024-11-07 15:14:51,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:14:51,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:14:51,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:14:51,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:14:51,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:14:51,194 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 188 [2024-11-07 15:14:51,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 167 transitions, 342 flow. Second operand has 3 states, 3 states have (on average 160.66666666666666) internal successors, (482), 3 states have internal predecessors, (482), 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:14:51,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:14:51,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 188 [2024-11-07 15:14:51,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:14:51,288 INFO L124 PetriNetUnfolderBase]: 49/479 cut-off events. [2024-11-07 15:14:51,289 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 15:14:51,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 575 conditions, 479 events. 49/479 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2570 event pairs, 30 based on Foata normal form. 0/396 useless extension candidates. Maximal degree in co-relation 571. Up to 67 conditions per place. [2024-11-07 15:14:51,293 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 15 selfloop transitions, 2 changer transitions 0/168 dead transitions. [2024-11-07 15:14:51,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 168 transitions, 378 flow [2024-11-07 15:14:51,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:14:51,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:14:51,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 492 transitions. [2024-11-07 15:14:51,296 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8723404255319149 [2024-11-07 15:14:51,296 INFO L175 Difference]: Start difference. First operand has 171 places, 167 transitions, 342 flow. Second operand 3 states and 492 transitions. [2024-11-07 15:14:51,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 168 transitions, 378 flow [2024-11-07 15:14:51,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 168 transitions, 374 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:14:51,299 INFO L231 Difference]: Finished difference. Result has 170 places, 166 transitions, 340 flow [2024-11-07 15:14:51,299 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=340, PETRI_PLACES=170, PETRI_TRANSITIONS=166} [2024-11-07 15:14:51,300 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -14 predicate places. [2024-11-07 15:14:51,300 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 166 transitions, 340 flow [2024-11-07 15:14:51,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 160.66666666666666) internal successors, (482), 3 states have internal predecessors, (482), 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:14:51,301 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:14:51,301 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:14:51,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 15:14:51,301 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-07 15:14:51,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:14:51,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1023988735, now seen corresponding path program 1 times [2024-11-07 15:14:51,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:14:51,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480927789] [2024-11-07 15:14:51,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:14:51,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:14:51,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:14:51,356 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:14:51,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:14:51,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480927789] [2024-11-07 15:14:51,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480927789] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:14:51,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:14:51,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:14:51,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122538171] [2024-11-07 15:14:51,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:14:51,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:14:51,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:14:51,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:14:51,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:14:51,375 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 188 [2024-11-07 15:14:51,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 166 transitions, 340 flow. Second operand has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 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:14:51,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:14:51,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 188 [2024-11-07 15:14:51,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:14:51,430 INFO L124 PetriNetUnfolderBase]: 15/281 cut-off events. [2024-11-07 15:14:51,430 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 15:14:51,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 323 conditions, 281 events. 15/281 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1018 event pairs, 3 based on Foata normal form. 0/242 useless extension candidates. Maximal degree in co-relation 319. Up to 15 conditions per place. [2024-11-07 15:14:51,433 INFO L140 encePairwiseOnDemand]: 184/188 looper letters, 11 selfloop transitions, 2 changer transitions 0/165 dead transitions. [2024-11-07 15:14:51,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 165 transitions, 364 flow [2024-11-07 15:14:51,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:14:51,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:14:51,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 495 transitions. [2024-11-07 15:14:51,435 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8776595744680851 [2024-11-07 15:14:51,435 INFO L175 Difference]: Start difference. First operand has 170 places, 166 transitions, 340 flow. Second operand 3 states and 495 transitions. [2024-11-07 15:14:51,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 165 transitions, 364 flow [2024-11-07 15:14:51,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 165 transitions, 360 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:14:51,438 INFO L231 Difference]: Finished difference. Result has 168 places, 164 transitions, 336 flow [2024-11-07 15:14:51,438 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=336, PETRI_PLACES=168, PETRI_TRANSITIONS=164} [2024-11-07 15:14:51,439 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -16 predicate places. [2024-11-07 15:14:51,439 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 164 transitions, 336 flow [2024-11-07 15:14:51,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 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:14:51,439 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:14:51,439 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] [2024-11-07 15:14:51,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 15:14:51,440 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-07 15:14:51,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:14:51,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1174888269, now seen corresponding path program 1 times [2024-11-07 15:14:51,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:14:51,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944341842] [2024-11-07 15:14:51,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:14:51,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:14:51,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:14:51,487 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:14:51,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:14:51,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944341842] [2024-11-07 15:14:51,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944341842] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:14:51,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:14:51,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:14:51,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737208130] [2024-11-07 15:14:51,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:14:51,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:14:51,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:14:51,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:14:51,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:14:51,505 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 188 [2024-11-07 15:14:51,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 164 transitions, 336 flow. Second operand has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 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:14:51,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:14:51,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 188 [2024-11-07 15:14:51,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:14:51,583 INFO L124 PetriNetUnfolderBase]: 37/449 cut-off events. [2024-11-07 15:14:51,583 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 15:14:51,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 521 conditions, 449 events. 37/449 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2214 event pairs, 10 based on Foata normal form. 0/384 useless extension candidates. Maximal degree in co-relation 517. Up to 32 conditions per place. [2024-11-07 15:14:51,587 INFO L140 encePairwiseOnDemand]: 184/188 looper letters, 12 selfloop transitions, 2 changer transitions 0/164 dead transitions. [2024-11-07 15:14:51,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 164 transitions, 364 flow [2024-11-07 15:14:51,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:14:51,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:14:51,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 496 transitions. [2024-11-07 15:14:51,589 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8794326241134752 [2024-11-07 15:14:51,590 INFO L175 Difference]: Start difference. First operand has 168 places, 164 transitions, 336 flow. Second operand 3 states and 496 transitions. [2024-11-07 15:14:51,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 164 transitions, 364 flow [2024-11-07 15:14:51,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 164 transitions, 360 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:14:51,593 INFO L231 Difference]: Finished difference. Result has 166 places, 162 transitions, 332 flow [2024-11-07 15:14:51,593 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=332, PETRI_PLACES=166, PETRI_TRANSITIONS=162} [2024-11-07 15:14:51,594 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -18 predicate places. [2024-11-07 15:14:51,594 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 162 transitions, 332 flow [2024-11-07 15:14:51,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 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:14:51,595 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:14:51,595 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] [2024-11-07 15:14:51,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 15:14:51,595 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-07 15:14:51,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:14:51,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1742870495, now seen corresponding path program 1 times [2024-11-07 15:14:51,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:14:51,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598788733] [2024-11-07 15:14:51,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:14:51,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:14:51,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:14:51,660 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:14:51,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:14:51,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598788733] [2024-11-07 15:14:51,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598788733] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:14:51,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:14:51,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:14:51,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176100869] [2024-11-07 15:14:51,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:14:51,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:14:51,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:14:51,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:14:51,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:14:51,682 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 188 [2024-11-07 15:14:51,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 162 transitions, 332 flow. Second operand has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 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:14:51,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:14:51,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 188 [2024-11-07 15:14:51,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:14:51,722 INFO L124 PetriNetUnfolderBase]: 20/213 cut-off events. [2024-11-07 15:14:51,722 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 15:14:51,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 280 conditions, 213 events. 20/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 753 event pairs, 10 based on Foata normal form. 0/191 useless extension candidates. Maximal degree in co-relation 276. Up to 34 conditions per place. [2024-11-07 15:14:51,724 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 13 selfloop transitions, 2 changer transitions 0/163 dead transitions. [2024-11-07 15:14:51,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 163 transitions, 366 flow [2024-11-07 15:14:51,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:14:51,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:14:51,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 496 transitions. [2024-11-07 15:14:51,726 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8794326241134752 [2024-11-07 15:14:51,726 INFO L175 Difference]: Start difference. First operand has 166 places, 162 transitions, 332 flow. Second operand 3 states and 496 transitions. [2024-11-07 15:14:51,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 163 transitions, 366 flow [2024-11-07 15:14:51,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 163 transitions, 362 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:14:51,729 INFO L231 Difference]: Finished difference. Result has 165 places, 161 transitions, 330 flow [2024-11-07 15:14:51,729 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=330, PETRI_PLACES=165, PETRI_TRANSITIONS=161} [2024-11-07 15:14:51,730 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -19 predicate places. [2024-11-07 15:14:51,730 INFO L471 AbstractCegarLoop]: Abstraction has has 165 places, 161 transitions, 330 flow [2024-11-07 15:14:51,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 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:14:51,730 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:14:51,731 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] [2024-11-07 15:14:51,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 15:14:51,731 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-07 15:14:51,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:14:51,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1408283567, now seen corresponding path program 1 times [2024-11-07 15:14:51,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:14:51,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505435310] [2024-11-07 15:14:51,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:14:51,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:14:51,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:14:51,773 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:14:51,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:14:51,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505435310] [2024-11-07 15:14:51,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505435310] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:14:51,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:14:51,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:14:51,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196833737] [2024-11-07 15:14:51,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:14:51,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:14:51,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:14:51,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:14:51,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:14:51,789 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 188 [2024-11-07 15:14:51,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 161 transitions, 330 flow. Second operand has 3 states, 3 states have (on average 163.0) internal successors, (489), 3 states have internal predecessors, (489), 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:14:51,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:14:51,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 188 [2024-11-07 15:14:51,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:14:51,850 INFO L124 PetriNetUnfolderBase]: 33/412 cut-off events. [2024-11-07 15:14:51,851 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 15:14:51,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 476 conditions, 412 events. 33/412 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1868 event pairs, 6 based on Foata normal form. 0/360 useless extension candidates. Maximal degree in co-relation 472. Up to 32 conditions per place. [2024-11-07 15:14:51,854 INFO L140 encePairwiseOnDemand]: 183/188 looper letters, 10 selfloop transitions, 3 changer transitions 0/161 dead transitions. [2024-11-07 15:14:51,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 161 transitions, 356 flow [2024-11-07 15:14:51,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:14:51,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:14:51,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 498 transitions. [2024-11-07 15:14:51,856 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8829787234042553 [2024-11-07 15:14:51,856 INFO L175 Difference]: Start difference. First operand has 165 places, 161 transitions, 330 flow. Second operand 3 states and 498 transitions. [2024-11-07 15:14:51,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 161 transitions, 356 flow [2024-11-07 15:14:51,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 161 transitions, 352 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:14:51,859 INFO L231 Difference]: Finished difference. Result has 163 places, 159 transitions, 328 flow [2024-11-07 15:14:51,860 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=328, PETRI_PLACES=163, PETRI_TRANSITIONS=159} [2024-11-07 15:14:51,860 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -21 predicate places. [2024-11-07 15:14:51,860 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 159 transitions, 328 flow [2024-11-07 15:14:51,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.0) internal successors, (489), 3 states have internal predecessors, (489), 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:14:51,861 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:14:51,861 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:14:51,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 15:14:51,861 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-07 15:14:51,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:14:51,862 INFO L85 PathProgramCache]: Analyzing trace with hash 445824893, now seen corresponding path program 1 times [2024-11-07 15:14:51,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:14:51,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978838536] [2024-11-07 15:14:51,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:14:51,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:14:51,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:14:51,893 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:14:51,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:14:51,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978838536] [2024-11-07 15:14:51,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978838536] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:14:51,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:14:51,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:14:51,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96148057] [2024-11-07 15:14:51,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:14:51,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:14:51,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:14:51,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:14:51,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:14:51,910 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 188 [2024-11-07 15:14:51,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 159 transitions, 328 flow. Second operand has 3 states, 3 states have (on average 163.0) internal successors, (489), 3 states have internal predecessors, (489), 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:14:51,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:14:51,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 188 [2024-11-07 15:14:51,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:14:51,968 INFO L124 PetriNetUnfolderBase]: 31/360 cut-off events. [2024-11-07 15:14:51,968 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 15:14:51,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 430 conditions, 360 events. 31/360 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1470 event pairs, 6 based on Foata normal form. 0/322 useless extension candidates. Maximal degree in co-relation 426. Up to 32 conditions per place. [2024-11-07 15:14:51,973 INFO L140 encePairwiseOnDemand]: 184/188 looper letters, 11 selfloop transitions, 2 changer transitions 0/159 dead transitions. [2024-11-07 15:14:51,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 159 transitions, 354 flow [2024-11-07 15:14:51,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:14:51,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:14:51,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 498 transitions. [2024-11-07 15:14:51,976 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8829787234042553 [2024-11-07 15:14:51,976 INFO L175 Difference]: Start difference. First operand has 163 places, 159 transitions, 328 flow. Second operand 3 states and 498 transitions. [2024-11-07 15:14:51,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 159 transitions, 354 flow [2024-11-07 15:14:51,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 159 transitions, 348 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:14:51,979 INFO L231 Difference]: Finished difference. Result has 161 places, 157 transitions, 322 flow [2024-11-07 15:14:51,979 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=322, PETRI_PLACES=161, PETRI_TRANSITIONS=157} [2024-11-07 15:14:51,980 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -23 predicate places. [2024-11-07 15:14:51,980 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 157 transitions, 322 flow [2024-11-07 15:14:51,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.0) internal successors, (489), 3 states have internal predecessors, (489), 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:14:51,980 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:14:51,980 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:14:51,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 15:14:51,980 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-07 15:14:51,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:14:51,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1193293355, now seen corresponding path program 1 times [2024-11-07 15:14:51,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:14:51,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287935097] [2024-11-07 15:14:51,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:14:51,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:14:51,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:14:52,020 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:14:52,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:14:52,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287935097] [2024-11-07 15:14:52,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287935097] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:14:52,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:14:52,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:14:52,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892914020] [2024-11-07 15:14:52,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:14:52,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:14:52,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:14:52,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:14:52,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:14:52,044 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 188 [2024-11-07 15:14:52,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 157 transitions, 322 flow. Second operand has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 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:14:52,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:14:52,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 188 [2024-11-07 15:14:52,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:14:52,080 INFO L124 PetriNetUnfolderBase]: 15/266 cut-off events. [2024-11-07 15:14:52,080 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 15:14:52,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 310 conditions, 266 events. 15/266 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 920 event pairs, 6 based on Foata normal form. 0/242 useless extension candidates. Maximal degree in co-relation 306. Up to 25 conditions per place. [2024-11-07 15:14:52,083 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 12 selfloop transitions, 2 changer transitions 0/157 dead transitions. [2024-11-07 15:14:52,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 157 transitions, 350 flow [2024-11-07 15:14:52,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:14:52,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:14:52,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 495 transitions. [2024-11-07 15:14:52,085 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8776595744680851 [2024-11-07 15:14:52,085 INFO L175 Difference]: Start difference. First operand has 161 places, 157 transitions, 322 flow. Second operand 3 states and 495 transitions. [2024-11-07 15:14:52,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 157 transitions, 350 flow [2024-11-07 15:14:52,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 157 transitions, 346 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:14:52,088 INFO L231 Difference]: Finished difference. Result has 160 places, 156 transitions, 320 flow [2024-11-07 15:14:52,088 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=320, PETRI_PLACES=160, PETRI_TRANSITIONS=156} [2024-11-07 15:14:52,089 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -24 predicate places. [2024-11-07 15:14:52,089 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 156 transitions, 320 flow [2024-11-07 15:14:52,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 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:14:52,090 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:14:52,090 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] [2024-11-07 15:14:52,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 15:14:52,090 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-07 15:14:52,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:14:52,091 INFO L85 PathProgramCache]: Analyzing trace with hash 215393162, now seen corresponding path program 1 times [2024-11-07 15:14:52,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:14:52,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235590289] [2024-11-07 15:14:52,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:14:52,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:14:52,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:14:52,145 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:14:52,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:14:52,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235590289] [2024-11-07 15:14:52,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235590289] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:14:52,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:14:52,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:14:52,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480211718] [2024-11-07 15:14:52,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:14:52,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:14:52,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:14:52,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:14:52,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:14:52,164 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 188 [2024-11-07 15:14:52,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 156 transitions, 320 flow. Second operand has 3 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 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:14:52,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:14:52,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 188 [2024-11-07 15:14:52,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:14:52,218 INFO L124 PetriNetUnfolderBase]: 41/436 cut-off events. [2024-11-07 15:14:52,218 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 15:14:52,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 516 conditions, 436 events. 41/436 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2170 event pairs, 22 based on Foata normal form. 0/394 useless extension candidates. Maximal degree in co-relation 512. Up to 51 conditions per place. [2024-11-07 15:14:52,222 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 13 selfloop transitions, 2 changer transitions 0/157 dead transitions. [2024-11-07 15:14:52,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 157 transitions, 352 flow [2024-11-07 15:14:52,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:14:52,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:14:52,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 496 transitions. [2024-11-07 15:14:52,224 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8794326241134752 [2024-11-07 15:14:52,224 INFO L175 Difference]: Start difference. First operand has 160 places, 156 transitions, 320 flow. Second operand 3 states and 496 transitions. [2024-11-07 15:14:52,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 157 transitions, 352 flow [2024-11-07 15:14:52,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 157 transitions, 348 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:14:52,226 INFO L231 Difference]: Finished difference. Result has 159 places, 155 transitions, 318 flow [2024-11-07 15:14:52,227 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=318, PETRI_PLACES=159, PETRI_TRANSITIONS=155} [2024-11-07 15:14:52,227 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -25 predicate places. [2024-11-07 15:14:52,228 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 155 transitions, 318 flow [2024-11-07 15:14:52,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 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:14:52,228 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:14:52,228 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] [2024-11-07 15:14:52,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 15:14:52,228 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-07 15:14:52,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:14:52,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1089341189, now seen corresponding path program 1 times [2024-11-07 15:14:52,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:14:52,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222231491] [2024-11-07 15:14:52,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:14:52,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:14:52,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:14:52,286 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:14:52,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:14:52,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222231491] [2024-11-07 15:14:52,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222231491] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:14:52,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:14:52,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 15:14:52,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825126010] [2024-11-07 15:14:52,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:14:52,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:14:52,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:14:52,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:14:52,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:14:52,299 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 188 [2024-11-07 15:14:52,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 155 transitions, 318 flow. Second operand has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 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:14:52,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:14:52,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 188 [2024-11-07 15:14:52,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:14:52,367 INFO L124 PetriNetUnfolderBase]: 25/550 cut-off events. [2024-11-07 15:14:52,367 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 15:14:52,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 615 conditions, 550 events. 25/550 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2286 event pairs, 6 based on Foata normal form. 4/504 useless extension candidates. Maximal degree in co-relation 611. Up to 21 conditions per place. [2024-11-07 15:14:52,371 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 11 selfloop transitions, 2 changer transitions 0/158 dead transitions. [2024-11-07 15:14:52,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 158 transitions, 350 flow [2024-11-07 15:14:52,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:14:52,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:14:52,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 506 transitions. [2024-11-07 15:14:52,373 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8971631205673759 [2024-11-07 15:14:52,373 INFO L175 Difference]: Start difference. First operand has 159 places, 155 transitions, 318 flow. Second operand 3 states and 506 transitions. [2024-11-07 15:14:52,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 158 transitions, 350 flow [2024-11-07 15:14:52,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 158 transitions, 346 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:14:52,377 INFO L231 Difference]: Finished difference. Result has 160 places, 156 transitions, 326 flow [2024-11-07 15:14:52,377 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=326, PETRI_PLACES=160, PETRI_TRANSITIONS=156} [2024-11-07 15:14:52,380 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -24 predicate places. [2024-11-07 15:14:52,380 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 156 transitions, 326 flow [2024-11-07 15:14:52,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 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:14:52,381 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:14:52,381 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:14:52,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 15:14:52,381 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-07 15:14:52,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:14:52,382 INFO L85 PathProgramCache]: Analyzing trace with hash -800692820, now seen corresponding path program 1 times [2024-11-07 15:14:52,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:14:52,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193228925] [2024-11-07 15:14:52,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:14:52,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:14:52,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:14:52,437 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:14:52,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:14:52,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193228925] [2024-11-07 15:14:52,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193228925] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:14:52,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:14:52,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:14:52,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212701319] [2024-11-07 15:14:52,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:14:52,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:14:52,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:14:52,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:14:52,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:14:52,458 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 188 [2024-11-07 15:14:52,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 156 transitions, 326 flow. Second operand has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 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:14:52,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:14:52,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 188 [2024-11-07 15:14:52,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:14:52,528 INFO L124 PetriNetUnfolderBase]: 65/584 cut-off events. [2024-11-07 15:14:52,528 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-07 15:14:52,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 726 conditions, 584 events. 65/584 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2923 event pairs, 38 based on Foata normal form. 0/542 useless extension candidates. Maximal degree in co-relation 721. Up to 83 conditions per place. [2024-11-07 15:14:52,533 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 14 selfloop transitions, 2 changer transitions 0/157 dead transitions. [2024-11-07 15:14:52,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 157 transitions, 360 flow [2024-11-07 15:14:52,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:14:52,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:14:52,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 494 transitions. [2024-11-07 15:14:52,535 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.875886524822695 [2024-11-07 15:14:52,535 INFO L175 Difference]: Start difference. First operand has 160 places, 156 transitions, 326 flow. Second operand 3 states and 494 transitions. [2024-11-07 15:14:52,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 157 transitions, 360 flow [2024-11-07 15:14:52,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 157 transitions, 358 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 15:14:52,558 INFO L231 Difference]: Finished difference. Result has 160 places, 155 transitions, 326 flow [2024-11-07 15:14:52,558 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=326, PETRI_PLACES=160, PETRI_TRANSITIONS=155} [2024-11-07 15:14:52,558 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -24 predicate places. [2024-11-07 15:14:52,558 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 155 transitions, 326 flow [2024-11-07 15:14:52,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 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:14:52,559 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:14:52,559 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] [2024-11-07 15:14:52,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 15:14:52,561 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-07 15:14:52,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:14:52,562 INFO L85 PathProgramCache]: Analyzing trace with hash 809008106, now seen corresponding path program 1 times [2024-11-07 15:14:52,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:14:52,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189574494] [2024-11-07 15:14:52,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:14:52,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:14:52,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:14:52,607 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:14:52,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:14:52,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189574494] [2024-11-07 15:14:52,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189574494] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:14:52,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:14:52,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:14:52,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188397670] [2024-11-07 15:14:52,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:14:52,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:14:52,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:14:52,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:14:52,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:14:52,617 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 188 [2024-11-07 15:14:52,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 155 transitions, 326 flow. Second operand has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 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:14:52,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:14:52,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 188 [2024-11-07 15:14:52,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:14:52,684 INFO L124 PetriNetUnfolderBase]: 49/554 cut-off events. [2024-11-07 15:14:52,685 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 15:14:52,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 656 conditions, 554 events. 49/554 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2407 event pairs, 10 based on Foata normal form. 0/512 useless extension candidates. Maximal degree in co-relation 651. Up to 40 conditions per place. [2024-11-07 15:14:52,689 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 10 selfloop transitions, 2 changer transitions 0/157 dead transitions. [2024-11-07 15:14:52,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 157 transitions, 354 flow [2024-11-07 15:14:52,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:14:52,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:14:52,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 505 transitions. [2024-11-07 15:14:52,692 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8953900709219859 [2024-11-07 15:14:52,692 INFO L175 Difference]: Start difference. First operand has 160 places, 155 transitions, 326 flow. Second operand 3 states and 505 transitions. [2024-11-07 15:14:52,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 157 transitions, 354 flow [2024-11-07 15:14:52,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 157 transitions, 350 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:14:52,695 INFO L231 Difference]: Finished difference. Result has 160 places, 155 transitions, 330 flow [2024-11-07 15:14:52,696 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=330, PETRI_PLACES=160, PETRI_TRANSITIONS=155} [2024-11-07 15:14:52,697 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -24 predicate places. [2024-11-07 15:14:52,697 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 155 transitions, 330 flow [2024-11-07 15:14:52,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 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:14:52,697 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:14:52,698 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] [2024-11-07 15:14:52,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 15:14:52,698 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-07 15:14:52,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:14:52,698 INFO L85 PathProgramCache]: Analyzing trace with hash 654170415, now seen corresponding path program 1 times [2024-11-07 15:14:52,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:14:52,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246587614] [2024-11-07 15:14:52,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:14:52,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:14:52,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:14:52,751 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:14:52,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:14:52,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246587614] [2024-11-07 15:14:52,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246587614] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:14:52,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:14:52,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:14:52,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428814485] [2024-11-07 15:14:52,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:14:52,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:14:52,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:14:52,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:14:52,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:14:52,774 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 188 [2024-11-07 15:14:52,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 155 transitions, 330 flow. Second operand has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 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:14:52,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:14:52,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 188 [2024-11-07 15:14:52,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:14:52,848 INFO L124 PetriNetUnfolderBase]: 69/572 cut-off events. [2024-11-07 15:14:52,848 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-11-07 15:14:52,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 739 conditions, 572 events. 69/572 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2880 event pairs, 42 based on Foata normal form. 0/546 useless extension candidates. Maximal degree in co-relation 733. Up to 91 conditions per place. [2024-11-07 15:14:52,853 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 14 selfloop transitions, 2 changer transitions 0/156 dead transitions. [2024-11-07 15:14:52,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 156 transitions, 364 flow [2024-11-07 15:14:52,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:14:52,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:14:52,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 494 transitions. [2024-11-07 15:14:52,855 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.875886524822695 [2024-11-07 15:14:52,855 INFO L175 Difference]: Start difference. First operand has 160 places, 155 transitions, 330 flow. Second operand 3 states and 494 transitions. [2024-11-07 15:14:52,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 156 transitions, 364 flow [2024-11-07 15:14:52,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 156 transitions, 362 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 15:14:52,858 INFO L231 Difference]: Finished difference. Result has 160 places, 154 transitions, 330 flow [2024-11-07 15:14:52,859 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=330, PETRI_PLACES=160, PETRI_TRANSITIONS=154} [2024-11-07 15:14:52,859 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -24 predicate places. [2024-11-07 15:14:52,859 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 154 transitions, 330 flow [2024-11-07 15:14:52,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 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:14:52,860 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:14:52,860 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:14:52,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 15:14:52,860 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-07 15:14:52,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:14:52,861 INFO L85 PathProgramCache]: Analyzing trace with hash 308719358, now seen corresponding path program 1 times [2024-11-07 15:14:52,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:14:52,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832518053] [2024-11-07 15:14:52,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:14:52,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:14:52,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:14:52,902 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:14:52,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:14:52,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832518053] [2024-11-07 15:14:52,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832518053] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:14:52,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:14:52,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:14:52,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664607410] [2024-11-07 15:14:52,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:14:52,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:14:52,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:14:52,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:14:52,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:14:52,925 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 188 [2024-11-07 15:14:52,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 154 transitions, 330 flow. Second operand has 3 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 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:14:52,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:14:52,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 188 [2024-11-07 15:14:52,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:14:53,000 INFO L124 PetriNetUnfolderBase]: 57/556 cut-off events. [2024-11-07 15:14:53,001 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 15:14:53,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 711 conditions, 556 events. 57/556 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2543 event pairs, 38 based on Foata normal form. 0/532 useless extension candidates. Maximal degree in co-relation 705. Up to 83 conditions per place. [2024-11-07 15:14:53,005 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 15 selfloop transitions, 2 changer transitions 0/155 dead transitions. [2024-11-07 15:14:53,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 155 transitions, 366 flow [2024-11-07 15:14:53,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:14:53,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:14:53,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 492 transitions. [2024-11-07 15:14:53,007 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8723404255319149 [2024-11-07 15:14:53,007 INFO L175 Difference]: Start difference. First operand has 160 places, 154 transitions, 330 flow. Second operand 3 states and 492 transitions. [2024-11-07 15:14:53,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 155 transitions, 366 flow [2024-11-07 15:14:53,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 155 transitions, 362 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:14:53,010 INFO L231 Difference]: Finished difference. Result has 159 places, 153 transitions, 328 flow [2024-11-07 15:14:53,010 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=328, PETRI_PLACES=159, PETRI_TRANSITIONS=153} [2024-11-07 15:14:53,011 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -25 predicate places. [2024-11-07 15:14:53,011 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 153 transitions, 328 flow [2024-11-07 15:14:53,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 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:14:53,012 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:14:53,012 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:53,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 15:14:53,012 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-07 15:14:53,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:14:53,013 INFO L85 PathProgramCache]: Analyzing trace with hash 2042320711, now seen corresponding path program 1 times [2024-11-07 15:14:53,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:14:53,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783292651] [2024-11-07 15:14:53,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:14:53,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:14:53,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:14:53,132 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:14:53,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:14:53,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783292651] [2024-11-07 15:14:53,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783292651] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 15:14:53,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119933389] [2024-11-07 15:14:53,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:14:53,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 15:14:53,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 15:14:53,135 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 15:14:53,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 15:14:53,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:14:53,219 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 15:14:53,223 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 15:14:53,241 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-07 15:14:53,241 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 15:14:53,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [119933389] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:14:53,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 15:14:53,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-07 15:14:53,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688801742] [2024-11-07 15:14:53,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:14:53,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:14:53,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:14:53,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:14:53,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 15:14:53,245 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 188 [2024-11-07 15:14:53,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 153 transitions, 328 flow. Second operand has 3 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 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:14:53,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:14:53,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 188 [2024-11-07 15:14:53,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:14:53,299 INFO L124 PetriNetUnfolderBase]: 36/485 cut-off events. [2024-11-07 15:14:53,299 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 15:14:53,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 569 conditions, 485 events. 36/485 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1794 event pairs, 1 based on Foata normal form. 0/456 useless extension candidates. Maximal degree in co-relation 563. Up to 31 conditions per place. [2024-11-07 15:14:53,304 INFO L140 encePairwiseOnDemand]: 183/188 looper letters, 9 selfloop transitions, 4 changer transitions 0/157 dead transitions. [2024-11-07 15:14:53,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 157 transitions, 362 flow [2024-11-07 15:14:53,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:14:53,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:14:53,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 509 transitions. [2024-11-07 15:14:53,306 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9024822695035462 [2024-11-07 15:14:53,306 INFO L175 Difference]: Start difference. First operand has 159 places, 153 transitions, 328 flow. Second operand 3 states and 509 transitions. [2024-11-07 15:14:53,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 157 transitions, 362 flow [2024-11-07 15:14:53,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 157 transitions, 358 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:14:53,309 INFO L231 Difference]: Finished difference. Result has 161 places, 157 transitions, 358 flow [2024-11-07 15:14:53,309 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=358, PETRI_PLACES=161, PETRI_TRANSITIONS=157} [2024-11-07 15:14:53,309 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -23 predicate places. [2024-11-07 15:14:53,309 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 157 transitions, 358 flow [2024-11-07 15:14:53,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 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:14:53,310 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:14:53,310 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:53,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 15:14:53,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-07 15:14:53,515 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-07 15:14:53,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:14:53,515 INFO L85 PathProgramCache]: Analyzing trace with hash -222269459, now seen corresponding path program 1 times [2024-11-07 15:14:53,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:14:53,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269835799] [2024-11-07 15:14:53,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:14:53,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:14:53,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:14:53,618 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:14:53,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:14:53,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269835799] [2024-11-07 15:14:53,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269835799] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 15:14:53,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356285894] [2024-11-07 15:14:53,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:14:53,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 15:14:53,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 15:14:53,621 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 15:14:53,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 15:14:53,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:14:53,727 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 15:14:53,730 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 15:14:53,764 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-07 15:14:53,764 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 15:14:53,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [356285894] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:14:53,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 15:14:53,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-07 15:14:53,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704197329] [2024-11-07 15:14:53,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:14:53,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:14:53,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:14:53,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:14:53,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 15:14:53,771 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 188 [2024-11-07 15:14:53,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 157 transitions, 358 flow. Second operand has 3 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 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:14:53,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:14:53,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 188 [2024-11-07 15:14:53,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:14:53,872 INFO L124 PetriNetUnfolderBase]: 78/601 cut-off events. [2024-11-07 15:14:53,873 INFO L125 PetriNetUnfolderBase]: For 138/151 co-relation queries the response was YES. [2024-11-07 15:14:53,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 872 conditions, 601 events. 78/601 cut-off events. For 138/151 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2732 event pairs, 0 based on Foata normal form. 8/564 useless extension candidates. Maximal degree in co-relation 865. Up to 59 conditions per place. [2024-11-07 15:14:53,880 INFO L140 encePairwiseOnDemand]: 183/188 looper letters, 12 selfloop transitions, 6 changer transitions 0/164 dead transitions. [2024-11-07 15:14:53,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 164 transitions, 422 flow [2024-11-07 15:14:53,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:14:53,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:14:53,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 510 transitions. [2024-11-07 15:14:53,882 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9042553191489362 [2024-11-07 15:14:53,882 INFO L175 Difference]: Start difference. First operand has 161 places, 157 transitions, 358 flow. Second operand 3 states and 510 transitions. [2024-11-07 15:14:53,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 164 transitions, 422 flow [2024-11-07 15:14:53,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 164 transitions, 410 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:14:53,887 INFO L231 Difference]: Finished difference. Result has 163 places, 163 transitions, 408 flow [2024-11-07 15:14:53,887 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=408, PETRI_PLACES=163, PETRI_TRANSITIONS=163} [2024-11-07 15:14:53,888 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -21 predicate places. [2024-11-07 15:14:53,888 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 163 transitions, 408 flow [2024-11-07 15:14:53,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 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:14:53,888 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:14:53,888 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:53,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-07 15:14:54,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 15:14:54,093 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-07 15:14:54,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:14:54,093 INFO L85 PathProgramCache]: Analyzing trace with hash -237909861, now seen corresponding path program 1 times [2024-11-07 15:14:54,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:14:54,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189000663] [2024-11-07 15:14:54,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:14:54,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:14:54,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:14:54,195 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:14:54,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:14:54,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189000663] [2024-11-07 15:14:54,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189000663] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 15:14:54,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889323025] [2024-11-07 15:14:54,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:14:54,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 15:14:54,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 15:14:54,198 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 15:14:54,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-07 15:14:54,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:14:54,291 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 15:14:54,294 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 15:14:54,397 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:14:54,397 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 15:14:54,477 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:14:54,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889323025] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 15:14:54,480 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 15:14:54,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-07 15:14:54,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916241532] [2024-11-07 15:14:54,481 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 15:14:54,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 15:14:54,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:14:54,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 15:14:54,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-07 15:14:54,504 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 188 [2024-11-07 15:14:54,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 163 transitions, 408 flow. Second operand has 10 states, 10 states have (on average 161.4) internal successors, (1614), 10 states have internal predecessors, (1614), 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:14:54,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:14:54,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 188 [2024-11-07 15:14:54,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:14:54,777 INFO L124 PetriNetUnfolderBase]: 242/1310 cut-off events. [2024-11-07 15:14:54,778 INFO L125 PetriNetUnfolderBase]: For 1036/1068 co-relation queries the response was YES. [2024-11-07 15:14:54,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2354 conditions, 1310 events. 242/1310 cut-off events. For 1036/1068 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 6597 event pairs, 13 based on Foata normal form. 16/1267 useless extension candidates. Maximal degree in co-relation 2346. Up to 138 conditions per place. [2024-11-07 15:14:54,792 INFO L140 encePairwiseOnDemand]: 182/188 looper letters, 63 selfloop transitions, 9 changer transitions 0/213 dead transitions. [2024-11-07 15:14:54,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 213 transitions, 864 flow [2024-11-07 15:14:54,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 15:14:54,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-07 15:14:54,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1471 transitions. [2024-11-07 15:14:54,796 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8693853427895981 [2024-11-07 15:14:54,796 INFO L175 Difference]: Start difference. First operand has 163 places, 163 transitions, 408 flow. Second operand 9 states and 1471 transitions. [2024-11-07 15:14:54,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 213 transitions, 864 flow [2024-11-07 15:14:54,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 213 transitions, 810 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:14:54,801 INFO L231 Difference]: Finished difference. Result has 172 places, 169 transitions, 446 flow [2024-11-07 15:14:54,801 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=446, PETRI_PLACES=172, PETRI_TRANSITIONS=169} [2024-11-07 15:14:54,801 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -12 predicate places. [2024-11-07 15:14:54,801 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 169 transitions, 446 flow [2024-11-07 15:14:54,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 161.4) internal successors, (1614), 10 states have internal predecessors, (1614), 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:14:54,802 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:14:54,803 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:54,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-07 15:14:55,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 15:14:55,007 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-07 15:14:55,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:14:55,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1218412197, now seen corresponding path program 2 times [2024-11-07 15:14:55,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:14:55,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312847219] [2024-11-07 15:14:55,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:14:55,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:14:55,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:14:55,239 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:14:55,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:14:55,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312847219] [2024-11-07 15:14:55,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312847219] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 15:14:55,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492616945] [2024-11-07 15:14:55,240 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 15:14:55,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 15:14:55,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 15:14:55,243 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 15:14:55,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-07 15:14:55,343 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 15:14:55,343 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 15:14:55,345 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 15:14:55,348 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 15:14:55,549 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:14:55,549 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 15:14:55,774 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:14:55,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492616945] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 15:14:55,776 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 15:14:55,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2024-11-07 15:14:55,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779606207] [2024-11-07 15:14:55,776 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 15:14:55,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-07 15:14:55,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:14:55,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-07 15:14:55,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-11-07 15:14:55,794 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 188 [2024-11-07 15:14:55,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 169 transitions, 446 flow. Second operand has 18 states, 18 states have (on average 161.22222222222223) internal successors, (2902), 18 states have internal predecessors, (2902), 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:14:55,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:14:55,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 188 [2024-11-07 15:14:55,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:14:56,348 INFO L124 PetriNetUnfolderBase]: 402/2170 cut-off events. [2024-11-07 15:14:56,349 INFO L125 PetriNetUnfolderBase]: For 1539/1571 co-relation queries the response was YES. [2024-11-07 15:14:56,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3921 conditions, 2170 events. 402/2170 cut-off events. For 1539/1571 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 10604 event pairs, 13 based on Foata normal form. 26/2135 useless extension candidates. Maximal degree in co-relation 3911. Up to 218 conditions per place. [2024-11-07 15:14:56,371 INFO L140 encePairwiseOnDemand]: 182/188 looper letters, 139 selfloop transitions, 21 changer transitions 0/301 dead transitions. [2024-11-07 15:14:56,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 301 transitions, 1546 flow [2024-11-07 15:14:56,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-07 15:14:56,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2024-11-07 15:14:56,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3421 transitions. [2024-11-07 15:14:56,428 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8665146909827761 [2024-11-07 15:14:56,428 INFO L175 Difference]: Start difference. First operand has 172 places, 169 transitions, 446 flow. Second operand 21 states and 3421 transitions. [2024-11-07 15:14:56,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 301 transitions, 1546 flow [2024-11-07 15:14:56,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 301 transitions, 1532 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-11-07 15:14:56,434 INFO L231 Difference]: Finished difference. Result has 196 places, 182 transitions, 570 flow [2024-11-07 15:14:56,434 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=570, PETRI_PLACES=196, PETRI_TRANSITIONS=182} [2024-11-07 15:14:56,434 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, 12 predicate places. [2024-11-07 15:14:56,434 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 182 transitions, 570 flow [2024-11-07 15:14:56,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 161.22222222222223) internal successors, (2902), 18 states have internal predecessors, (2902), 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:14:56,435 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:14:56,436 INFO L204 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:56,452 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-07 15:14:56,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-07 15:14:56,636 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-07 15:14:56,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:14:56,637 INFO L85 PathProgramCache]: Analyzing trace with hash 557794011, now seen corresponding path program 3 times [2024-11-07 15:14:56,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:14:56,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307310648] [2024-11-07 15:14:56,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:14:56,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:14:56,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:14:57,202 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:14:57,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:14:57,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307310648] [2024-11-07 15:14:57,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307310648] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 15:14:57,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [397116384] [2024-11-07 15:14:57,202 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-07 15:14:57,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 15:14:57,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 15:14:57,204 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 15:14:57,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-07 15:14:57,354 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2024-11-07 15:14:57,355 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 15:14:57,357 INFO L255 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-07 15:14:57,365 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 15:14:57,704 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:14:57,704 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 15:14:58,244 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:14:58,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [397116384] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 15:14:58,245 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 15:14:58,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 27 [2024-11-07 15:14:58,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098383685] [2024-11-07 15:14:58,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 15:14:58,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-07 15:14:58,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:14:58,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-07 15:14:58,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2024-11-07 15:14:58,264 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 188 [2024-11-07 15:14:58,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 182 transitions, 570 flow. Second operand has 27 states, 27 states have (on average 161.22222222222223) internal successors, (4353), 27 states have internal predecessors, (4353), 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:14:58,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:14:58,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 188 [2024-11-07 15:14:58,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:14:59,493 INFO L124 PetriNetUnfolderBase]: 602/3245 cut-off events. [2024-11-07 15:14:59,493 INFO L125 PetriNetUnfolderBase]: For 3542/3574 co-relation queries the response was YES. [2024-11-07 15:14:59,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6197 conditions, 3245 events. 602/3245 cut-off events. For 3542/3574 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 15648 event pairs, 13 based on Foata normal form. 31/3215 useless extension candidates. Maximal degree in co-relation 6182. Up to 318 conditions per place. [2024-11-07 15:14:59,525 INFO L140 encePairwiseOnDemand]: 182/188 looper letters, 234 selfloop transitions, 36 changer transitions 0/411 dead transitions. [2024-11-07 15:14:59,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 411 transitions, 2526 flow [2024-11-07 15:14:59,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-07 15:14:59,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2024-11-07 15:14:59,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 5857 transitions. [2024-11-07 15:14:59,539 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8653959810874704 [2024-11-07 15:14:59,539 INFO L175 Difference]: Start difference. First operand has 196 places, 182 transitions, 570 flow. Second operand 36 states and 5857 transitions. [2024-11-07 15:14:59,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 411 transitions, 2526 flow [2024-11-07 15:14:59,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 411 transitions, 2492 flow, removed 11 selfloop flow, removed 6 redundant places. [2024-11-07 15:14:59,553 INFO L231 Difference]: Finished difference. Result has 231 places, 198 transitions, 758 flow [2024-11-07 15:14:59,553 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=758, PETRI_PLACES=231, PETRI_TRANSITIONS=198} [2024-11-07 15:14:59,554 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, 47 predicate places. [2024-11-07 15:14:59,554 INFO L471 AbstractCegarLoop]: Abstraction has has 231 places, 198 transitions, 758 flow [2024-11-07 15:14:59,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 161.22222222222223) internal successors, (4353), 27 states have internal predecessors, (4353), 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:14:59,557 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:14:59,558 INFO L204 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:59,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-07 15:14:59,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-07 15:14:59,763 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-07 15:14:59,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:14:59,764 INFO L85 PathProgramCache]: Analyzing trace with hash -637596111, now seen corresponding path program 4 times [2024-11-07 15:14:59,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:14:59,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210569134] [2024-11-07 15:14:59,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:14:59,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:14:59,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 15:14:59,839 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 15:14:59,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 15:15:00,145 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 15:15:00,147 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 15:15:00,148 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (45 of 46 remaining) [2024-11-07 15:15:00,149 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (44 of 46 remaining) [2024-11-07 15:15:00,149 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (43 of 46 remaining) [2024-11-07 15:15:00,149 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (42 of 46 remaining) [2024-11-07 15:15:00,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (41 of 46 remaining) [2024-11-07 15:15:00,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (40 of 46 remaining) [2024-11-07 15:15:00,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (39 of 46 remaining) [2024-11-07 15:15:00,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (38 of 46 remaining) [2024-11-07 15:15:00,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (37 of 46 remaining) [2024-11-07 15:15:00,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (36 of 46 remaining) [2024-11-07 15:15:00,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (35 of 46 remaining) [2024-11-07 15:15:00,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (34 of 46 remaining) [2024-11-07 15:15:00,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (33 of 46 remaining) [2024-11-07 15:15:00,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (32 of 46 remaining) [2024-11-07 15:15:00,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (31 of 46 remaining) [2024-11-07 15:15:00,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (30 of 46 remaining) [2024-11-07 15:15:00,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 46 remaining) [2024-11-07 15:15:00,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 46 remaining) [2024-11-07 15:15:00,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONDATA_RACE (27 of 46 remaining) [2024-11-07 15:15:00,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1ASSERT_VIOLATIONDATA_RACE (26 of 46 remaining) [2024-11-07 15:15:00,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2ASSERT_VIOLATIONDATA_RACE (25 of 46 remaining) [2024-11-07 15:15:00,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err3ASSERT_VIOLATIONDATA_RACE (24 of 46 remaining) [2024-11-07 15:15:00,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err4ASSERT_VIOLATIONDATA_RACE (23 of 46 remaining) [2024-11-07 15:15:00,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err5ASSERT_VIOLATIONDATA_RACE (22 of 46 remaining) [2024-11-07 15:15:00,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err6ASSERT_VIOLATIONDATA_RACE (21 of 46 remaining) [2024-11-07 15:15:00,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONDATA_RACE (20 of 46 remaining) [2024-11-07 15:15:00,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1ASSERT_VIOLATIONDATA_RACE (19 of 46 remaining) [2024-11-07 15:15:00,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2ASSERT_VIOLATIONDATA_RACE (18 of 46 remaining) [2024-11-07 15:15:00,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err3ASSERT_VIOLATIONDATA_RACE (17 of 46 remaining) [2024-11-07 15:15:00,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err4ASSERT_VIOLATIONDATA_RACE (16 of 46 remaining) [2024-11-07 15:15:00,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err5ASSERT_VIOLATIONDATA_RACE (15 of 46 remaining) [2024-11-07 15:15:00,152 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err6ASSERT_VIOLATIONDATA_RACE (14 of 46 remaining) [2024-11-07 15:15:00,152 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONDATA_RACE (13 of 46 remaining) [2024-11-07 15:15:00,152 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1ASSERT_VIOLATIONDATA_RACE (12 of 46 remaining) [2024-11-07 15:15:00,152 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2ASSERT_VIOLATIONDATA_RACE (11 of 46 remaining) [2024-11-07 15:15:00,152 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err3ASSERT_VIOLATIONDATA_RACE (10 of 46 remaining) [2024-11-07 15:15:00,152 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err4ASSERT_VIOLATIONDATA_RACE (9 of 46 remaining) [2024-11-07 15:15:00,152 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err5ASSERT_VIOLATIONDATA_RACE (8 of 46 remaining) [2024-11-07 15:15:00,152 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err6ASSERT_VIOLATIONDATA_RACE (7 of 46 remaining) [2024-11-07 15:15:00,153 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONDATA_RACE (6 of 46 remaining) [2024-11-07 15:15:00,153 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1ASSERT_VIOLATIONDATA_RACE (5 of 46 remaining) [2024-11-07 15:15:00,153 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2ASSERT_VIOLATIONDATA_RACE (4 of 46 remaining) [2024-11-07 15:15:00,153 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err3ASSERT_VIOLATIONDATA_RACE (3 of 46 remaining) [2024-11-07 15:15:00,153 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err4ASSERT_VIOLATIONDATA_RACE (2 of 46 remaining) [2024-11-07 15:15:00,153 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err5ASSERT_VIOLATIONDATA_RACE (1 of 46 remaining) [2024-11-07 15:15:00,153 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err6ASSERT_VIOLATIONDATA_RACE (0 of 46 remaining) [2024-11-07 15:15:00,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-07 15:15:00,154 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:15:00,384 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-07 15:15:00,384 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 15:15:00,391 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 03:15:00 BasicIcfg [2024-11-07 15:15:00,391 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 15:15:00,392 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 15:15:00,392 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 15:15:00,392 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 15:15:00,393 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:14:49" (3/4) ... [2024-11-07 15:15:00,394 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-07 15:15:00,577 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 15:15:00,577 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 15:15:00,579 INFO L158 Benchmark]: Toolchain (without parser) took 11578.42ms. Allocated memory was 117.4MB in the beginning and 369.1MB in the end (delta: 251.7MB). Free memory was 90.5MB in the beginning and 213.6MB in the end (delta: -123.1MB). Peak memory consumption was 263.8MB. Max. memory is 16.1GB. [2024-11-07 15:15:00,579 INFO L158 Benchmark]: CDTParser took 0.97ms. Allocated memory is still 117.4MB. Free memory is still 81.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 15:15:00,580 INFO L158 Benchmark]: CACSL2BoogieTranslator took 396.15ms. Allocated memory is still 117.4MB. Free memory was 90.3MB in the beginning and 70.9MB in the end (delta: 19.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 15:15:00,580 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.43ms. Allocated memory is still 117.4MB. Free memory was 70.9MB in the beginning and 69.1MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 15:15:00,580 INFO L158 Benchmark]: Boogie Preprocessor took 39.02ms. Allocated memory is still 117.4MB. Free memory was 69.1MB in the beginning and 68.0MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 15:15:00,580 INFO L158 Benchmark]: RCFGBuilder took 510.74ms. Allocated memory is still 117.4MB. Free memory was 67.8MB in the beginning and 46.7MB in the end (delta: 21.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 15:15:00,581 INFO L158 Benchmark]: TraceAbstraction took 10392.28ms. Allocated memory was 117.4MB in the beginning and 369.1MB in the end (delta: 251.7MB). Free memory was 46.2MB in the beginning and 98.5MB in the end (delta: -52.4MB). Peak memory consumption was 206.5MB. Max. memory is 16.1GB. [2024-11-07 15:15:00,581 INFO L158 Benchmark]: Witness Printer took 185.15ms. Allocated memory is still 369.1MB. Free memory was 98.5MB in the beginning and 213.6MB in the end (delta: -115.1MB). Peak memory consumption was 23.7MB. Max. memory is 16.1GB. [2024-11-07 15:15:00,582 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.97ms. Allocated memory is still 117.4MB. Free memory is still 81.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 396.15ms. Allocated memory is still 117.4MB. Free memory was 90.3MB in the beginning and 70.9MB in the end (delta: 19.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.43ms. Allocated memory is still 117.4MB. Free memory was 70.9MB in the beginning and 69.1MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.02ms. Allocated memory is still 117.4MB. Free memory was 69.1MB in the beginning and 68.0MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 510.74ms. Allocated memory is still 117.4MB. Free memory was 67.8MB in the beginning and 46.7MB in the end (delta: 21.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 10392.28ms. Allocated memory was 117.4MB in the beginning and 369.1MB in the end (delta: 251.7MB). Free memory was 46.2MB in the beginning and 98.5MB in the end (delta: -52.4MB). Peak memory consumption was 206.5MB. Max. memory is 16.1GB. * Witness Printer took 185.15ms. Allocated memory is still 369.1MB. Free memory was 98.5MB in the beginning and 213.6MB in the end (delta: -115.1MB). Peak memory consumption was 23.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 725]: Data race detected Data race detected The following path leads to a data race: [L683] 0 int i, j; VAL [i=0, j=0] [L686] 0 int p, q; VAL [i=0, j=0, p=0, q=0] [L703] 0 int cur = 1, prev = 0, next = 0; VAL [cur=1, i=0, j=0, next=0, p=0, prev=0, q=0] [L704] 0 int x; VAL [cur=1, i=0, j=0, next=0, p=0, prev=0, q=0, x=0] [L714] 0 pthread_t id1, id2; VAL [\old(argc)=270, \old(argv)={269:235}, argc=270, cur=1, i=0, j=0, next=0, p=0, prev=0, q=0, x=0] [L716] 0 i = 1 VAL [\old(argc)=270, \old(argv)={269:235}, argc=270, cur=1, i=1, j=0, next=0, p=0, prev=0, q=0, x=0] [L719] 0 j = 1 VAL [\old(argc)=270, \old(argv)={269:235}, argc=270, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L721] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [\old(arg)={0:0}, \old(argc)=270, \old(argv)={269:235}, argc=270, cur=1, i=1, id1=-1, j=1, next=0, p=0, prev=0, q=0, x=0] [L722] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=270, \old(argv)={269:235}, argc=270, cur=1, i=1, id1=-1, id2=0, j=1, next=0, p=0, prev=0, q=0, x=0] [L723] CALL, EXPR 0 fib() [L706] 0 x = 0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L706] 0 x < 12 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L706] COND TRUE 0 x < 12 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=0, q=0, x=0] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=1, q=0, x=0] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=1, q=0, x=0] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=1, q=0, x=1] [L706] 0 x < 12 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=1, q=0, x=1] [L706] COND TRUE 0 x < 12 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=1, q=0, x=1] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=1, q=0, x=1] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1, i=1, j=1, next=2, p=0, prev=1, q=0, x=1] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1, i=1, j=1, next=2, p=0, prev=1, q=0, x=1] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=2, i=1, j=1, next=2, p=0, prev=1, q=0, x=1] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=2, i=1, j=1, next=2, p=0, prev=1, q=0, x=2] [L706] 0 x < 12 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=2, i=1, j=1, next=2, p=0, prev=1, q=0, x=2] [L706] COND TRUE 0 x < 12 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=2, i=1, j=1, next=2, p=0, prev=1, q=0, x=2] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=2, i=1, j=1, next=2, p=0, prev=1, q=0, x=2] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=2, i=1, j=1, next=3, p=0, prev=1, q=0, x=2] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=2, i=1, j=1, next=3, p=0, prev=2, q=0, x=2] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=3, i=1, j=1, next=3, p=0, prev=2, q=0, x=2] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=3, i=1, j=1, next=3, p=0, prev=2, q=0, x=3] [L706] 0 x < 12 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=3, i=1, j=1, next=3, p=0, prev=2, q=0, x=3] [L706] COND TRUE 0 x < 12 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=3, i=1, j=1, next=3, p=0, prev=2, q=0, x=3] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=3, i=1, j=1, next=3, p=0, prev=2, q=0, x=3] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=3, i=1, j=1, next=5, p=0, prev=2, q=0, x=3] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=3, i=1, j=1, next=5, p=0, prev=3, q=0, x=3] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=5, i=1, j=1, next=5, p=0, prev=3, q=0, x=3] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=5, i=1, j=1, next=5, p=0, prev=3, q=0, x=4] [L706] 0 x < 12 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=5, i=1, j=1, next=5, p=0, prev=3, q=0, x=4] [L706] COND TRUE 0 x < 12 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=5, i=1, j=1, next=5, p=0, prev=3, q=0, x=4] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=5, i=1, j=1, next=5, p=0, prev=3, q=0, x=4] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=5, i=1, j=1, next=8, p=0, prev=3, q=0, x=4] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=5, i=1, j=1, next=8, p=0, prev=5, q=0, x=4] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=8, i=1, j=1, next=8, p=0, prev=5, q=0, x=4] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=8, i=1, j=1, next=8, p=0, prev=5, q=0, x=5] [L706] 0 x < 12 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=8, i=1, j=1, next=8, p=0, prev=5, q=0, x=5] [L706] COND TRUE 0 x < 12 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=8, i=1, j=1, next=8, p=0, prev=5, q=0, x=5] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=8, i=1, j=1, next=8, p=0, prev=5, q=0, x=5] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=8, i=1, j=1, next=13, p=0, prev=5, q=0, x=5] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=8, i=1, j=1, next=13, p=0, prev=8, q=0, x=5] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=13, i=1, j=1, next=13, p=0, prev=8, q=0, x=5] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=13, i=1, j=1, next=13, p=0, prev=8, q=0, x=6] [L706] 0 x < 12 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=13, i=1, j=1, next=13, p=0, prev=8, q=0, x=6] [L706] COND TRUE 0 x < 12 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=13, i=1, j=1, next=13, p=0, prev=8, q=0, x=6] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=13, i=1, j=1, next=13, p=0, prev=8, q=0, x=6] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=13, i=1, j=1, next=21, p=0, prev=8, q=0, x=6] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=13, i=1, j=1, next=21, p=0, prev=13, q=0, x=6] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=21, i=1, j=1, next=21, p=0, prev=13, q=0, x=6] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=21, i=1, j=1, next=21, p=0, prev=13, q=0, x=7] [L706] 0 x < 12 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=21, i=1, j=1, next=21, p=0, prev=13, q=0, x=7] [L706] COND TRUE 0 x < 12 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=21, i=1, j=1, next=21, p=0, prev=13, q=0, x=7] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=21, i=1, j=1, next=21, p=0, prev=13, q=0, x=7] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=21, i=1, j=1, next=34, p=0, prev=13, q=0, x=7] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=21, i=1, j=1, next=34, p=0, prev=21, q=0, x=7] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=34, i=1, j=1, next=34, p=0, prev=21, q=0, x=7] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=34, i=1, j=1, next=34, p=0, prev=21, q=0, x=8] [L706] 0 x < 12 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=34, i=1, j=1, next=34, p=0, prev=21, q=0, x=8] [L706] COND TRUE 0 x < 12 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=34, i=1, j=1, next=34, p=0, prev=21, q=0, x=8] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=34, i=1, j=1, next=34, p=0, prev=21, q=0, x=8] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=34, i=1, j=1, next=55, p=0, prev=21, q=0, x=8] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=34, i=1, j=1, next=55, p=0, prev=34, q=0, x=8] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=55, i=1, j=1, next=55, p=0, prev=34, q=0, x=8] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=55, i=1, j=1, next=55, p=0, prev=34, q=0, x=9] [L706] 0 x < 12 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=55, i=1, j=1, next=55, p=0, prev=34, q=0, x=9] [L706] COND TRUE 0 x < 12 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=55, i=1, j=1, next=55, p=0, prev=34, q=0, x=9] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=55, i=1, j=1, next=55, p=0, prev=34, q=0, x=9] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=55, i=1, j=1, next=89, p=0, prev=34, q=0, x=9] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=55, i=1, j=1, next=89, p=0, prev=55, q=0, x=9] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=89, i=1, j=1, next=89, p=0, prev=55, q=0, x=9] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=89, i=1, j=1, next=89, p=0, prev=55, q=0, x=10] [L706] 0 x < 12 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=89, i=1, j=1, next=89, p=0, prev=55, q=0, x=10] [L706] COND TRUE 0 x < 12 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=89, i=1, j=1, next=89, p=0, prev=55, q=0, x=10] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=89, i=1, j=1, next=89, p=0, prev=55, q=0, x=10] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=89, i=1, j=1, next=144, p=0, prev=55, q=0, x=10] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=89, i=1, j=1, next=144, p=0, prev=89, q=0, x=10] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=144, i=1, j=1, next=144, p=0, prev=89, q=0, x=10] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=144, i=1, j=1, next=144, p=0, prev=89, q=0, x=11] [L706] 0 x < 12 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=144, i=1, j=1, next=144, p=0, prev=89, q=0, x=11] [L706] COND TRUE 0 x < 12 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=144, i=1, j=1, next=144, p=0, prev=89, q=0, x=11] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=144, i=1, j=1, next=144, p=0, prev=89, q=0, x=11] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=144, i=1, j=1, next=233, p=0, prev=89, q=0, x=11] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=144, i=1, j=1, next=233, p=0, prev=144, q=0, x=11] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=233, i=1, j=1, next=233, p=0, prev=144, q=0, x=11] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=233, i=1, j=1, next=233, p=0, prev=144, q=0, x=12] [L706] 0 x < 12 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=233, i=1, j=1, next=233, p=0, prev=144, q=0, x=12] [L706] COND FALSE 0 !(x < 12) VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=233, i=1, j=1, next=233, p=0, prev=144, q=0, x=12] [L711] 0 return prev; VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result=144, cur=233, i=1, j=1, next=233, p=0, prev=144, q=0, x=12] [L723] RET, EXPR 0 fib() [L723] 0 int correct = fib(); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=270, \old(argv)={269:235}, argc=270, correct=144, cur=233, i=1, id1=-1, id2=0, j=1, next=233, p=0, prev=144, q=0, x=12] [L725] 0 i < correct VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=270, \old(argv)={269:235}, argc=270, correct=144, cur=233, i=1, id1=-1, id2=0, j=1, next=233, p=0, prev=144, q=0, x=12] [L688] 1 p = 0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=233, i=1, j=1, next=233, p=0, prev=144, q=0, x=12] [L688] 1 p < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=233, i=1, j=1, next=233, p=0, prev=144, q=0, x=12] [L688] COND TRUE 1 p < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=233, i=1, j=1, next=233, p=0, prev=144, q=0, x=12] [L690] 1 i += j VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=233, i=2, j=1, next=233, p=0, prev=144, q=0, x=12] [L725] 0 i < correct VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=270, \old(argv)={269:235}, arg={0:0}, argc=270, correct=144, cur=233, i=2, id1=-1, id2=0, j=1, next=233, p=0, prev=144, q=0, x=12] Now there is a data race on ~i~0 between C: i += j [690] and C: i < correct [725] - UnprovableResult [Line: 716]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 719]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 711]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 725]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 722]: 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: 721]: 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: 688]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 696]: 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 5 procedures, 240 locations, 46 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: 10.0s, OverallIterations: 23, TraceHistogramMax: 13, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 799 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 585 mSDsluCounter, 170 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 81 mSDsCounter, 58 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 844 IncrementalHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 58 mSolverCounterUnsat, 89 mSDtfsCounter, 844 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1449 GetRequests, 1331 SyntacticMatches, 7 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 798 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=758occurred in iteration=22, InterpolantAutomatonStates: 122, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 2829 NumberOfCodeBlocks, 2829 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 2894 ConstructedInterpolants, 0 QuantifiedInterpolants, 5546 SizeOfPredicates, 22 NumberOfNonLiveVariables, 1434 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 30 InterpolantComputations, 19 PerfectInterpolantSequences, 6/2631 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:15:00,611 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