./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/02-base_24-malloc_races.i --full-output --witness-type violation_witness --validate ../results-verified/LOGDIR/SV-COMP24_no-data-race/02-base_24-malloc_races.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/goblint-regression/02-base_24-malloc_races.i ../results-verified/LOGDIR/SV-COMP24_no-data-race/02-base_24-malloc_races.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:22:22,858 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-10-29 15:22:22,927 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2024-10-29 15:22:22,932 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-10-29 15:22:22,932 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-10-29 15:22:22,974 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-10-29 15:22:22,974 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-10-29 15:22:22,975 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-10-29 15:22:22,975 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-10-29 15:22:22,976 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-10-29 15:22:22,976 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-10-29 15:22:22,976 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-10-29 15:22:22,977 INFO L153 SettingsManager]: * Use SBE=true
[2024-10-29 15:22:22,980 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-10-29 15:22:22,980 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-10-29 15:22:22,981 INFO L153 SettingsManager]: * sizeof long=4
[2024-10-29 15:22:22,981 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-10-29 15:22:22,981 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-10-29 15:22:22,982 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-10-29 15:22:22,982 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-10-29 15:22:22,982 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-10-29 15:22:22,983 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-10-29 15:22:22,983 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true
[2024-10-29 15:22:22,983 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-10-29 15:22:22,984 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false
[2024-10-29 15:22:22,984 INFO L153 SettingsManager]: * sizeof long double=12
[2024-10-29 15:22:22,984 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-10-29 15:22:22,985 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-10-29 15:22:22,985 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-10-29 15:22:22,985 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-10-29 15:22:22,986 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-10-29 15:22:22,986 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-10-29 15:22:22,986 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-10-29 15:22:22,987 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-10-29 15:22:22,987 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-10-29 15:22:22,987 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-10-29 15:22:22,988 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-10-29 15:22:22,997 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-10-29 15:22:22,997 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-10-29 15:22:22,997 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-10-29 15:22:22,998 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-10-29 15:22:22,998 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:22:23,248 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-10-29 15:22:23,274 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-10-29 15:22:23,277 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-10-29 15:22:23,278 INFO L270 PluginConnector]: Initializing Witness Parser...
[2024-10-29 15:22:23,279 INFO L274 PluginConnector]: Witness Parser initialized
[2024-10-29 15:22:23,280 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../results-verified/LOGDIR/SV-COMP24_no-data-race/02-base_24-malloc_races.yml/witness.graphml
[2024-10-29 15:22:23,343 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-10-29 15:22:23,344 INFO L274 PluginConnector]: CDTParser initialized
[2024-10-29 15:22:23,345 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/02-base_24-malloc_races.i
[2024-10-29 15:22:24,863 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-10-29 15:22:25,156 INFO L384 CDTParser]: Found 1 translation units.
[2024-10-29 15:22:25,157 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/02-base_24-malloc_races.i
[2024-10-29 15:22:25,182 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f5b1a89d/7ffef2773a1140d2be3dcf52de71ea80/FLAGa45e22ac4
[2024-10-29 15:22:25,201 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f5b1a89d/7ffef2773a1140d2be3dcf52de71ea80
[2024-10-29 15:22:25,201 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-10-29 15:22:25,202 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements.
[2024-10-29 15:22:25,203 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-10-29 15:22:25,204 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-10-29 15:22:25,209 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-10-29 15:22:25,209 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.graphml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 29.10 03:22:23" (1/2) ...
[2024-10-29 15:22:25,211 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76a8afe2 and model type witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:22:25, skipping insertion in model container
[2024-10-29 15:22:25,211 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.graphml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 29.10 03:22:23" (1/2) ...
[2024-10-29 15:22:25,212 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7b2bb603 and model type witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:22:25, skipping insertion in model container
[2024-10-29 15:22:25,213 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 03:22:25" (2/2) ...
[2024-10-29 15:22:25,213 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76a8afe2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:22:25, skipping insertion in model container
[2024-10-29 15:22:25,214 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 03:22:25" (2/2) ...
[2024-10-29 15:22:25,271 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-10-29 15:22:25,808 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-10-29 15:22:25,823 INFO L200 MainTranslator]: Completed pre-run
[2024-10-29 15:22:25,872 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-10-29 15:22:26,003 INFO L204 MainTranslator]: Completed translation
[2024-10-29 15:22:26,004 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:22:26 WrapperNode
[2024-10-29 15:22:26,004 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-10-29 15:22:26,005 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-10-29 15:22:26,005 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-10-29 15:22:26,005 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-10-29 15:22:26,013 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:22:26" (1/1) ...
[2024-10-29 15:22:26,045 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:22:26" (1/1) ...
[2024-10-29 15:22:26,078 INFO L138 Inliner]: procedures = 365, calls = 19, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 64
[2024-10-29 15:22:26,081 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-10-29 15:22:26,082 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-10-29 15:22:26,083 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-10-29 15:22:26,083 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-10-29 15:22:26,092 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:22:26" (1/1) ...
[2024-10-29 15:22:26,092 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:22:26" (1/1) ...
[2024-10-29 15:22:26,098 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:22:26" (1/1) ...
[2024-10-29 15:22:26,102 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:22:26" (1/1) ...
[2024-10-29 15:22:26,120 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:22:26" (1/1) ...
[2024-10-29 15:22:26,121 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:22:26" (1/1) ...
[2024-10-29 15:22:26,124 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:22:26" (1/1) ...
[2024-10-29 15:22:26,125 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:22:26" (1/1) ...
[2024-10-29 15:22:26,131 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-10-29 15:22:26,136 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-10-29 15:22:26,136 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-10-29 15:22:26,136 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-10-29 15:22:26,137 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:22:26" (1/1) ...
[2024-10-29 15:22:26,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-10-29 15:22:26,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-10-29 15:22:26,180 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:22:26,186 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:22:26,239 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock
[2024-10-29 15:22:26,240 INFO L130 BoogieDeclarations]: Found specification of procedure read~int
[2024-10-29 15:22:26,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2024-10-29 15:22:26,240 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock
[2024-10-29 15:22:26,241 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2024-10-29 15:22:26,241 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-10-29 15:22:26,241 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun
[2024-10-29 15:22:26,241 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun
[2024-10-29 15:22:26,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2024-10-29 15:22:26,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-10-29 15:22:26,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-10-29 15:22:26,245 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:22:26,389 INFO L238 CfgBuilder]: Building ICFG
[2024-10-29 15:22:26,391 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-10-29 15:22:26,571 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2024-10-29 15:22:26,572 INFO L287 CfgBuilder]: Performing block encoding
[2024-10-29 15:22:26,612 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-10-29 15:22:26,613 INFO L316 CfgBuilder]: Removed 0 assume(true) statements.
[2024-10-29 15:22:26,613 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 03:22:26 BoogieIcfgContainer
[2024-10-29 15:22:26,613 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-10-29 15:22:26,615 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-10-29 15:22:26,616 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-10-29 15:22:26,619 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-10-29 15:22:26,619 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.graphml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 29.10 03:22:23" (1/4) ...
[2024-10-29 15:22:26,620 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a836e25 and model type witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 29.10 03:22:26, skipping insertion in model container
[2024-10-29 15:22:26,620 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.10 03:22:25" (2/4) ...
[2024-10-29 15:22:26,621 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a836e25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 03:22:26, skipping insertion in model container
[2024-10-29 15:22:26,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:22:26" (3/4) ...
[2024-10-29 15:22:26,621 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a836e25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 03:22:26, skipping insertion in model container
[2024-10-29 15:22:26,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 03:22:26" (4/4) ...
[2024-10-29 15:22:26,622 INFO L112 eAbstractionObserver]: Analyzing ICFG 02-base_24-malloc_races.i
[2024-10-29 15:22:26,622 WARN L117 eAbstractionObserver]: Found a witness automaton. I will only consider traces that are accepted by the witness automaton
[2024-10-29 15:22:26,652 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-10-29 15:22:26,653 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations.
[2024-10-29 15:22:26,653 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-10-29 15:22:26,727 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-10-29 15:22:26,748 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:22:26,760 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 106 places, 102 transitions, 208 flow
[2024-10-29 15:22:26,863 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1176 states, 1150 states have (on average 1.9556521739130435) internal successors, (2249), 1175 states have internal predecessors, (2249), 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:22:26,891 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-10-29 15:22:26,898 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;@5523c2c2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-10-29 15:22:26,898 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations.
[2024-10-29 15:22:26,903 INFO L276 IsEmpty]: Start isEmpty. Operand has 1176 states, 1150 states have (on average 1.9556521739130435) internal successors, (2249), 1175 states have internal predecessors, (2249), 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:22:26,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2024-10-29 15:22:26,909 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-29 15:22:26,909 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-29 15:22:26,910 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-10-29 15:22:26,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-29 15:22:26,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1567190117, now seen corresponding path program 1 times
[2024-10-29 15:22:26,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-29 15:22:26,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329575838]
[2024-10-29 15:22:26,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-29 15:22:26,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-29 15:22:27,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-29 15:22:27,146 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:22:27,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-29 15:22:27,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329575838]
[2024-10-29 15:22:27,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329575838] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-29 15:22:27,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-29 15:22:27,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-10-29 15:22:27,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018401115]
[2024-10-29 15:22:27,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-29 15:22:27,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-29 15:22:27,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-29 15:22:27,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-29 15:22:27,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-29 15:22:27,190 INFO L87 Difference]: Start difference. First operand has 1176 states, 1150 states have (on average 1.9556521739130435) internal successors, (2249), 1175 states have internal predecessors, (2249), 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.5) internal successors, (19), 3 states have internal predecessors, (19), 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:22:27,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-29 15:22:27,298 INFO L93 Difference]: Finished difference Result 1176 states and 2249 transitions.
[2024-10-29 15:22:27,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-10-29 15:22:27,303 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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 19
[2024-10-29 15:22:27,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-29 15:22:27,325 INFO L225 Difference]: With dead ends: 1176
[2024-10-29 15:22:27,325 INFO L226 Difference]: Without dead ends: 1175
[2024-10-29 15:22:27,329 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:22:27,333 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 2 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-10-29 15:22:27,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 176 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-10-29 15:22:27,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states.
[2024-10-29 15:22:27,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 1175.
[2024-10-29 15:22:27,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1175 states, 1150 states have (on average 1.9547826086956521) internal successors, (2248), 1174 states have internal predecessors, (2248), 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:22:27,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1175 states to 1175 states and 2248 transitions.
[2024-10-29 15:22:27,497 INFO L78 Accepts]: Start accepts. Automaton has 1175 states and 2248 transitions. Word has length 19
[2024-10-29 15:22:27,498 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-29 15:22:27,498 INFO L471 AbstractCegarLoop]: Abstraction has 1175 states and 2248 transitions.
[2024-10-29 15:22:27,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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:22:27,499 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 2248 transitions.
[2024-10-29 15:22:27,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2024-10-29 15:22:27,500 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-29 15:22:27,500 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:22:27,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-10-29 15:22:27,501 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-10-29 15:22:27,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-29 15:22:27,504 INFO L85 PathProgramCache]: Analyzing trace with hash 166918694, now seen corresponding path program 1 times
[2024-10-29 15:22:27,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-29 15:22:27,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041797738]
[2024-10-29 15:22:27,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-29 15:22:27,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-29 15:22:27,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-29 15:22:27,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-29 15:22:27,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-29 15:22:27,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041797738]
[2024-10-29 15:22:27,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041797738] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-29 15:22:27,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-29 15:22:27,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-10-29 15:22:27,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776764740]
[2024-10-29 15:22:27,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-29 15:22:27,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-29 15:22:27,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-29 15:22:27,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-29 15:22:27,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-29 15:22:27,669 INFO L87 Difference]: Start difference. First operand 1175 states and 2248 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:22:27,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-29 15:22:27,725 INFO L93 Difference]: Finished difference Result 1175 states and 2248 transitions.
[2024-10-29 15:22:27,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-10-29 15:22:27,726 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:22:27,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-29 15:22:27,734 INFO L225 Difference]: With dead ends: 1175
[2024-10-29 15:22:27,734 INFO L226 Difference]: Without dead ends: 1174
[2024-10-29 15:22:27,735 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:22:27,737 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 2 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-10-29 15:22:27,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 174 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-10-29 15:22:27,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states.
[2024-10-29 15:22:27,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 1174.
[2024-10-29 15:22:27,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1174 states, 1150 states have (on average 1.9539130434782608) internal successors, (2247), 1173 states have internal predecessors, (2247), 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:22:27,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 2247 transitions.
[2024-10-29 15:22:27,780 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 2247 transitions. Word has length 26
[2024-10-29 15:22:27,780 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-29 15:22:27,780 INFO L471 AbstractCegarLoop]: Abstraction has 1174 states and 2247 transitions.
[2024-10-29 15:22:27,780 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:22:27,781 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 2247 transitions.
[2024-10-29 15:22:27,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38
[2024-10-29 15:22:27,782 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-29 15:22:27,782 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]
[2024-10-29 15:22:27,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-10-29 15:22:27,783 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-10-29 15:22:27,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-29 15:22:27,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1560174162, now seen corresponding path program 1 times
[2024-10-29 15:22:27,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-29 15:22:27,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167080887]
[2024-10-29 15:22:27,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-29 15:22:27,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-29 15:22:27,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-29 15:22:27,889 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:22:27,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-29 15:22:27,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167080887]
[2024-10-29 15:22:27,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167080887] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-29 15:22:27,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-29 15:22:27,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-10-29 15:22:27,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844275304]
[2024-10-29 15:22:27,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-29 15:22:27,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-29 15:22:27,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-29 15:22:27,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-29 15:22:27,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-29 15:22:27,893 INFO L87 Difference]: Start difference. First operand 1174 states and 2247 transitions. Second operand has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 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:22:27,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-29 15:22:27,932 INFO L93 Difference]: Finished difference Result 1174 states and 2247 transitions.
[2024-10-29 15:22:27,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-10-29 15:22:27,933 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 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 37
[2024-10-29 15:22:27,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-29 15:22:27,941 INFO L225 Difference]: With dead ends: 1174
[2024-10-29 15:22:27,941 INFO L226 Difference]: Without dead ends: 1106
[2024-10-29 15:22:27,943 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:22:27,945 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 63 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-10-29 15:22:27,946 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 133 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-10-29 15:22:27,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states.
[2024-10-29 15:22:27,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 1106.
[2024-10-29 15:22:27,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1106 states, 1091 states have (on average 1.9367552703941338) internal successors, (2113), 1105 states have internal predecessors, (2113), 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:22:27,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 2113 transitions.
[2024-10-29 15:22:27,981 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 2113 transitions. Word has length 37
[2024-10-29 15:22:27,982 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-29 15:22:27,982 INFO L471 AbstractCegarLoop]: Abstraction has 1106 states and 2113 transitions.
[2024-10-29 15:22:27,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 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:22:27,984 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 2113 transitions.
[2024-10-29 15:22:27,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45
[2024-10-29 15:22:27,985 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-29 15:22:27,986 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, 1, 1]
[2024-10-29 15:22:27,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-10-29 15:22:27,986 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-10-29 15:22:27,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-29 15:22:27,988 INFO L85 PathProgramCache]: Analyzing trace with hash 228185078, now seen corresponding path program 1 times
[2024-10-29 15:22:27,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-29 15:22:27,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725889909]
[2024-10-29 15:22:27,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-29 15:22:27,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-29 15:22:28,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-29 15:22:28,599 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:22:28,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-29 15:22:28,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725889909]
[2024-10-29 15:22:28,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725889909] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-29 15:22:28,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-29 15:22:28,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-10-29 15:22:28,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980975212]
[2024-10-29 15:22:28,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-29 15:22:28,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-10-29 15:22:28,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-29 15:22:28,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-10-29 15:22:28,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-10-29 15:22:28,604 INFO L87 Difference]: Start difference. First operand 1106 states and 2113 transitions. Second operand has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 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:22:28,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-29 15:22:28,917 INFO L93 Difference]: Finished difference Result 1346 states and 2577 transitions.
[2024-10-29 15:22:28,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-10-29 15:22:28,918 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 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 44
[2024-10-29 15:22:28,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-29 15:22:28,929 INFO L225 Difference]: With dead ends: 1346
[2024-10-29 15:22:28,929 INFO L226 Difference]: Without dead ends: 1310
[2024-10-29 15:22:28,932 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-10-29 15:22:28,933 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 128 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-10-29 15:22:28,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 336 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-10-29 15:22:28,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1310 states.
[2024-10-29 15:22:28,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1310 to 1214.
[2024-10-29 15:22:28,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1214 states, 1199 states have (on average 1.9441201000834027) internal successors, (2331), 1213 states have internal predecessors, (2331), 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:22:28,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 2331 transitions.
[2024-10-29 15:22:28,971 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 2331 transitions. Word has length 44
[2024-10-29 15:22:28,972 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-29 15:22:28,972 INFO L471 AbstractCegarLoop]: Abstraction has 1214 states and 2331 transitions.
[2024-10-29 15:22:28,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 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:22:28,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 2331 transitions.
[2024-10-29 15:22:28,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46
[2024-10-29 15:22:28,975 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-29 15:22:28,975 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, 1, 1, 1]
[2024-10-29 15:22:28,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-10-29 15:22:28,976 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-10-29 15:22:28,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-29 15:22:28,976 INFO L85 PathProgramCache]: Analyzing trace with hash 712846405, now seen corresponding path program 1 times
[2024-10-29 15:22:28,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-29 15:22:28,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535736067]
[2024-10-29 15:22:28,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-29 15:22:28,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-29 15:22:29,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-29 15:22:29,343 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:22:29,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-29 15:22:29,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535736067]
[2024-10-29 15:22:29,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535736067] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-29 15:22:29,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-29 15:22:29,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-10-29 15:22:29,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225070054]
[2024-10-29 15:22:29,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-29 15:22:29,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-10-29 15:22:29,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-29 15:22:29,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-10-29 15:22:29,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-10-29 15:22:29,348 INFO L87 Difference]: Start difference. First operand 1214 states and 2331 transitions. Second operand has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 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:22:29,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-29 15:22:29,658 INFO L93 Difference]: Finished difference Result 2084 states and 3995 transitions.
[2024-10-29 15:22:29,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-10-29 15:22:29,659 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 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 45
[2024-10-29 15:22:29,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-29 15:22:29,668 INFO L225 Difference]: With dead ends: 2084
[2024-10-29 15:22:29,668 INFO L226 Difference]: Without dead ends: 2049
[2024-10-29 15:22:29,670 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-10-29 15:22:29,671 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 156 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-10-29 15:22:29,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 396 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-10-29 15:22:29,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2049 states.
[2024-10-29 15:22:29,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2049 to 1289.
[2024-10-29 15:22:29,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1289 states, 1274 states have (on average 1.944270015698587) internal successors, (2477), 1288 states have internal predecessors, (2477), 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:22:29,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 2477 transitions.
[2024-10-29 15:22:29,705 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 2477 transitions. Word has length 45
[2024-10-29 15:22:29,705 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-29 15:22:29,705 INFO L471 AbstractCegarLoop]: Abstraction has 1289 states and 2477 transitions.
[2024-10-29 15:22:29,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 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:22:29,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 2477 transitions.
[2024-10-29 15:22:29,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48
[2024-10-29 15:22:29,707 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-29 15:22:29,707 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, 1, 1, 1, 1, 1]
[2024-10-29 15:22:29,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-10-29 15:22:29,708 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-10-29 15:22:29,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-29 15:22:29,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1071308684, now seen corresponding path program 1 times
[2024-10-29 15:22:29,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-29 15:22:29,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365140153]
[2024-10-29 15:22:29,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-29 15:22:29,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-29 15:22:29,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-29 15:22:29,738 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:22:29,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-29 15:22:29,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365140153]
[2024-10-29 15:22:29,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365140153] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-29 15:22:29,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-29 15:22:29,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-10-29 15:22:29,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373086428]
[2024-10-29 15:22:29,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-29 15:22:29,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-29 15:22:29,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-29 15:22:29,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-29 15:22:29,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-29 15:22:29,741 INFO L87 Difference]: Start difference. First operand 1289 states and 2477 transitions. Second operand has 3 states, 2 states have (on average 23.5) internal successors, (47), 3 states have internal predecessors, (47), 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:22:29,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-29 15:22:29,768 INFO L93 Difference]: Finished difference Result 1289 states and 2477 transitions.
[2024-10-29 15:22:29,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-10-29 15:22:29,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 23.5) internal successors, (47), 3 states have internal predecessors, (47), 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 47
[2024-10-29 15:22:29,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-29 15:22:29,776 INFO L225 Difference]: With dead ends: 1289
[2024-10-29 15:22:29,776 INFO L226 Difference]: Without dead ends: 1215
[2024-10-29 15:22:29,777 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:22:29,778 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 61 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-10-29 15:22:29,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 179 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-10-29 15:22:29,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states.
[2024-10-29 15:22:29,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 1215.
[2024-10-29 15:22:29,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1215 states, 1207 states have (on average 1.9312344656172329) internal successors, (2331), 1214 states have internal predecessors, (2331), 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:22:29,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 1215 states and 2331 transitions.
[2024-10-29 15:22:29,806 INFO L78 Accepts]: Start accepts. Automaton has 1215 states and 2331 transitions. Word has length 47
[2024-10-29 15:22:29,807 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-29 15:22:29,807 INFO L471 AbstractCegarLoop]: Abstraction has 1215 states and 2331 transitions.
[2024-10-29 15:22:29,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 23.5) internal successors, (47), 3 states have internal predecessors, (47), 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:22:29,807 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 2331 transitions.
[2024-10-29 15:22:29,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54
[2024-10-29 15:22:29,809 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-29 15:22:29,809 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-29 15:22:29,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-10-29 15:22:29,809 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-10-29 15:22:29,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-29 15:22:29,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1174879901, now seen corresponding path program 1 times
[2024-10-29 15:22:29,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-29 15:22:29,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793490210]
[2024-10-29 15:22:29,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-29 15:22:29,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-29 15:22:29,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-29 15:22:29,884 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:22:29,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-29 15:22:29,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793490210]
[2024-10-29 15:22:29,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793490210] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-29 15:22:29,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-29 15:22:29,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-10-29 15:22:29,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086921148]
[2024-10-29 15:22:29,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-29 15:22:29,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-29 15:22:29,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-29 15:22:29,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-29 15:22:29,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-29 15:22:29,886 INFO L87 Difference]: Start difference. First operand 1215 states and 2331 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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:22:29,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-29 15:22:29,909 INFO L93 Difference]: Finished difference Result 1771 states and 3380 transitions.
[2024-10-29 15:22:29,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-10-29 15:22:29,910 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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 53
[2024-10-29 15:22:29,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-29 15:22:29,914 INFO L225 Difference]: With dead ends: 1771
[2024-10-29 15:22:29,915 INFO L226 Difference]: Without dead ends: 737
[2024-10-29 15:22:29,917 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:22:29,917 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 55 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-10-29 15:22:29,918 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 160 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-10-29 15:22:29,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states.
[2024-10-29 15:22:29,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 737.
[2024-10-29 15:22:29,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 737 states, 731 states have (on average 1.8303693570451436) internal successors, (1338), 736 states have internal predecessors, (1338), 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:22:29,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1338 transitions.
[2024-10-29 15:22:29,933 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1338 transitions. Word has length 53
[2024-10-29 15:22:29,933 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-29 15:22:29,933 INFO L471 AbstractCegarLoop]: Abstraction has 737 states and 1338 transitions.
[2024-10-29 15:22:29,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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:22:29,933 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1338 transitions.
[2024-10-29 15:22:29,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55
[2024-10-29 15:22:29,934 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-29 15:22:29,934 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-29 15:22:29,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-10-29 15:22:29,935 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-10-29 15:22:29,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-29 15:22:29,935 INFO L85 PathProgramCache]: Analyzing trace with hash 793310716, now seen corresponding path program 1 times
[2024-10-29 15:22:29,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-29 15:22:29,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972110300]
[2024-10-29 15:22:29,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-29 15:22:29,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-29 15:22:29,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-29 15:22:30,159 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:22:30,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-29 15:22:30,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972110300]
[2024-10-29 15:22:30,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972110300] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-29 15:22:30,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-29 15:22:30,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-10-29 15:22:30,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461690316]
[2024-10-29 15:22:30,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-29 15:22:30,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-10-29 15:22:30,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-29 15:22:30,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-10-29 15:22:30,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-10-29 15:22:30,162 INFO L87 Difference]: Start difference. First operand 737 states and 1338 transitions. Second operand has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 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:22:30,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-29 15:22:30,294 INFO L93 Difference]: Finished difference Result 868 states and 1573 transitions.
[2024-10-29 15:22:30,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-10-29 15:22:30,294 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 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 54
[2024-10-29 15:22:30,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-29 15:22:30,309 INFO L225 Difference]: With dead ends: 868
[2024-10-29 15:22:30,310 INFO L226 Difference]: Without dead ends: 672
[2024-10-29 15:22:30,311 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-10-29 15:22:30,312 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 74 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-10-29 15:22:30,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 277 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-10-29 15:22:30,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states.
[2024-10-29 15:22:30,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 631.
[2024-10-29 15:22:30,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 626 states have (on average 1.7875399361022364) internal successors, (1119), 630 states have internal predecessors, (1119), 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:22:30,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 1119 transitions.
[2024-10-29 15:22:30,327 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 1119 transitions. Word has length 54
[2024-10-29 15:22:30,327 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-29 15:22:30,328 INFO L471 AbstractCegarLoop]: Abstraction has 631 states and 1119 transitions.
[2024-10-29 15:22:30,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 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:22:30,328 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 1119 transitions.
[2024-10-29 15:22:30,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59
[2024-10-29 15:22:30,329 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-29 15:22:30,329 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-29 15:22:30,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-10-29 15:22:30,329 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-10-29 15:22:30,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-29 15:22:30,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1221870245, now seen corresponding path program 1 times
[2024-10-29 15:22:30,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-29 15:22:30,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244836682]
[2024-10-29 15:22:30,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-29 15:22:30,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-29 15:22:30,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-29 15:22:30,584 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:22:30,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-29 15:22:30,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244836682]
[2024-10-29 15:22:30,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244836682] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-29 15:22:30,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-29 15:22:30,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-10-29 15:22:30,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369120219]
[2024-10-29 15:22:30,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-29 15:22:30,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-10-29 15:22:30,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-29 15:22:30,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-10-29 15:22:30,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-10-29 15:22:30,586 INFO L87 Difference]: Start difference. First operand 631 states and 1119 transitions. Second operand has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 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:22:30,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-29 15:22:30,792 INFO L93 Difference]: Finished difference Result 874 states and 1523 transitions.
[2024-10-29 15:22:30,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-10-29 15:22:30,793 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 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 58
[2024-10-29 15:22:30,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-29 15:22:30,797 INFO L225 Difference]: With dead ends: 874
[2024-10-29 15:22:30,798 INFO L226 Difference]: Without dead ends: 628
[2024-10-29 15:22:30,799 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-10-29 15:22:30,799 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 118 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-10-29 15:22:30,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 337 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-10-29 15:22:30,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states.
[2024-10-29 15:22:30,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 511.
[2024-10-29 15:22:30,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 506 states have (on average 1.7806324110671936) internal successors, (901), 510 states have internal predecessors, (901), 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:22:30,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 901 transitions.
[2024-10-29 15:22:30,815 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 901 transitions. Word has length 58
[2024-10-29 15:22:30,816 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-29 15:22:30,816 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 901 transitions.
[2024-10-29 15:22:30,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 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:22:30,816 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 901 transitions.
[2024-10-29 15:22:30,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67
[2024-10-29 15:22:30,818 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-29 15:22:30,818 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, 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:22:30,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-10-29 15:22:30,818 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-10-29 15:22:30,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-29 15:22:30,818 INFO L85 PathProgramCache]: Analyzing trace with hash -89200273, now seen corresponding path program 1 times
[2024-10-29 15:22:30,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-29 15:22:30,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446836581]
[2024-10-29 15:22:30,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-29 15:22:30,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-29 15:22:30,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-29 15:22:31,290 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:22:31,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-29 15:22:31,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446836581]
[2024-10-29 15:22:31,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446836581] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-29 15:22:31,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-29 15:22:31,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2024-10-29 15:22:31,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336820463]
[2024-10-29 15:22:31,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-29 15:22:31,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-10-29 15:22:31,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-29 15:22:31,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-10-29 15:22:31,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110
[2024-10-29 15:22:31,293 INFO L87 Difference]: Start difference. First operand 511 states and 901 transitions. Second operand has 11 states, 10 states have (on average 6.6) internal successors, (66), 11 states have internal predecessors, (66), 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:22:31,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-29 15:22:31,744 INFO L93 Difference]: Finished difference Result 610 states and 1042 transitions.
[2024-10-29 15:22:31,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2024-10-29 15:22:31,745 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.6) internal successors, (66), 11 states have internal predecessors, (66), 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 66
[2024-10-29 15:22:31,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-29 15:22:31,749 INFO L225 Difference]: With dead ends: 610
[2024-10-29 15:22:31,750 INFO L226 Difference]: Without dead ends: 585
[2024-10-29 15:22:31,750 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342
[2024-10-29 15:22:31,751 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 260 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-10-29 15:22:31,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 539 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-10-29 15:22:31,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states.
[2024-10-29 15:22:31,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 453.
[2024-10-29 15:22:31,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 449 states have (on average 1.7616926503340757) internal successors, (791), 452 states have internal predecessors, (791), 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:22:31,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 791 transitions.
[2024-10-29 15:22:31,765 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 791 transitions. Word has length 66
[2024-10-29 15:22:31,765 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-29 15:22:31,765 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 791 transitions.
[2024-10-29 15:22:31,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.6) internal successors, (66), 11 states have internal predecessors, (66), 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:22:31,766 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 791 transitions.
[2024-10-29 15:22:31,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67
[2024-10-29 15:22:31,766 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-29 15:22:31,766 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, 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:22:31,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-10-29 15:22:31,767 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-10-29 15:22:31,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-29 15:22:31,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1078061010, now seen corresponding path program 1 times
[2024-10-29 15:22:31,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-29 15:22:31,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276043014]
[2024-10-29 15:22:31,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-29 15:22:31,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-29 15:22:31,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-29 15:22:32,231 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:22:32,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-29 15:22:32,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276043014]
[2024-10-29 15:22:32,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276043014] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-29 15:22:32,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-29 15:22:32,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2024-10-29 15:22:32,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751939933]
[2024-10-29 15:22:32,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-29 15:22:32,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-10-29 15:22:32,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-29 15:22:32,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-10-29 15:22:32,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2024-10-29 15:22:32,235 INFO L87 Difference]: Start difference. First operand 453 states and 791 transitions. Second operand has 11 states, 10 states have (on average 6.6) internal successors, (66), 11 states have internal predecessors, (66), 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:22:32,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-29 15:22:32,544 INFO L93 Difference]: Finished difference Result 453 states and 791 transitions.
[2024-10-29 15:22:32,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2024-10-29 15:22:32,545 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.6) internal successors, (66), 11 states have internal predecessors, (66), 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 66
[2024-10-29 15:22:32,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-29 15:22:32,549 INFO L225 Difference]: With dead ends: 453
[2024-10-29 15:22:32,549 INFO L226 Difference]: Without dead ends: 414
[2024-10-29 15:22:32,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342
[2024-10-29 15:22:32,550 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 187 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-10-29 15:22:32,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 444 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-10-29 15:22:32,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states.
[2024-10-29 15:22:32,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 398.
[2024-10-29 15:22:32,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 395 states have (on average 1.7544303797468355) internal successors, (693), 397 states have internal predecessors, (693), 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:22:32,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 693 transitions.
[2024-10-29 15:22:32,560 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 693 transitions. Word has length 66
[2024-10-29 15:22:32,560 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-29 15:22:32,560 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 693 transitions.
[2024-10-29 15:22:32,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.6) internal successors, (66), 11 states have internal predecessors, (66), 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:22:32,561 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 693 transitions.
[2024-10-29 15:22:32,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77
[2024-10-29 15:22:32,562 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-29 15:22:32,562 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:32,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-10-29 15:22:32,562 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-10-29 15:22:32,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-29 15:22:32,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1287776023, now seen corresponding path program 1 times
[2024-10-29 15:22:32,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-29 15:22:32,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19661752]
[2024-10-29 15:22:32,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-29 15:22:32,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-29 15:22:32,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-29 15:22:32,587 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-29 15:22:32,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-29 15:22:32,646 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-10-29 15:22:32,647 INFO L325 BasicCegarLoop]: Counterexample is feasible
[2024-10-29 15:22:32,648 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (14 of 15 remaining)
[2024-10-29 15:22:32,649 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining)
[2024-10-29 15:22:32,649 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining)
[2024-10-29 15:22:32,650 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining)
[2024-10-29 15:22:32,650 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining)
[2024-10-29 15:22:32,650 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining)
[2024-10-29 15:22:32,650 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 15 remaining)
[2024-10-29 15:22:32,650 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining)
[2024-10-29 15:22:32,651 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining)
[2024-10-29 15:22:32,651 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining)
[2024-10-29 15:22:32,651 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining)
[2024-10-29 15:22:32,651 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining)
[2024-10-29 15:22:32,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining)
[2024-10-29 15:22:32,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining)
[2024-10-29 15:22:32,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining)
[2024-10-29 15:22:32,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-10-29 15:22:32,655 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-29 15:22:32,724 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2024-10-29 15:22:32,724 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-10-29 15:22:32,729 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.10 03:22:32 BasicIcfg
[2024-10-29 15:22:32,729 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-10-29 15:22:32,730 INFO L158 Benchmark]: Toolchain (without parser) took 7527.73ms. Allocated memory was 172.0MB in the beginning and 281.0MB in the end (delta: 109.1MB). Free memory was 111.7MB in the beginning and 181.5MB in the end (delta: -69.8MB). Peak memory consumption was 43.1MB. Max. memory is 16.1GB.
[2024-10-29 15:22:32,730 INFO L158 Benchmark]: Witness Parser took 0.20ms. Allocated memory is still 130.0MB. Free memory is still 98.9MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-10-29 15:22:32,730 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 130.0MB. Free memory was 96.8MB in the beginning and 96.6MB in the end (delta: 176.2kB). There was no memory consumed. Max. memory is 16.1GB.
[2024-10-29 15:22:32,731 INFO L158 Benchmark]: CACSL2BoogieTranslator took 800.78ms. Allocated memory is still 172.0MB. Free memory was 111.7MB in the beginning and 136.9MB in the end (delta: -25.1MB). Peak memory consumption was 56.3MB. Max. memory is 16.1GB.
[2024-10-29 15:22:32,731 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.80ms. Allocated memory is still 172.0MB. Free memory was 136.9MB in the beginning and 133.6MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2024-10-29 15:22:32,731 INFO L158 Benchmark]: Boogie Preprocessor took 52.69ms. Allocated memory is still 172.0MB. Free memory was 133.6MB in the beginning and 132.7MB in the end (delta: 948.0kB). There was no memory consumed. Max. memory is 16.1GB.
[2024-10-29 15:22:32,731 INFO L158 Benchmark]: RCFGBuilder took 477.54ms. Allocated memory is still 172.0MB. Free memory was 132.7MB in the beginning and 113.8MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB.
[2024-10-29 15:22:32,731 INFO L158 Benchmark]: TraceAbstraction took 6114.21ms. Allocated memory was 172.0MB in the beginning and 281.0MB in the end (delta: 109.1MB). Free memory was 113.8MB in the beginning and 181.5MB in the end (delta: -67.7MB). Peak memory consumption was 43.5MB. Max. memory is 16.1GB.
[2024-10-29 15:22:32,733 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* Witness Parser took 0.20ms. Allocated memory is still 130.0MB. Free memory is still 98.9MB. There was no memory consumed. Max. memory is 16.1GB.
* CDTParser took 0.18ms. Allocated memory is still 130.0MB. Free memory was 96.8MB in the beginning and 96.6MB in the end (delta: 176.2kB). There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 800.78ms. Allocated memory is still 172.0MB. Free memory was 111.7MB in the beginning and 136.9MB in the end (delta: -25.1MB). Peak memory consumption was 56.3MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 76.80ms. Allocated memory is still 172.0MB. Free memory was 136.9MB in the beginning and 133.6MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 52.69ms. Allocated memory is still 172.0MB. Free memory was 133.6MB in the beginning and 132.7MB in the end (delta: 948.0kB). There was no memory consumed. Max. memory is 16.1GB.
* RCFGBuilder took 477.54ms. Allocated memory is still 172.0MB. Free memory was 132.7MB in the beginning and 113.8MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB.
* TraceAbstraction took 6114.21ms. Allocated memory was 172.0MB in the beginning and 281.0MB in the end (delta: 109.1MB). Free memory was 113.8MB in the beginning and 181.5MB in the end (delta: -67.7MB). Peak memory consumption was 43.5MB. 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
- DataRaceFoundResult [Line: 1241]: Data race detected
Data race detected
The following path leads to a data race:
[L1223] 0 int *x;
VAL [x={0:0}]
[L1224] 0 int *y;
VAL [x={0:0}, y={0:0}]
[L1225] 0 pthread_mutex_t m = { { 0, 0, 0, 0, 0, { { 0, 0 } } } };
VAL [m={1:0}, x={0:0}, y={0:0}]
[L1234] 0 pthread_t id;
VAL [m={1:0}, x={0:0}, y={0:0}]
[L1235] 0 x = malloc(sizeof(int))
VAL [m={1:0}, x={-2:0}, y={0:0}]
[L1236] 0 y = malloc(sizeof(int))
VAL [m={1:0}, x={-2:0}, y={-3:0}]
[L1237] FCALL, FORK 0 pthread_create(&id, ((void *)0), t_fun, ((void *)0))
VAL [\old(arg)={0:0}, id=-1, m={1:0}, x={-2:0}, y={-3:0}]
[L1239] EXPR 0 *x
VAL [\old(arg)={0:0}, arg={0:0}, id=-1, m={1:0}, x={-2:0}, y={-3:0}]
[L1239] EXPR 0 \read(*x)
VAL [\old(arg)={0:0}, arg={0:0}, id=-1, m={1:0}, x={-2:0}, y={-3:0}]
[L1239] 0 printf("%d\n",*x)
VAL [\old(arg)={0:0}, arg={0:0}, id=-1, m={1:0}, x={-2:0}, y={-3:0}]
[L1241] EXPR 0 *y
VAL [\old(arg)={0:0}, arg={0:0}, id=-1, m={1:0}, x={-2:0}, y={-3:0}]
[L1241] EXPR 0 \read(*y)
VAL [\old(arg)={0:0}, arg={0:0}, id=-1, m={1:0}, x={-2:0}, y={-3:0}]
[L1228] EXPR 1 *x
VAL [\old(arg)={0:0}, arg={0:0}, m={1:0}, x={-2:0}, y={-3:0}]
[L1228] 1 *x = 3
VAL [\old(arg)={0:0}, arg={0:0}, m={1:0}, x={-2:0}, y={-3:0}]
[L1229] EXPR 1 *y
VAL [\old(arg)={0:0}, arg={0:0}, m={1:0}, x={-2:0}, y={-3:0}]
[L1229] 1 *y = 8
VAL [\old(arg)={0:0}, arg={0:0}, m={1:0}, x={-2:0}, y={-3:0}]
[L1241] 0 printf("%d\n",*y)
VAL [\old(arg)={0:0}, arg={0:0}, id=-1, m={1:0}, x={-2:0}, y={-3:0}]
Now there is a data race, but we were unable to determine exactly which statements and variables are involved. There could be a race between one of the statements
* C: y = malloc(sizeof(int)) [1236]
* C: *x = 3 [1228]
* C: *x = 3 [1228]
* C: *x = 3 [1228]
* C: x = malloc(sizeof(int)) [1235]
* C: *x = 3 [1228]
* C: *y = 8 [1229]
and
C: printf("%d\n",*y) [1241]
- UnprovableResult [Line: 1235]: Unable to prove that there are no data races
Unable to prove that there are no data races
Reason: Not analyzed.
- UnprovableResult [Line: 1236]: Unable to prove that there are no data races
Unable to prove that there are no data races
Reason: Not analyzed.
- UnprovableResult [Line: 1239]: Unable to prove that there are no data races
Unable to prove that there are no data races
Reason: Not analyzed.
- UnprovableResult [Line: 1239]: Unable to prove that there are no data races
Unable to prove that there are no data races
Reason: Not analyzed.
- UnprovableResult [Line: 1241]: Unable to prove that there are no data races
Unable to prove that there are no data races
Reason: Not analyzed.
- UnprovableResult [Line: 1237]: 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: 1228]: Unable to prove that there are no data races
Unable to prove that there are no data races
Reason: Not analyzed.
- UnprovableResult [Line: 1228]: Unable to prove that there are no data races
Unable to prove that there are no data races
Reason: Not analyzed.
- UnprovableResult [Line: 1229]: Unable to prove that there are no data races
Unable to prove that there are no data races
Reason: Not analyzed.
- UnprovableResult [Line: 1229]: Unable to prove that there are no data races
Unable to prove that there are no data races
Reason: Not analyzed.
- StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
CFG has 3 procedures, 136 locations, 15 error locations. Started 1 CEGAR loops. OverallTime: 5.9s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1106 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1106 mSDsluCounter, 3151 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1913 mSDsCounter, 155 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1738 IncrementalHoareTripleChecker+Invalid, 1893 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 155 mSolverCounterUnsat, 1238 mSDtfsCounter, 1738 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1289occurred in iteration=5, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 1162 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 591 NumberOfCodeBlocks, 591 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 504 ConstructedInterpolants, 0 QuantifiedInterpolants, 1593 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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:22:32,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---
Execution finished normally
Writing output log to file Ultimate.log
Writing human readable error path to file UltimateCounterExample.errorpath
Result:
FALSE