./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-lit/fkp2013-1.i --full-output --witness-type violation_witness --validate ../results-verified/LOGDIR/SV-COMP24_no-data-race/fkp2013-1.yml/witness.graphml --architecture 32bit


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


Checking for data races
Using default analysis
Version 194c01fd
Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../sv-benchmarks/c/pthread-lit/fkp2013-1.i ../results-verified/LOGDIR/SV-COMP24_no-data-race/fkp2013-1.yml/witness.graphml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.positions.where.we.compute.the.hoare.annotation None
--- Real Ultimate output ---
This is Ultimate 0.2.5-dev-194c01f-m
[2024-10-29 15:21:10,640 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-10-29 15:21:10,723 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2024-10-29 15:21:10,731 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-10-29 15:21:10,731 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-10-29 15:21:10,760 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-10-29 15:21:10,761 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-10-29 15:21:10,761 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-10-29 15:21:10,762 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-10-29 15:21:10,762 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-10-29 15:21:10,763 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-10-29 15:21:10,763 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-10-29 15:21:10,763 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-10-29 15:21:10,764 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-10-29 15:21:10,764 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-10-29 15:21:10,765 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-10-29 15:21:10,765 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-10-29 15:21:10,765 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-10-29 15:21:10,766 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-10-29 15:21:10,766 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-10-29 15:21:10,766 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-10-29 15:21:10,767 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-10-29 15:21:10,767 INFO  L153        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2024-10-29 15:21:10,768 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-10-29 15:21:10,771 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2024-10-29 15:21:10,771 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-10-29 15:21:10,771 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-10-29 15:21:10,772 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-10-29 15:21:10,772 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-10-29 15:21:10,772 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-10-29 15:21:10,773 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-10-29 15:21:10,773 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-10-29 15:21:10,773 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-10-29 15:21:10,774 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-10-29 15:21:10,774 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-10-29 15:21:10,782 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-10-29 15:21:10,782 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-10-29 15:21:10,783 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-10-29 15:21:10,783 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-10-29 15:21:10,783 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-10-29 15:21:10,783 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-10-29 15:21:10,784 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> None
[2024-10-29 15:21:11,066 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-10-29 15:21:11,090 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-10-29 15:21:11,094 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-10-29 15:21:11,097 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-10-29 15:21:11,097 INFO  L274        PluginConnector]: CDTParser initialized
[2024-10-29 15:21:11,099 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-lit/fkp2013-1.i
[2024-10-29 15:21:12,503 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-10-29 15:21:12,757 INFO  L384              CDTParser]: Found 1 translation units.
[2024-10-29 15:21:12,757 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-lit/fkp2013-1.i
[2024-10-29 15:21:12,772 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/770eb8d8c/91d8ac0cd5c14c569ff95bd34c7c6ab7/FLAG9248af39c
[2024-10-29 15:21:12,785 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/770eb8d8c/91d8ac0cd5c14c569ff95bd34c7c6ab7
[2024-10-29 15:21:12,787 INFO  L270        PluginConnector]: Initializing Witness Parser...
[2024-10-29 15:21:12,788 INFO  L274        PluginConnector]: Witness Parser initialized
[2024-10-29 15:21:12,789 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../results-verified/LOGDIR/SV-COMP24_no-data-race/fkp2013-1.yml/witness.graphml
[2024-10-29 15:21:12,843 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-10-29 15:21:12,845 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-10-29 15:21:12,847 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-10-29 15:21:12,847 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-10-29 15:21:12,853 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-10-29 15:21:12,854 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 03:21:12" (1/2) ...
[2024-10-29 15:21:12,855 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1126de92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:21:12, skipping insertion in model container
[2024-10-29 15:21:12,855 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 03:21:12" (1/2) ...
[2024-10-29 15:21:12,856 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@667bb31b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:21:12, skipping insertion in model container
[2024-10-29 15:21:12,857 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.graphml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 29.10 03:21:12" (2/2) ...
[2024-10-29 15:21:12,857 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1126de92 and model type witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:21:12, skipping insertion in model container
[2024-10-29 15:21:12,857 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.graphml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 29.10 03:21:12" (2/2) ...
[2024-10-29 15:21:12,902 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-10-29 15:21:13,293 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-10-29 15:21:13,303 INFO  L200         MainTranslator]: Completed pre-run
[2024-10-29 15:21:13,369 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-10-29 15:21:13,414 INFO  L204         MainTranslator]: Completed translation
[2024-10-29 15:21:13,415 INFO  L201        PluginConnector]: Adding new model witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:21:13 WrapperNode
[2024-10-29 15:21:13,415 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-10-29 15:21:13,417 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-10-29 15:21:13,417 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-10-29 15:21:13,417 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-10-29 15:21:13,424 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:21:13" (1/1) ...
[2024-10-29 15:21:13,445 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:21:13" (1/1) ...
[2024-10-29 15:21:13,466 INFO  L138                Inliner]: procedures = 171, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 54
[2024-10-29 15:21:13,467 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-10-29 15:21:13,468 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-10-29 15:21:13,468 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-10-29 15:21:13,469 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-10-29 15:21:13,477 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:21:13" (1/1) ...
[2024-10-29 15:21:13,477 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:21:13" (1/1) ...
[2024-10-29 15:21:13,481 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:21:13" (1/1) ...
[2024-10-29 15:21:13,481 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:21:13" (1/1) ...
[2024-10-29 15:21:13,486 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:21:13" (1/1) ...
[2024-10-29 15:21:13,492 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:21:13" (1/1) ...
[2024-10-29 15:21:13,494 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:21:13" (1/1) ...
[2024-10-29 15:21:13,495 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:21:13" (1/1) ...
[2024-10-29 15:21:13,497 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-10-29 15:21:13,499 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-10-29 15:21:13,499 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-10-29 15:21:13,499 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-10-29 15:21:13,500 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:21:13" (1/1) ...
[2024-10-29 15:21:13,510 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-10-29 15:21:13,525 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-10-29 15:21:13,542 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-10-29 15:21:13,547 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-10-29 15:21:13,601 INFO  L130     BoogieDeclarations]: Found specification of procedure thr2
[2024-10-29 15:21:13,601 INFO  L138     BoogieDeclarations]: Found implementation of procedure thr2
[2024-10-29 15:21:13,601 INFO  L130     BoogieDeclarations]: Found specification of procedure thr1
[2024-10-29 15:21:13,601 INFO  L138     BoogieDeclarations]: Found implementation of procedure thr1
[2024-10-29 15:21:13,601 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-10-29 15:21:13,601 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2024-10-29 15:21:13,601 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-10-29 15:21:13,602 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-10-29 15:21:13,603 WARN  L207             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement.
[2024-10-29 15:21:13,749 INFO  L238             CfgBuilder]: Building ICFG
[2024-10-29 15:21:13,752 INFO  L264             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-10-29 15:21:13,909 INFO  L283             CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2024-10-29 15:21:13,909 INFO  L287             CfgBuilder]: Performing block encoding
[2024-10-29 15:21:13,921 INFO  L311             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-10-29 15:21:13,921 INFO  L316             CfgBuilder]: Removed 1 assume(true) statements.
[2024-10-29 15:21:13,922 INFO  L201        PluginConnector]: Adding new model witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 03:21:13 BoogieIcfgContainer
[2024-10-29 15:21:13,922 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-10-29 15:21:13,924 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-10-29 15:21:13,924 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-10-29 15:21:13,927 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-10-29 15:21:13,927 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.10 03:21:12" (1/4) ...
[2024-10-29 15:21:13,928 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79179cc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 03:21:13, skipping insertion in model container
[2024-10-29 15:21:13,928 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.graphml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 29.10 03:21:12" (2/4) ...
[2024-10-29 15:21:13,928 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79179cc4 and model type witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 29.10 03:21:13, skipping insertion in model container
[2024-10-29 15:21:13,928 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:21:13" (3/4) ...
[2024-10-29 15:21:13,929 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79179cc4 and model type witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 29.10 03:21:13, skipping insertion in model container
[2024-10-29 15:21:13,929 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 03:21:13" (4/4) ...
[2024-10-29 15:21:13,930 INFO  L112   eAbstractionObserver]: Analyzing ICFG fkp2013-1.i
[2024-10-29 15:21:13,930 WARN  L117   eAbstractionObserver]: Found a witness automaton. I will only consider traces that are accepted by the witness automaton
[2024-10-29 15:21:13,950 INFO  L214   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-10-29 15:21:13,950 INFO  L154   ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations.
[2024-10-29 15:21:13,950 INFO  L489   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-10-29 15:21:14,023 INFO  L143    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-10-29 15:21:14,055 WARN  L158       CegarLoopFactory]: Violation witness validation is only supported for CEGAR loops based on FINITE_AUTOMATA. Ignoring concurrency settiong PETRI_NET and switching to FINITE_AUTOMATA.
[2024-10-29 15:21:14,071 INFO  L113   iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 82 places, 79 transitions, 166 flow
[2024-10-29 15:21:14,423 INFO  L135   iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result  has 4446 states, 4433 states have (on average 2.9264606361380556) internal successors, (12973), 4445 states have internal predecessors, (12973), 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-10-29 15:21:14,460 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-10-29 15:21:14,469 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=None, 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;@7c6d1da8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-10-29 15:21:14,470 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 9 error locations.
[2024-10-29 15:21:14,488 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 4446 states, 4433 states have (on average 2.9264606361380556) internal successors, (12973), 4445 states have internal predecessors, (12973), 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-10-29 15:21:14,494 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2024-10-29 15:21:14,494 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-29 15:21:14,494 INFO  L215           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-29 15:21:14,495 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-10-29 15:21:14,499 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-29 15:21:14,500 INFO  L85        PathProgramCache]: Analyzing trace with hash 492523335, now seen corresponding path program 1 times
[2024-10-29 15:21:14,512 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-29 15:21:14,513 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862507445]
[2024-10-29 15:21:14,513 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-29 15:21:14,514 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-29 15:21:14,633 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-29 15:21:14,753 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-29 15:21:14,754 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-29 15:21:14,754 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862507445]
[2024-10-29 15:21:14,755 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862507445] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-29 15:21:14,755 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-29 15:21:14,756 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-10-29 15:21:14,757 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743647248]
[2024-10-29 15:21:14,758 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-29 15:21:14,767 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-29 15:21:14,768 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-29 15:21:14,791 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-29 15:21:14,792 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-29 15:21:14,810 INFO  L87              Difference]: Start difference. First operand  has 4446 states, 4433 states have (on average 2.9264606361380556) internal successors, (12973), 4445 states have internal predecessors, (12973), 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) Second operand  has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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-10-29 15:21:14,998 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-29 15:21:14,998 INFO  L93              Difference]: Finished difference Result 6487 states and 18583 transitions.
[2024-10-29 15:21:15,000 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-10-29 15:21:15,002 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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) Word has length 18
[2024-10-29 15:21:15,003 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-29 15:21:15,064 INFO  L225             Difference]: With dead ends: 6487
[2024-10-29 15:21:15,064 INFO  L226             Difference]: Without dead ends: 3967
[2024-10-29 15:21:15,081 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-29 15:21:15,086 INFO  L432           NwaCegarLoop]: 69 mSDtfsCounter, 1 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-10-29 15:21:15,088 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 124 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-10-29 15:21:15,118 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3967 states.
[2024-10-29 15:21:15,302 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3967 to 3967.
[2024-10-29 15:21:15,312 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3967 states, 3950 states have (on average 2.7650632911392403) internal successors, (10922), 3966 states have internal predecessors, (10922), 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-10-29 15:21:15,337 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3967 states to 3967 states and 10922 transitions.
[2024-10-29 15:21:15,356 INFO  L78                 Accepts]: Start accepts. Automaton has 3967 states and 10922 transitions. Word has length 18
[2024-10-29 15:21:15,356 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-29 15:21:15,356 INFO  L471      AbstractCegarLoop]: Abstraction has 3967 states and 10922 transitions.
[2024-10-29 15:21:15,360 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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-10-29 15:21:15,361 INFO  L276                IsEmpty]: Start isEmpty. Operand 3967 states and 10922 transitions.
[2024-10-29 15:21:15,361 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2024-10-29 15:21:15,361 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-29 15:21:15,361 INFO  L215           NwaCegarLoop]: 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]
[2024-10-29 15:21:15,362 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-10-29 15:21:15,362 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-10-29 15:21:15,363 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-29 15:21:15,367 INFO  L85        PathProgramCache]: Analyzing trace with hash 612279905, now seen corresponding path program 1 times
[2024-10-29 15:21:15,368 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-29 15:21:15,368 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100213384]
[2024-10-29 15:21:15,368 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-29 15:21:15,368 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-29 15:21:15,407 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-29 15:21:15,513 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-29 15:21:15,513 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-29 15:21:15,513 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100213384]
[2024-10-29 15:21:15,513 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100213384] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-29 15:21:15,514 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-29 15:21:15,514 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-10-29 15:21:15,514 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82766135]
[2024-10-29 15:21:15,514 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-29 15:21:15,515 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-29 15:21:15,515 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-29 15:21:15,516 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-29 15:21:15,521 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-29 15:21:15,521 INFO  L87              Difference]: Start difference. First operand 3967 states and 10922 transitions. Second operand  has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 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-10-29 15:21:15,643 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-29 15:21:15,644 INFO  L93              Difference]: Finished difference Result 5107 states and 13918 transitions.
[2024-10-29 15:21:15,645 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-10-29 15:21:15,645 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 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) Word has length 26
[2024-10-29 15:21:15,646 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-29 15:21:15,682 INFO  L225             Difference]: With dead ends: 5107
[2024-10-29 15:21:15,683 INFO  L226             Difference]: Without dead ends: 4493
[2024-10-29 15:21:15,687 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-29 15:21:15,690 INFO  L432           NwaCegarLoop]: 94 mSDtfsCounter, 44 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-10-29 15:21:15,691 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 150 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-10-29 15:21:15,703 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4493 states.
[2024-10-29 15:21:15,805 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4493 to 3557.
[2024-10-29 15:21:15,820 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3557 states, 3547 states have (on average 2.7482379475613192) internal successors, (9748), 3556 states have internal predecessors, (9748), 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-10-29 15:21:15,837 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3557 states to 3557 states and 9748 transitions.
[2024-10-29 15:21:15,849 INFO  L78                 Accepts]: Start accepts. Automaton has 3557 states and 9748 transitions. Word has length 26
[2024-10-29 15:21:15,850 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-29 15:21:15,850 INFO  L471      AbstractCegarLoop]: Abstraction has 3557 states and 9748 transitions.
[2024-10-29 15:21:15,851 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 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-10-29 15:21:15,852 INFO  L276                IsEmpty]: Start isEmpty. Operand 3557 states and 9748 transitions.
[2024-10-29 15:21:15,856 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 41
[2024-10-29 15:21:15,858 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-29 15:21:15,859 INFO  L215           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-29 15:21:15,859 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-10-29 15:21:15,860 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting thr2Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-10-29 15:21:15,860 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-29 15:21:15,860 INFO  L85        PathProgramCache]: Analyzing trace with hash 217715466, now seen corresponding path program 1 times
[2024-10-29 15:21:15,860 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-29 15:21:15,861 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103821841]
[2024-10-29 15:21:15,861 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-29 15:21:15,861 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-29 15:21:15,886 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-29 15:21:15,926 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-29 15:21:15,927 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-29 15:21:15,927 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103821841]
[2024-10-29 15:21:15,927 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103821841] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-29 15:21:15,927 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-29 15:21:15,928 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-10-29 15:21:15,928 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058258934]
[2024-10-29 15:21:15,928 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-29 15:21:15,928 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-29 15:21:15,929 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-29 15:21:15,929 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-29 15:21:15,930 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-29 15:21:15,930 INFO  L87              Difference]: Start difference. First operand 3557 states and 9748 transitions. Second operand  has 3 states, 2 states have (on average 20.0) internal successors, (40), 3 states have internal predecessors, (40), 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-10-29 15:21:16,003 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-29 15:21:16,003 INFO  L93              Difference]: Finished difference Result 4125 states and 11280 transitions.
[2024-10-29 15:21:16,004 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-10-29 15:21:16,007 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 2 states have (on average 20.0) internal successors, (40), 3 states have internal predecessors, (40), 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) Word has length 40
[2024-10-29 15:21:16,007 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-29 15:21:16,041 INFO  L225             Difference]: With dead ends: 4125
[2024-10-29 15:21:16,041 INFO  L226             Difference]: Without dead ends: 3188
[2024-10-29 15:21:16,048 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-29 15:21:16,051 INFO  L432           NwaCegarLoop]: 96 mSDtfsCounter, 31 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-10-29 15:21:16,054 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 153 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-10-29 15:21:16,062 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3188 states.
[2024-10-29 15:21:16,134 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3188 to 3045.
[2024-10-29 15:21:16,140 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3045 states, 3037 states have (on average 2.6957523872242346) internal successors, (8187), 3044 states have internal predecessors, (8187), 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-10-29 15:21:16,155 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3045 states to 3045 states and 8187 transitions.
[2024-10-29 15:21:16,267 INFO  L78                 Accepts]: Start accepts. Automaton has 3045 states and 8187 transitions. Word has length 40
[2024-10-29 15:21:16,271 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-29 15:21:16,271 INFO  L471      AbstractCegarLoop]: Abstraction has 3045 states and 8187 transitions.
[2024-10-29 15:21:16,271 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 2 states have (on average 20.0) internal successors, (40), 3 states have internal predecessors, (40), 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-10-29 15:21:16,272 INFO  L276                IsEmpty]: Start isEmpty. Operand 3045 states and 8187 transitions.
[2024-10-29 15:21:16,277 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 42
[2024-10-29 15:21:16,278 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-29 15:21:16,278 INFO  L215           NwaCegarLoop]: trace histogram [2, 2, 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]
[2024-10-29 15:21:16,278 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-10-29 15:21:16,278 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-10-29 15:21:16,279 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-29 15:21:16,279 INFO  L85        PathProgramCache]: Analyzing trace with hash -1414451964, now seen corresponding path program 1 times
[2024-10-29 15:21:16,279 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-29 15:21:16,279 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189093297]
[2024-10-29 15:21:16,279 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-29 15:21:16,279 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-29 15:21:16,312 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-29 15:21:16,313 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-29 15:21:16,328 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-29 15:21:16,363 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-10-29 15:21:16,364 INFO  L325         BasicCegarLoop]: Counterexample is feasible
[2024-10-29 15:21:16,365 INFO  L782   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining)
[2024-10-29 15:21:16,366 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining)
[2024-10-29 15:21:16,367 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining)
[2024-10-29 15:21:16,367 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining)
[2024-10-29 15:21:16,367 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining)
[2024-10-29 15:21:16,368 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 9 remaining)
[2024-10-29 15:21:16,368 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining)
[2024-10-29 15:21:16,370 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining)
[2024-10-29 15:21:16,370 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining)
[2024-10-29 15:21:16,372 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-10-29 15:21:16,375 INFO  L407         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1]
[2024-10-29 15:21:16,378 WARN  L244   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-10-29 15:21:16,378 INFO  L489   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2024-10-29 15:21:16,420 INFO  L143    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-10-29 15:21:16,425 WARN  L158       CegarLoopFactory]: Violation witness validation is only supported for CEGAR loops based on FINITE_AUTOMATA. Ignoring concurrency settiong PETRI_NET and switching to FINITE_AUTOMATA.
[2024-10-29 15:21:16,427 INFO  L113   iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 119 places, 114 transitions, 248 flow
[2024-10-29 15:21:18,653 INFO  L135   iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result  has 71682 states, 71640 states have (on average 3.862213847012842) internal successors, (276689), 71681 states have internal predecessors, (276689), 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-10-29 15:21:18,657 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-10-29 15:21:18,661 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=None, 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;@7c6d1da8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-10-29 15:21:18,663 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 12 error locations.
[2024-10-29 15:21:18,813 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 71682 states, 71640 states have (on average 3.862213847012842) internal successors, (276689), 71681 states have internal predecessors, (276689), 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-10-29 15:21:18,815 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2024-10-29 15:21:18,816 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-29 15:21:18,816 INFO  L215           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-29 15:21:18,816 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-10-29 15:21:18,817 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-29 15:21:18,818 INFO  L85        PathProgramCache]: Analyzing trace with hash -139489401, now seen corresponding path program 1 times
[2024-10-29 15:21:18,818 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-29 15:21:18,818 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049248958]
[2024-10-29 15:21:18,818 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-29 15:21:18,820 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-29 15:21:18,839 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-29 15:21:18,869 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-29 15:21:18,870 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-29 15:21:18,870 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049248958]
[2024-10-29 15:21:18,871 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049248958] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-29 15:21:18,872 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-29 15:21:18,872 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-10-29 15:21:18,872 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091802566]
[2024-10-29 15:21:18,872 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-29 15:21:18,873 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-29 15:21:18,873 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-29 15:21:18,873 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-29 15:21:18,874 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-29 15:21:19,258 INFO  L87              Difference]: Start difference. First operand  has 71682 states, 71640 states have (on average 3.862213847012842) internal successors, (276689), 71681 states have internal predecessors, (276689), 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) Second operand  has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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-10-29 15:21:21,266 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-29 15:21:21,267 INFO  L93              Difference]: Finished difference Result 106471 states and 405171 transitions.
[2024-10-29 15:21:21,267 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-10-29 15:21:21,268 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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) Word has length 18
[2024-10-29 15:21:21,268 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-29 15:21:22,354 INFO  L225             Difference]: With dead ends: 106471
[2024-10-29 15:21:22,354 INFO  L226             Difference]: Without dead ends: 63775
[2024-10-29 15:21:22,471 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-29 15:21:22,472 INFO  L432           NwaCegarLoop]: 83 mSDtfsCounter, 1 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-10-29 15:21:22,474 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 146 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-10-29 15:21:22,838 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 63775 states.
[2024-10-29 15:21:25,281 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 63775 to 63775.
[2024-10-29 15:21:25,397 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 63775 states, 63715 states have (on average 3.68955504983128) internal successors, (235080), 63774 states have internal predecessors, (235080), 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-10-29 15:21:26,276 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 63775 states to 63775 states and 235080 transitions.
[2024-10-29 15:21:26,398 INFO  L78                 Accepts]: Start accepts. Automaton has 63775 states and 235080 transitions. Word has length 18
[2024-10-29 15:21:26,399 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-29 15:21:26,399 INFO  L471      AbstractCegarLoop]: Abstraction has 63775 states and 235080 transitions.
[2024-10-29 15:21:26,399 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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-10-29 15:21:26,399 INFO  L276                IsEmpty]: Start isEmpty. Operand 63775 states and 235080 transitions.
[2024-10-29 15:21:26,400 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2024-10-29 15:21:26,400 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-29 15:21:26,400 INFO  L215           NwaCegarLoop]: 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]
[2024-10-29 15:21:26,400 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-10-29 15:21:26,401 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-10-29 15:21:26,401 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-29 15:21:26,401 INFO  L85        PathProgramCache]: Analyzing trace with hash 831466125, now seen corresponding path program 1 times
[2024-10-29 15:21:26,401 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-29 15:21:26,402 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425696613]
[2024-10-29 15:21:26,402 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-29 15:21:26,402 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-29 15:21:26,410 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-29 15:21:26,438 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-29 15:21:26,442 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-29 15:21:26,442 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425696613]
[2024-10-29 15:21:26,443 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425696613] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-29 15:21:26,443 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-29 15:21:26,443 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-10-29 15:21:26,443 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502134126]
[2024-10-29 15:21:26,443 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-29 15:21:26,443 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-29 15:21:26,444 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-29 15:21:26,444 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-29 15:21:26,444 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-29 15:21:26,444 INFO  L87              Difference]: Start difference. First operand 63775 states and 235080 transitions. Second operand  has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 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-10-29 15:21:27,761 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-29 15:21:27,762 INFO  L93              Difference]: Finished difference Result 104071 states and 378436 transitions.
[2024-10-29 15:21:27,763 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-10-29 15:21:27,763 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 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) Word has length 26
[2024-10-29 15:21:27,763 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-29 15:21:28,594 INFO  L225             Difference]: With dead ends: 104071
[2024-10-29 15:21:28,595 INFO  L226             Difference]: Without dead ends: 91979
[2024-10-29 15:21:28,673 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-29 15:21:28,674 INFO  L432           NwaCegarLoop]: 114 mSDtfsCounter, 56 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-10-29 15:21:28,674 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 181 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-10-29 15:21:29,417 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 91979 states.
[2024-10-29 15:21:31,730 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 91979 to 62891.
[2024-10-29 15:21:31,831 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 62891 states, 62841 states have (on average 3.6702630448274216) internal successors, (230643), 62890 states have internal predecessors, (230643), 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-10-29 15:21:32,092 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 62891 states to 62891 states and 230643 transitions.
[2024-10-29 15:21:32,238 INFO  L78                 Accepts]: Start accepts. Automaton has 62891 states and 230643 transitions. Word has length 26
[2024-10-29 15:21:32,238 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-29 15:21:32,239 INFO  L471      AbstractCegarLoop]: Abstraction has 62891 states and 230643 transitions.
[2024-10-29 15:21:32,239 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 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-10-29 15:21:32,239 INFO  L276                IsEmpty]: Start isEmpty. Operand 62891 states and 230643 transitions.
[2024-10-29 15:21:32,240 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 41
[2024-10-29 15:21:32,240 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-29 15:21:32,240 INFO  L215           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-29 15:21:32,241 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-10-29 15:21:32,241 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting thr2Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-10-29 15:21:32,241 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-29 15:21:32,242 INFO  L85        PathProgramCache]: Analyzing trace with hash 488728117, now seen corresponding path program 1 times
[2024-10-29 15:21:32,242 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-29 15:21:32,242 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379054633]
[2024-10-29 15:21:32,242 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-29 15:21:32,242 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-29 15:21:32,252 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-29 15:21:32,277 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-29 15:21:32,278 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-29 15:21:32,278 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379054633]
[2024-10-29 15:21:32,278 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379054633] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-29 15:21:32,278 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-29 15:21:32,278 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-10-29 15:21:32,279 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159676570]
[2024-10-29 15:21:32,279 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-29 15:21:32,279 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-29 15:21:32,279 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-29 15:21:32,280 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-29 15:21:32,280 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-29 15:21:32,280 INFO  L87              Difference]: Start difference. First operand 62891 states and 230643 transitions. Second operand  has 3 states, 2 states have (on average 20.0) internal successors, (40), 3 states have internal predecessors, (40), 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-10-29 15:21:33,615 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-29 15:21:33,615 INFO  L93              Difference]: Finished difference Result 74757 states and 273686 transitions.
[2024-10-29 15:21:33,615 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-10-29 15:21:33,616 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 2 states have (on average 20.0) internal successors, (40), 3 states have internal predecessors, (40), 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) Word has length 40
[2024-10-29 15:21:33,616 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-29 15:21:34,139 INFO  L225             Difference]: With dead ends: 74757
[2024-10-29 15:21:34,140 INFO  L226             Difference]: Without dead ends: 66655
[2024-10-29 15:21:34,231 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-29 15:21:34,232 INFO  L432           NwaCegarLoop]: 120 mSDtfsCounter, 44 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-10-29 15:21:34,233 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 185 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-10-29 15:21:34,354 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 66655 states.
[2024-10-29 15:21:36,707 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 66655 to 62907.
[2024-10-29 15:21:36,806 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 62907 states, 62860 states have (on average 3.6500954502068086) internal successors, (229445), 62906 states have internal predecessors, (229445), 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-10-29 15:21:37,150 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 62907 states to 62907 states and 229445 transitions.
[2024-10-29 15:21:37,276 INFO  L78                 Accepts]: Start accepts. Automaton has 62907 states and 229445 transitions. Word has length 40
[2024-10-29 15:21:37,276 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-29 15:21:37,277 INFO  L471      AbstractCegarLoop]: Abstraction has 62907 states and 229445 transitions.
[2024-10-29 15:21:37,277 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 2 states have (on average 20.0) internal successors, (40), 3 states have internal predecessors, (40), 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-10-29 15:21:37,277 INFO  L276                IsEmpty]: Start isEmpty. Operand 62907 states and 229445 transitions.
[2024-10-29 15:21:37,279 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 43
[2024-10-29 15:21:37,279 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-29 15:21:37,279 INFO  L215           NwaCegarLoop]: 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]
[2024-10-29 15:21:37,280 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-10-29 15:21:37,280 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-10-29 15:21:37,280 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-29 15:21:37,280 INFO  L85        PathProgramCache]: Analyzing trace with hash -1789488355, now seen corresponding path program 1 times
[2024-10-29 15:21:37,281 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-29 15:21:37,281 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897347124]
[2024-10-29 15:21:37,281 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-29 15:21:37,281 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-29 15:21:37,294 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-29 15:21:37,294 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-29 15:21:37,308 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-29 15:21:37,318 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-10-29 15:21:37,319 INFO  L325         BasicCegarLoop]: Counterexample is feasible
[2024-10-29 15:21:37,319 INFO  L782   garLoopResultBuilder]: Registering result UNSAFE for location thr1Err0ASSERT_VIOLATIONDATA_RACE (11 of 12 remaining)
[2024-10-29 15:21:37,319 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining)
[2024-10-29 15:21:37,319 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining)
[2024-10-29 15:21:37,320 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining)
[2024-10-29 15:21:37,320 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining)
[2024-10-29 15:21:37,320 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 12 remaining)
[2024-10-29 15:21:37,321 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 12 remaining)
[2024-10-29 15:21:37,321 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining)
[2024-10-29 15:21:37,321 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining)
[2024-10-29 15:21:37,321 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining)
[2024-10-29 15:21:37,321 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining)
[2024-10-29 15:21:37,322 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining)
[2024-10-29 15:21:37,322 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-10-29 15:21:37,322 INFO  L407         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1]
[2024-10-29 15:21:37,367 INFO  L239   ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances
[2024-10-29 15:21:37,367 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2024-10-29 15:21:37,373 INFO  L201        PluginConnector]: Adding new model witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.10 03:21:37 BasicIcfg
[2024-10-29 15:21:37,373 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-10-29 15:21:37,374 INFO  L158              Benchmark]: Toolchain (without parser) took 24529.14ms. Allocated memory was 176.2MB in the beginning and 13.2GB in the end (delta: 13.1GB). Free memory was 116.7MB in the beginning and 11.4GB in the end (delta: -11.3GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB.
[2024-10-29 15:21:37,374 INFO  L158              Benchmark]: CDTParser took 0.28ms. Allocated memory is still 176.2MB. Free memory is still 141.7MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-10-29 15:21:37,374 INFO  L158              Benchmark]: Witness Parser took 0.18ms. Allocated memory is still 176.2MB. Free memory is still 118.8MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-10-29 15:21:37,374 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 568.46ms. Allocated memory is still 176.2MB. Free memory was 116.3MB in the beginning and 94.5MB in the end (delta: 21.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB.
[2024-10-29 15:21:37,375 INFO  L158              Benchmark]: Boogie Procedure Inliner took 50.14ms. Allocated memory is still 176.2MB. Free memory was 94.5MB in the beginning and 92.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-10-29 15:21:37,375 INFO  L158              Benchmark]: Boogie Preprocessor took 29.60ms. Allocated memory is still 176.2MB. Free memory was 92.4MB in the beginning and 91.2MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-10-29 15:21:37,375 INFO  L158              Benchmark]: RCFGBuilder took 423.53ms. Allocated memory is still 176.2MB. Free memory was 91.2MB in the beginning and 78.2MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB.
[2024-10-29 15:21:37,376 INFO  L158              Benchmark]: TraceAbstraction took 23449.44ms. Allocated memory was 176.2MB in the beginning and 13.2GB in the end (delta: 13.1GB). Free memory was 77.4MB in the beginning and 11.4GB in the end (delta: -11.3GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB.
[2024-10-29 15:21:37,378 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.28ms. Allocated memory is still 176.2MB. Free memory is still 141.7MB. There was no memory consumed. Max. memory is 16.1GB.
 * Witness Parser took 0.18ms. Allocated memory is still 176.2MB. Free memory is still 118.8MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 568.46ms. Allocated memory is still 176.2MB. Free memory was 116.3MB in the beginning and 94.5MB in the end (delta: 21.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 50.14ms. Allocated memory is still 176.2MB. Free memory was 94.5MB in the beginning and 92.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 29.60ms. Allocated memory is still 176.2MB. Free memory was 92.4MB in the beginning and 91.2MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
 * RCFGBuilder took 423.53ms. Allocated memory is still 176.2MB. Free memory was 91.2MB in the beginning and 78.2MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB.
 * TraceAbstraction took 23449.44ms. Allocated memory was 176.2MB in the beginning and 13.2GB in the end (delta: 13.1GB). Free memory was 77.4MB in the beginning and 11.4GB in the end (delta: -11.3GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
  - DataRaceFoundResult [Line: 699]: Data race detected
    Data race detected
The following path leads to a data race: 
[L697]               0  volatile int x;
        VAL             [x=0]
[L709]               0  pthread_t t1, t2;
        VAL             [\old(argc)=52, \old(argv)={49:51}, argc=52, x=0]
[L710]               0  int i;
        VAL             [\old(argc)=52, \old(argv)={49:51}, argc=52, x=0]
[L711]               0  x = 0
        VAL             [\old(argc)=52, \old(argv)={49:51}, argc=52, x=0]
[L712]  FCALL, FORK  0  pthread_create(&t1, 0, thr1, 0)
        VAL             [\old(argc)=52, \old(argv)={49:51}, argc=52, t1=-1, x=0]
[L699]               1  x < 50
        VAL             [\old(arg)={0:0}, arg={0:0}, x=0]
[L713]               0  i = 0
        VAL             [\old(argc)=52, \old(argv)={49:51}, argc=52, i=0, t1=-1, x=0]
[L713]  COND TRUE    0  i < 50
        VAL             [\old(argc)=52, \old(argv)={49:51}, argc=52, i=0, t1=-1, x=0]
[L714]  FCALL, FORK  0  pthread_create(&t2, 0, thr2, 0)
        VAL             [\old(arg)={0:0}, \old(argc)=52, \old(argv)={49:51}, argc=52, i=0, t1=-1, t2=0, x=0]
[L703]               2  int t;
        VAL             [\old(arg)={0:0}, arg={0:0}, x=0]
[L704]               2  t = x
        VAL             [\old(arg)={0:0}, arg={0:0}, t=0, x=0]
[L705]               2  x = t + 1
        VAL             [\old(arg)={0:0}, arg={0:0}, t=0, x=1]
[L699]               1  x < 50
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, t=0, x=1]

Now there is a data race on ~x~0 between 
	C: x = t + 1 [705]
and
	C: x < 50 [699]

  - UnprovableResult [Line: 704]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 705]: 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: 714]: 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: 712]: 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. 
  - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
    CFG has 5 procedures, 111 locations, 9 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 76 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 76 mSDsluCounter, 427 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 168 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 51 IncrementalHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 259 mSDtfsCounter, 51 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4446occurred in iteration=0, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 3 MinimizatonAttempts, 1079 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 125 NumberOfCodeBlocks, 125 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 81 ConstructedInterpolants, 0 QuantifiedInterpolants, 87 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
  - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances
    CFG has 7 procedures, 144 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 20.9s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 7.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 101 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 101 mSDsluCounter, 512 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 195 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 86 IncrementalHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 317 mSDtfsCounter, 86 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71682occurred in iteration=0, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 10.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 32836 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 126 NumberOfCodeBlocks, 126 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 81 ConstructedInterpolants, 0 QuantifiedInterpolants, 87 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
[2024-10-29 15:21:37,411 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---

Execution finished normally
Writing output log to file Ultimate.log
Writing human readable error path to file UltimateCounterExample.errorpath
Result:
FALSE