/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_94-alloc_region_racing.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 08:12:37,476 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 08:12:37,539 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-26 08:12:37,542 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 08:12:37,543 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 08:12:37,569 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 08:12:37,570 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 08:12:37,570 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 08:12:37,571 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 08:12:37,573 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 08:12:37,574 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 08:12:37,574 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 08:12:37,574 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 08:12:37,575 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 08:12:37,575 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 08:12:37,575 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 08:12:37,575 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 08:12:37,575 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 08:12:37,576 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 08:12:37,576 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 08:12:37,576 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 08:12:37,576 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 08:12:37,577 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 08:12:37,577 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 08:12:37,577 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 08:12:37,577 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 08:12:37,577 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 08:12:37,578 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 08:12:37,578 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 08:12:37,578 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 08:12:37,579 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 08:12:37,579 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 08:12:37,579 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 08:12:37,579 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 08:12:37,579 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 08:12:37,579 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC 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.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true [2023-08-26 08:12:37,808 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 08:12:37,819 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 08:12:37,821 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 08:12:37,822 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 08:12:37,822 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 08:12:37,823 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_94-alloc_region_racing.i [2023-08-26 08:12:38,707 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 08:12:38,916 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 08:12:38,916 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_94-alloc_region_racing.i [2023-08-26 08:12:38,927 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c350dcd91/a038a069f1c545b1ac342571cb9d9b40/FLAGebd84bef7 [2023-08-26 08:12:38,935 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c350dcd91/a038a069f1c545b1ac342571cb9d9b40 [2023-08-26 08:12:38,937 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 08:12:38,937 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 08:12:38,938 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 08:12:38,938 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 08:12:38,940 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 08:12:38,940 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 08:12:38" (1/1) ... [2023-08-26 08:12:38,941 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26931877 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:12:38, skipping insertion in model container [2023-08-26 08:12:38,941 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 08:12:38" (1/1) ... [2023-08-26 08:12:38,977 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 08:12:39,405 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 08:12:39,417 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 08:12:39,436 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [244] [2023-08-26 08:12:39,438 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [244] [2023-08-26 08:12:39,448 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned short [1044] [2023-08-26 08:12:39,473 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 08:12:39,540 INFO L206 MainTranslator]: Completed translation [2023-08-26 08:12:39,540 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:12:39 WrapperNode [2023-08-26 08:12:39,540 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 08:12:39,541 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 08:12:39,541 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 08:12:39,541 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 08:12:39,545 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:12:39" (1/1) ... [2023-08-26 08:12:39,573 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:12:39" (1/1) ... [2023-08-26 08:12:39,622 INFO L138 Inliner]: procedures = 377, calls = 73, calls flagged for inlining = 10, calls inlined = 11, statements flattened = 416 [2023-08-26 08:12:39,623 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 08:12:39,623 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 08:12:39,623 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 08:12:39,623 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 08:12:39,629 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:12:39" (1/1) ... [2023-08-26 08:12:39,629 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:12:39" (1/1) ... [2023-08-26 08:12:39,640 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:12:39" (1/1) ... [2023-08-26 08:12:39,641 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:12:39" (1/1) ... [2023-08-26 08:12:39,667 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:12:39" (1/1) ... [2023-08-26 08:12:39,671 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:12:39" (1/1) ... [2023-08-26 08:12:39,684 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:12:39" (1/1) ... [2023-08-26 08:12:39,686 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:12:39" (1/1) ... [2023-08-26 08:12:39,691 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 08:12:39,692 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 08:12:39,692 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 08:12:39,692 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 08:12:39,693 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:12:39" (1/1) ... [2023-08-26 08:12:39,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 08:12:39,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 08:12:39,711 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-26 08:12:39,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-26 08:12:39,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 08:12:39,732 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-08-26 08:12:39,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 08:12:39,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-08-26 08:12:39,733 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 08:12:39,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 08:12:39,733 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-26 08:12:39,733 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-26 08:12:39,733 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 08:12:39,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-08-26 08:12:39,733 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-08-26 08:12:39,733 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-08-26 08:12:39,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 08:12:39,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 08:12:39,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 08:12:39,735 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 08:12:39,830 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 08:12:39,832 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 08:12:40,295 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 08:12:40,308 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 08:12:40,308 INFO L302 CfgBuilder]: Removed 23 assume(true) statements. [2023-08-26 08:12:40,316 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 08:12:40 BoogieIcfgContainer [2023-08-26 08:12:40,316 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 08:12:40,318 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 08:12:40,318 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 08:12:40,320 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 08:12:40,320 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 08:12:38" (1/3) ... [2023-08-26 08:12:40,321 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@be008a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 08:12:40, skipping insertion in model container [2023-08-26 08:12:40,321 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:12:39" (2/3) ... [2023-08-26 08:12:40,322 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@be008a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 08:12:40, skipping insertion in model container [2023-08-26 08:12:40,322 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 08:12:40" (3/3) ... [2023-08-26 08:12:40,323 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_94-alloc_region_racing.i [2023-08-26 08:12:40,335 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 08:12:40,336 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2023-08-26 08:12:40,336 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 08:12:40,418 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-08-26 08:12:40,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 420 places, 448 transitions, 904 flow [2023-08-26 08:12:40,577 INFO L124 PetriNetUnfolderBase]: 48/653 cut-off events. [2023-08-26 08:12:40,577 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-26 08:12:40,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 659 conditions, 653 events. 48/653 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2140 event pairs, 0 based on Foata normal form. 0/557 useless extension candidates. Maximal degree in co-relation 364. Up to 8 conditions per place. [2023-08-26 08:12:40,586 INFO L82 GeneralOperation]: Start removeDead. Operand has 420 places, 448 transitions, 904 flow [2023-08-26 08:12:40,593 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 420 places, 448 transitions, 904 flow [2023-08-26 08:12:40,595 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 08:12:40,601 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 420 places, 448 transitions, 904 flow [2023-08-26 08:12:40,602 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 420 places, 448 transitions, 904 flow [2023-08-26 08:12:40,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 420 places, 448 transitions, 904 flow [2023-08-26 08:12:40,700 INFO L124 PetriNetUnfolderBase]: 48/653 cut-off events. [2023-08-26 08:12:40,701 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-26 08:12:40,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 659 conditions, 653 events. 48/653 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2140 event pairs, 0 based on Foata normal form. 0/557 useless extension candidates. Maximal degree in co-relation 364. Up to 8 conditions per place. [2023-08-26 08:12:40,725 INFO L119 LiptonReduction]: Number of co-enabled transitions 64988 [2023-08-26 08:13:10,609 WARN L234 SmtUtils]: Spent 16.59s on a formula simplification. DAG size of input: 256 DAG size of output: 254 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-26 08:13:26,897 WARN L234 SmtUtils]: Spent 14.19s on a formula simplification. DAG size of input: 256 DAG size of output: 254 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-26 08:13:28,313 INFO L134 LiptonReduction]: Checked pairs total: 416492 [2023-08-26 08:13:28,314 INFO L136 LiptonReduction]: Total number of compositions: 267 [2023-08-26 08:13:28,329 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 08:13:28,333 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@2a6c76ab, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 08:13:28,333 INFO L358 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2023-08-26 08:13:28,334 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 08:13:28,334 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 08:13:28,334 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 08:13:28,334 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:13:28,334 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 08:13:28,335 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [t_funErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 38 more)] === [2023-08-26 08:13:28,338 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:13:28,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1473, now seen corresponding path program 1 times [2023-08-26 08:13:28,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:13:28,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28811795] [2023-08-26 08:13:28,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:13:28,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:13:28,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:13:28,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 08:13:28,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 08:13:28,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28811795] [2023-08-26 08:13:28,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28811795] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 08:13:28,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 08:13:28,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 08:13:28,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195016607] [2023-08-26 08:13:28,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 08:13:28,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 08:13:28,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 08:13:28,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 08:13:28,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 08:13:28,435 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 417 out of 715 [2023-08-26 08:13:28,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 236 transitions, 480 flow. Second operand has 2 states, 2 states have (on average 417.5) internal successors, (835), 2 states have internal predecessors, (835), 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) [2023-08-26 08:13:28,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 08:13:28,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 417 of 715 [2023-08-26 08:13:28,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 08:13:28,974 INFO L124 PetriNetUnfolderBase]: 1241/4934 cut-off events. [2023-08-26 08:13:28,974 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-26 08:13:28,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7363 conditions, 4934 events. 1241/4934 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 39924 event pairs, 1140 based on Foata normal form. 275/4731 useless extension candidates. Maximal degree in co-relation 7190. Up to 2422 conditions per place. [2023-08-26 08:13:28,989 INFO L140 encePairwiseOnDemand]: 688/715 looper letters, 73 selfloop transitions, 0 changer transitions 0/209 dead transitions. [2023-08-26 08:13:28,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 209 transitions, 572 flow [2023-08-26 08:13:28,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 08:13:28,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 08:13:28,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 934 transitions. [2023-08-26 08:13:29,000 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6531468531468532 [2023-08-26 08:13:29,001 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 934 transitions. [2023-08-26 08:13:29,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 934 transitions. [2023-08-26 08:13:29,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 08:13:29,004 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 934 transitions. [2023-08-26 08:13:29,007 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 467.0) internal successors, (934), 2 states have internal predecessors, (934), 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) [2023-08-26 08:13:29,011 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 715.0) internal successors, (2145), 3 states have internal predecessors, (2145), 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) [2023-08-26 08:13:29,012 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 715.0) internal successors, (2145), 3 states have internal predecessors, (2145), 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) [2023-08-26 08:13:29,013 INFO L175 Difference]: Start difference. First operand has 212 places, 236 transitions, 480 flow. Second operand 2 states and 934 transitions. [2023-08-26 08:13:29,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 209 transitions, 572 flow [2023-08-26 08:13:29,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 209 transitions, 572 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 08:13:29,019 INFO L231 Difference]: Finished difference. Result has 209 places, 209 transitions, 426 flow [2023-08-26 08:13:29,020 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=715, PETRI_DIFFERENCE_MINUEND_FLOW=426, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=426, PETRI_PLACES=209, PETRI_TRANSITIONS=209} [2023-08-26 08:13:29,022 INFO L281 CegarLoopForPetriNet]: 212 programPoint places, -3 predicate places. [2023-08-26 08:13:29,022 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 209 transitions, 426 flow [2023-08-26 08:13:29,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 417.5) internal successors, (835), 2 states have internal predecessors, (835), 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) [2023-08-26 08:13:29,023 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:13:29,023 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 08:13:29,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 08:13:29,023 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [t_funErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 38 more)] === [2023-08-26 08:13:29,024 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:13:29,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1614536519, now seen corresponding path program 1 times [2023-08-26 08:13:29,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:13:29,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669444706] [2023-08-26 08:13:29,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:13:29,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:13:29,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:13:29,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 08:13:29,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 08:13:29,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669444706] [2023-08-26 08:13:29,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669444706] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 08:13:29,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 08:13:29,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 08:13:29,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708835427] [2023-08-26 08:13:29,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 08:13:29,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 08:13:29,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 08:13:29,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 08:13:29,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 08:13:29,167 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 409 out of 715 [2023-08-26 08:13:29,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 209 transitions, 426 flow. Second operand has 3 states, 3 states have (on average 410.0) internal successors, (1230), 3 states have internal predecessors, (1230), 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) [2023-08-26 08:13:29,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 08:13:29,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 409 of 715 [2023-08-26 08:13:29,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 08:13:29,580 INFO L124 PetriNetUnfolderBase]: 1203/4928 cut-off events. [2023-08-26 08:13:29,580 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-26 08:13:29,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7352 conditions, 4928 events. 1203/4928 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 41293 event pairs, 0 based on Foata normal form. 0/4504 useless extension candidates. Maximal degree in co-relation 7348. Up to 2354 conditions per place. [2023-08-26 08:13:29,598 INFO L140 encePairwiseOnDemand]: 712/715 looper letters, 102 selfloop transitions, 2 changer transitions 0/240 dead transitions. [2023-08-26 08:13:29,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 240 transitions, 696 flow [2023-08-26 08:13:29,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 08:13:29,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 08:13:29,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1332 transitions. [2023-08-26 08:13:29,601 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.620979020979021 [2023-08-26 08:13:29,601 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1332 transitions. [2023-08-26 08:13:29,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1332 transitions. [2023-08-26 08:13:29,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 08:13:29,602 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1332 transitions. [2023-08-26 08:13:29,604 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 444.0) internal successors, (1332), 3 states have internal predecessors, (1332), 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) [2023-08-26 08:13:29,606 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 715.0) internal successors, (2860), 4 states have internal predecessors, (2860), 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) [2023-08-26 08:13:29,607 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 715.0) internal successors, (2860), 4 states have internal predecessors, (2860), 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) [2023-08-26 08:13:29,607 INFO L175 Difference]: Start difference. First operand has 209 places, 209 transitions, 426 flow. Second operand 3 states and 1332 transitions. [2023-08-26 08:13:29,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 240 transitions, 696 flow [2023-08-26 08:13:29,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 240 transitions, 696 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 08:13:29,611 INFO L231 Difference]: Finished difference. Result has 212 places, 209 transitions, 434 flow [2023-08-26 08:13:29,612 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=715, PETRI_DIFFERENCE_MINUEND_FLOW=426, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=434, PETRI_PLACES=212, PETRI_TRANSITIONS=209} [2023-08-26 08:13:29,612 INFO L281 CegarLoopForPetriNet]: 212 programPoint places, 0 predicate places. [2023-08-26 08:13:29,612 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 209 transitions, 434 flow [2023-08-26 08:13:29,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 410.0) internal successors, (1230), 3 states have internal predecessors, (1230), 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) [2023-08-26 08:13:29,613 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:13:29,613 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 08:13:29,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 08:13:29,614 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [t_funErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 38 more)] === [2023-08-26 08:13:29,614 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:13:29,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1274288303, now seen corresponding path program 1 times [2023-08-26 08:13:29,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:13:29,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216465915] [2023-08-26 08:13:29,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:13:29,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:13:29,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:13:29,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 08:13:29,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 08:13:29,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216465915] [2023-08-26 08:13:29,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216465915] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 08:13:29,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 08:13:29,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 08:13:29,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669789410] [2023-08-26 08:13:29,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 08:13:29,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 08:13:29,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 08:13:29,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 08:13:29,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 08:13:29,891 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 715 [2023-08-26 08:13:29,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 209 transitions, 434 flow. Second operand has 6 states, 6 states have (on average 244.66666666666666) internal successors, (1468), 6 states have internal predecessors, (1468), 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) [2023-08-26 08:13:29,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 08:13:29,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 715 [2023-08-26 08:13:29,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 08:13:32,230 INFO L124 PetriNetUnfolderBase]: 9307/19163 cut-off events. [2023-08-26 08:13:32,230 INFO L125 PetriNetUnfolderBase]: For 158/158 co-relation queries the response was YES. [2023-08-26 08:13:32,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37799 conditions, 19163 events. 9307/19163 cut-off events. For 158/158 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 131037 event pairs, 8148 based on Foata normal form. 0/16313 useless extension candidates. Maximal degree in co-relation 37793. Up to 17737 conditions per place. [2023-08-26 08:13:32,305 INFO L140 encePairwiseOnDemand]: 653/715 looper letters, 404 selfloop transitions, 229 changer transitions 0/649 dead transitions. [2023-08-26 08:13:32,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 649 transitions, 2600 flow [2023-08-26 08:13:32,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 08:13:32,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 08:13:32,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2092 transitions. [2023-08-26 08:13:32,309 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48764568764568766 [2023-08-26 08:13:32,309 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2092 transitions. [2023-08-26 08:13:32,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2092 transitions. [2023-08-26 08:13:32,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 08:13:32,310 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2092 transitions. [2023-08-26 08:13:32,313 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 348.6666666666667) internal successors, (2092), 6 states have internal predecessors, (2092), 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) [2023-08-26 08:13:32,317 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 715.0) internal successors, (5005), 7 states have internal predecessors, (5005), 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) [2023-08-26 08:13:32,319 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 715.0) internal successors, (5005), 7 states have internal predecessors, (5005), 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) [2023-08-26 08:13:32,319 INFO L175 Difference]: Start difference. First operand has 212 places, 209 transitions, 434 flow. Second operand 6 states and 2092 transitions. [2023-08-26 08:13:32,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 649 transitions, 2600 flow [2023-08-26 08:13:32,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 649 transitions, 2588 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 08:13:32,328 INFO L231 Difference]: Finished difference. Result has 219 places, 437 transitions, 1698 flow [2023-08-26 08:13:32,329 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=715, PETRI_DIFFERENCE_MINUEND_FLOW=430, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1698, PETRI_PLACES=219, PETRI_TRANSITIONS=437} [2023-08-26 08:13:32,329 INFO L281 CegarLoopForPetriNet]: 212 programPoint places, 7 predicate places. [2023-08-26 08:13:32,330 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 437 transitions, 1698 flow [2023-08-26 08:13:32,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 244.66666666666666) internal successors, (1468), 6 states have internal predecessors, (1468), 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) [2023-08-26 08:13:32,331 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:13:32,331 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 08:13:32,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 08:13:32,331 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [t_funErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 38 more)] === [2023-08-26 08:13:32,332 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:13:32,332 INFO L85 PathProgramCache]: Analyzing trace with hash -962464001, now seen corresponding path program 1 times [2023-08-26 08:13:32,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:13:32,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708564687] [2023-08-26 08:13:32,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:13:32,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:13:32,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:13:32,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 08:13:32,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 08:13:32,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708564687] [2023-08-26 08:13:32,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708564687] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 08:13:32,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224306629] [2023-08-26 08:13:32,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:13:32,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 08:13:32,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 08:13:32,426 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 08:13:32,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-26 08:13:32,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:13:32,551 INFO L262 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-26 08:13:32,554 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 08:13:32,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 08:13:32,577 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 08:13:32,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 08:13:32,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [224306629] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 08:13:32,594 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 08:13:32,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-26 08:13:32,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405548648] [2023-08-26 08:13:32,594 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 08:13:32,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 08:13:32,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 08:13:32,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 08:13:32,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-26 08:13:32,598 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 409 out of 715 [2023-08-26 08:13:32,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 437 transitions, 1698 flow. Second operand has 7 states, 7 states have (on average 411.14285714285717) internal successors, (2878), 7 states have internal predecessors, (2878), 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) [2023-08-26 08:13:32,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 08:13:32,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 409 of 715 [2023-08-26 08:13:32,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 08:13:32,684 INFO L124 PetriNetUnfolderBase]: 63/319 cut-off events. [2023-08-26 08:13:32,684 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2023-08-26 08:13:32,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 537 conditions, 319 events. 63/319 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 839 event pairs, 27 based on Foata normal form. 31/331 useless extension candidates. Maximal degree in co-relation 527. Up to 122 conditions per place. [2023-08-26 08:13:32,685 INFO L140 encePairwiseOnDemand]: 712/715 looper letters, 53 selfloop transitions, 2 changer transitions 11/121 dead transitions. [2023-08-26 08:13:32,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 121 transitions, 403 flow [2023-08-26 08:13:32,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 08:13:32,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 08:13:32,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1702 transitions. [2023-08-26 08:13:32,688 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5951048951048951 [2023-08-26 08:13:32,689 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1702 transitions. [2023-08-26 08:13:32,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1702 transitions. [2023-08-26 08:13:32,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 08:13:32,689 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1702 transitions. [2023-08-26 08:13:32,692 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 425.5) internal successors, (1702), 4 states have internal predecessors, (1702), 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) [2023-08-26 08:13:32,695 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 715.0) internal successors, (3575), 5 states have internal predecessors, (3575), 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) [2023-08-26 08:13:32,696 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 715.0) internal successors, (3575), 5 states have internal predecessors, (3575), 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) [2023-08-26 08:13:32,696 INFO L175 Difference]: Start difference. First operand has 219 places, 437 transitions, 1698 flow. Second operand 4 states and 1702 transitions. [2023-08-26 08:13:32,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 121 transitions, 403 flow [2023-08-26 08:13:32,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 121 transitions, 377 flow, removed 0 selfloop flow, removed 10 redundant places. [2023-08-26 08:13:32,698 INFO L231 Difference]: Finished difference. Result has 96 places, 84 transitions, 177 flow [2023-08-26 08:13:32,698 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=715, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=177, PETRI_PLACES=96, PETRI_TRANSITIONS=84} [2023-08-26 08:13:32,699 INFO L281 CegarLoopForPetriNet]: 212 programPoint places, -116 predicate places. [2023-08-26 08:13:32,699 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 84 transitions, 177 flow [2023-08-26 08:13:32,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 411.14285714285717) internal successors, (2878), 7 states have internal predecessors, (2878), 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) [2023-08-26 08:13:32,701 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:13:32,701 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 08:13:32,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-26 08:13:32,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 08:13:32,908 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [t_funErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 38 more)] === [2023-08-26 08:13:32,909 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:13:32,909 INFO L85 PathProgramCache]: Analyzing trace with hash -311803921, now seen corresponding path program 1 times [2023-08-26 08:13:32,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:13:32,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469312579] [2023-08-26 08:13:32,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:13:32,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:13:32,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:13:33,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 08:13:33,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 08:13:33,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469312579] [2023-08-26 08:13:33,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469312579] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 08:13:33,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 08:13:33,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 08:13:33,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943524527] [2023-08-26 08:13:33,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 08:13:33,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 08:13:33,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 08:13:33,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 08:13:33,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 08:13:33,224 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 715 [2023-08-26 08:13:33,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 84 transitions, 177 flow. Second operand has 6 states, 6 states have (on average 245.66666666666666) internal successors, (1474), 6 states have internal predecessors, (1474), 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) [2023-08-26 08:13:33,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 08:13:33,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 715 [2023-08-26 08:13:33,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 08:13:33,389 INFO L124 PetriNetUnfolderBase]: 146/387 cut-off events. [2023-08-26 08:13:33,389 INFO L125 PetriNetUnfolderBase]: For 73/73 co-relation queries the response was YES. [2023-08-26 08:13:33,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 841 conditions, 387 events. 146/387 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 823 event pairs, 138 based on Foata normal form. 0/363 useless extension candidates. Maximal degree in co-relation 836. Up to 351 conditions per place. [2023-08-26 08:13:33,390 INFO L140 encePairwiseOnDemand]: 709/715 looper letters, 80 selfloop transitions, 5 changer transitions 0/91 dead transitions. [2023-08-26 08:13:33,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 91 transitions, 369 flow [2023-08-26 08:13:33,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 08:13:33,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 08:13:33,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1544 transitions. [2023-08-26 08:13:33,393 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3599067599067599 [2023-08-26 08:13:33,393 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1544 transitions. [2023-08-26 08:13:33,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1544 transitions. [2023-08-26 08:13:33,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 08:13:33,394 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1544 transitions. [2023-08-26 08:13:33,396 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 257.3333333333333) internal successors, (1544), 6 states have internal predecessors, (1544), 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) [2023-08-26 08:13:33,400 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 715.0) internal successors, (5005), 7 states have internal predecessors, (5005), 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) [2023-08-26 08:13:33,401 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 715.0) internal successors, (5005), 7 states have internal predecessors, (5005), 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) [2023-08-26 08:13:33,401 INFO L175 Difference]: Start difference. First operand has 96 places, 84 transitions, 177 flow. Second operand 6 states and 1544 transitions. [2023-08-26 08:13:33,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 91 transitions, 369 flow [2023-08-26 08:13:33,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 91 transitions, 362 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 08:13:33,402 INFO L231 Difference]: Finished difference. Result has 93 places, 83 transitions, 182 flow [2023-08-26 08:13:33,403 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=715, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=182, PETRI_PLACES=93, PETRI_TRANSITIONS=83} [2023-08-26 08:13:33,405 INFO L281 CegarLoopForPetriNet]: 212 programPoint places, -119 predicate places. [2023-08-26 08:13:33,405 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 83 transitions, 182 flow [2023-08-26 08:13:33,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 245.66666666666666) internal successors, (1474), 6 states have internal predecessors, (1474), 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) [2023-08-26 08:13:33,406 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:13:33,406 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 08:13:33,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 08:13:33,406 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [t_funErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 38 more)] === [2023-08-26 08:13:33,406 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:13:33,406 INFO L85 PathProgramCache]: Analyzing trace with hash 362846926, now seen corresponding path program 1 times [2023-08-26 08:13:33,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:13:33,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189040109] [2023-08-26 08:13:33,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:13:33,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:13:33,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:13:33,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 08:13:33,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 08:13:33,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189040109] [2023-08-26 08:13:33,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189040109] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 08:13:33,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 08:13:33,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 08:13:33,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811061717] [2023-08-26 08:13:33,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 08:13:33,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 08:13:33,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 08:13:33,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 08:13:33,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 08:13:33,772 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 245 out of 715 [2023-08-26 08:13:33,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 83 transitions, 182 flow. Second operand has 6 states, 6 states have (on average 248.83333333333334) internal successors, (1493), 6 states have internal predecessors, (1493), 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) [2023-08-26 08:13:33,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 08:13:33,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 245 of 715 [2023-08-26 08:13:33,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 08:13:33,898 INFO L124 PetriNetUnfolderBase]: 144/382 cut-off events. [2023-08-26 08:13:33,898 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 08:13:33,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 844 conditions, 382 events. 144/382 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 805 event pairs, 134 based on Foata normal form. 0/361 useless extension candidates. Maximal degree in co-relation 839. Up to 341 conditions per place. [2023-08-26 08:13:33,899 INFO L140 encePairwiseOnDemand]: 709/715 looper letters, 79 selfloop transitions, 5 changer transitions 0/90 dead transitions. [2023-08-26 08:13:33,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 90 transitions, 368 flow [2023-08-26 08:13:33,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 08:13:33,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 08:13:33,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1555 transitions. [2023-08-26 08:13:33,902 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36247086247086246 [2023-08-26 08:13:33,902 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1555 transitions. [2023-08-26 08:13:33,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1555 transitions. [2023-08-26 08:13:33,903 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 08:13:33,903 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1555 transitions. [2023-08-26 08:13:33,905 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 259.1666666666667) internal successors, (1555), 6 states have internal predecessors, (1555), 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) [2023-08-26 08:13:33,909 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 715.0) internal successors, (5005), 7 states have internal predecessors, (5005), 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) [2023-08-26 08:13:33,909 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 715.0) internal successors, (5005), 7 states have internal predecessors, (5005), 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) [2023-08-26 08:13:33,909 INFO L175 Difference]: Start difference. First operand has 93 places, 83 transitions, 182 flow. Second operand 6 states and 1555 transitions. [2023-08-26 08:13:33,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 90 transitions, 368 flow [2023-08-26 08:13:33,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 90 transitions, 358 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-26 08:13:33,911 INFO L231 Difference]: Finished difference. Result has 92 places, 82 transitions, 180 flow [2023-08-26 08:13:33,911 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=715, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=180, PETRI_PLACES=92, PETRI_TRANSITIONS=82} [2023-08-26 08:13:33,911 INFO L281 CegarLoopForPetriNet]: 212 programPoint places, -120 predicate places. [2023-08-26 08:13:33,911 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 82 transitions, 180 flow [2023-08-26 08:13:33,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 248.83333333333334) internal successors, (1493), 6 states have internal predecessors, (1493), 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) [2023-08-26 08:13:33,912 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:13:33,912 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 08:13:33,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 08:13:33,912 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [t_funErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 38 more)] === [2023-08-26 08:13:33,912 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:13:33,912 INFO L85 PathProgramCache]: Analyzing trace with hash -4205083, now seen corresponding path program 1 times [2023-08-26 08:13:33,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:13:33,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64709807] [2023-08-26 08:13:33,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:13:33,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:13:33,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:13:34,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 08:13:34,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 08:13:34,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64709807] [2023-08-26 08:13:34,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64709807] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 08:13:34,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 08:13:34,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 08:13:34,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159227705] [2023-08-26 08:13:34,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 08:13:34,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 08:13:34,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 08:13:34,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 08:13:34,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 08:13:34,186 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 715 [2023-08-26 08:13:34,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 82 transitions, 180 flow. Second operand has 6 states, 6 states have (on average 247.83333333333334) internal successors, (1487), 6 states have internal predecessors, (1487), 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) [2023-08-26 08:13:34,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 08:13:34,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 715 [2023-08-26 08:13:34,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 08:13:34,311 INFO L124 PetriNetUnfolderBase]: 144/379 cut-off events. [2023-08-26 08:13:34,311 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 08:13:34,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 841 conditions, 379 events. 144/379 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 787 event pairs, 134 based on Foata normal form. 0/361 useless extension candidates. Maximal degree in co-relation 836. Up to 341 conditions per place. [2023-08-26 08:13:34,312 INFO L140 encePairwiseOnDemand]: 709/715 looper letters, 79 selfloop transitions, 5 changer transitions 0/89 dead transitions. [2023-08-26 08:13:34,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 89 transitions, 366 flow [2023-08-26 08:13:34,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 08:13:34,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 08:13:34,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1543 transitions. [2023-08-26 08:13:34,318 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35967365967365966 [2023-08-26 08:13:34,318 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1543 transitions. [2023-08-26 08:13:34,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1543 transitions. [2023-08-26 08:13:34,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 08:13:34,319 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1543 transitions. [2023-08-26 08:13:34,320 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 257.1666666666667) internal successors, (1543), 6 states have internal predecessors, (1543), 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) [2023-08-26 08:13:34,324 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 715.0) internal successors, (5005), 7 states have internal predecessors, (5005), 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) [2023-08-26 08:13:34,334 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 715.0) internal successors, (5005), 7 states have internal predecessors, (5005), 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) [2023-08-26 08:13:34,334 INFO L175 Difference]: Start difference. First operand has 92 places, 82 transitions, 180 flow. Second operand 6 states and 1543 transitions. [2023-08-26 08:13:34,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 89 transitions, 366 flow [2023-08-26 08:13:34,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 89 transitions, 356 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-26 08:13:34,336 INFO L231 Difference]: Finished difference. Result has 91 places, 81 transitions, 178 flow [2023-08-26 08:13:34,336 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=715, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=178, PETRI_PLACES=91, PETRI_TRANSITIONS=81} [2023-08-26 08:13:34,336 INFO L281 CegarLoopForPetriNet]: 212 programPoint places, -121 predicate places. [2023-08-26 08:13:34,336 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 81 transitions, 178 flow [2023-08-26 08:13:34,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 247.83333333333334) internal successors, (1487), 6 states have internal predecessors, (1487), 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) [2023-08-26 08:13:34,337 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:13:34,337 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 08:13:34,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 08:13:34,337 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [t_funErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 38 more)] === [2023-08-26 08:13:34,338 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:13:34,338 INFO L85 PathProgramCache]: Analyzing trace with hash -992346950, now seen corresponding path program 1 times [2023-08-26 08:13:34,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:13:34,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60938822] [2023-08-26 08:13:34,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:13:34,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:13:34,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:13:34,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 08:13:34,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 08:13:34,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60938822] [2023-08-26 08:13:34,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60938822] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 08:13:34,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 08:13:34,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 08:13:34,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406925895] [2023-08-26 08:13:34,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 08:13:34,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 08:13:34,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 08:13:34,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 08:13:34,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 08:13:34,591 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 715 [2023-08-26 08:13:34,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 81 transitions, 178 flow. Second operand has 6 states, 6 states have (on average 248.66666666666666) internal successors, (1492), 6 states have internal predecessors, (1492), 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) [2023-08-26 08:13:34,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 08:13:34,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 715 [2023-08-26 08:13:34,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 08:13:34,790 INFO L124 PetriNetUnfolderBase]: 140/372 cut-off events. [2023-08-26 08:13:34,790 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-26 08:13:34,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 822 conditions, 372 events. 140/372 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 767 event pairs, 130 based on Foata normal form. 0/357 useless extension candidates. Maximal degree in co-relation 817. Up to 331 conditions per place. [2023-08-26 08:13:34,792 INFO L140 encePairwiseOnDemand]: 709/715 looper letters, 77 selfloop transitions, 5 changer transitions 0/88 dead transitions. [2023-08-26 08:13:34,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 88 transitions, 360 flow [2023-08-26 08:13:34,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 08:13:34,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 08:13:34,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1541 transitions. [2023-08-26 08:13:34,795 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3592074592074592 [2023-08-26 08:13:34,795 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1541 transitions. [2023-08-26 08:13:34,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1541 transitions. [2023-08-26 08:13:34,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 08:13:34,795 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1541 transitions. [2023-08-26 08:13:34,797 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 256.8333333333333) internal successors, (1541), 6 states have internal predecessors, (1541), 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) [2023-08-26 08:13:34,800 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 715.0) internal successors, (5005), 7 states have internal predecessors, (5005), 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) [2023-08-26 08:13:34,801 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 715.0) internal successors, (5005), 7 states have internal predecessors, (5005), 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) [2023-08-26 08:13:34,801 INFO L175 Difference]: Start difference. First operand has 91 places, 81 transitions, 178 flow. Second operand 6 states and 1541 transitions. [2023-08-26 08:13:34,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 88 transitions, 360 flow [2023-08-26 08:13:34,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 88 transitions, 350 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-26 08:13:34,802 INFO L231 Difference]: Finished difference. Result has 90 places, 80 transitions, 176 flow [2023-08-26 08:13:34,803 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=715, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=176, PETRI_PLACES=90, PETRI_TRANSITIONS=80} [2023-08-26 08:13:34,803 INFO L281 CegarLoopForPetriNet]: 212 programPoint places, -122 predicate places. [2023-08-26 08:13:34,803 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 80 transitions, 176 flow [2023-08-26 08:13:34,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 248.66666666666666) internal successors, (1492), 6 states have internal predecessors, (1492), 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) [2023-08-26 08:13:34,804 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:13:34,804 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 08:13:34,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 08:13:34,804 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr9ASSERT_VIOLATIONDATA_RACE === [t_funErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 38 more)] === [2023-08-26 08:13:34,804 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:13:34,804 INFO L85 PathProgramCache]: Analyzing trace with hash -200452339, now seen corresponding path program 1 times [2023-08-26 08:13:34,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:13:34,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92530242] [2023-08-26 08:13:34,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:13:34,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:13:34,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:13:35,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 08:13:35,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 08:13:35,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92530242] [2023-08-26 08:13:35,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92530242] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 08:13:35,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 08:13:35,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 08:13:35,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826425538] [2023-08-26 08:13:35,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 08:13:35,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 08:13:35,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 08:13:35,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 08:13:35,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 08:13:35,093 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 715 [2023-08-26 08:13:35,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 80 transitions, 176 flow. Second operand has 6 states, 6 states have (on average 248.33333333333334) internal successors, (1490), 6 states have internal predecessors, (1490), 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) [2023-08-26 08:13:35,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 08:13:35,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 715 [2023-08-26 08:13:35,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 08:13:35,258 INFO L124 PetriNetUnfolderBase]: 138/361 cut-off events. [2023-08-26 08:13:35,258 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 08:13:35,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 805 conditions, 361 events. 138/361 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 710 event pairs, 104 based on Foata normal form. 0/355 useless extension candidates. Maximal degree in co-relation 800. Up to 266 conditions per place. [2023-08-26 08:13:35,259 INFO L140 encePairwiseOnDemand]: 698/715 looper letters, 67 selfloop transitions, 14 changer transitions 0/85 dead transitions. [2023-08-26 08:13:35,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 85 transitions, 352 flow [2023-08-26 08:13:35,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 08:13:35,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 08:13:35,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1530 transitions. [2023-08-26 08:13:35,262 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35664335664335667 [2023-08-26 08:13:35,262 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1530 transitions. [2023-08-26 08:13:35,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1530 transitions. [2023-08-26 08:13:35,263 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 08:13:35,263 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1530 transitions. [2023-08-26 08:13:35,265 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 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) [2023-08-26 08:13:35,268 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 715.0) internal successors, (5005), 7 states have internal predecessors, (5005), 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) [2023-08-26 08:13:35,269 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 715.0) internal successors, (5005), 7 states have internal predecessors, (5005), 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) [2023-08-26 08:13:35,269 INFO L175 Difference]: Start difference. First operand has 90 places, 80 transitions, 176 flow. Second operand 6 states and 1530 transitions. [2023-08-26 08:13:35,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 85 transitions, 352 flow [2023-08-26 08:13:35,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 85 transitions, 342 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-26 08:13:35,270 INFO L231 Difference]: Finished difference. Result has 87 places, 77 transitions, 188 flow [2023-08-26 08:13:35,270 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=715, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=188, PETRI_PLACES=87, PETRI_TRANSITIONS=77} [2023-08-26 08:13:35,271 INFO L281 CegarLoopForPetriNet]: 212 programPoint places, -125 predicate places. [2023-08-26 08:13:35,271 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 77 transitions, 188 flow [2023-08-26 08:13:35,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 248.33333333333334) internal successors, (1490), 6 states have internal predecessors, (1490), 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) [2023-08-26 08:13:35,271 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:13:35,271 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 08:13:35,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 08:13:35,272 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr10ASSERT_VIOLATIONASSERT === [t_funErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 38 more)] === [2023-08-26 08:13:35,272 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:13:35,272 INFO L85 PathProgramCache]: Analyzing trace with hash -200452047, now seen corresponding path program 1 times [2023-08-26 08:13:35,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:13:35,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213811001] [2023-08-26 08:13:35,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:13:35,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:13:35,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 08:13:35,325 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 08:13:35,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 08:13:35,382 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 08:13:35,382 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 08:13:35,383 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location t_funErr10ASSERT_VIOLATIONASSERT (40 of 41 remaining) [2023-08-26 08:13:35,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (39 of 41 remaining) [2023-08-26 08:13:35,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (38 of 41 remaining) [2023-08-26 08:13:35,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (37 of 41 remaining) [2023-08-26 08:13:35,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (36 of 41 remaining) [2023-08-26 08:13:35,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (35 of 41 remaining) [2023-08-26 08:13:35,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (34 of 41 remaining) [2023-08-26 08:13:35,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9ASSERT_VIOLATIONDATA_RACE (33 of 41 remaining) [2023-08-26 08:13:35,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (32 of 41 remaining) [2023-08-26 08:13:35,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (31 of 41 remaining) [2023-08-26 08:13:35,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (30 of 41 remaining) [2023-08-26 08:13:35,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10ASSERT_VIOLATIONASSERT (29 of 41 remaining) [2023-08-26 08:13:35,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (28 of 41 remaining) [2023-08-26 08:13:35,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (27 of 41 remaining) [2023-08-26 08:13:35,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (26 of 41 remaining) [2023-08-26 08:13:35,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONDATA_RACE (25 of 41 remaining) [2023-08-26 08:13:35,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9ASSERT_VIOLATIONDATA_RACE (24 of 41 remaining) [2023-08-26 08:13:35,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (23 of 41 remaining) [2023-08-26 08:13:35,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (22 of 41 remaining) [2023-08-26 08:13:35,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (21 of 41 remaining) [2023-08-26 08:13:35,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (20 of 41 remaining) [2023-08-26 08:13:35,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8ASSERT_VIOLATIONDATA_RACE (19 of 41 remaining) [2023-08-26 08:13:35,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8ASSERT_VIOLATIONDATA_RACE (18 of 41 remaining) [2023-08-26 08:13:35,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (17 of 41 remaining) [2023-08-26 08:13:35,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (16 of 41 remaining) [2023-08-26 08:13:35,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (15 of 41 remaining) [2023-08-26 08:13:35,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (14 of 41 remaining) [2023-08-26 08:13:35,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (13 of 41 remaining) [2023-08-26 08:13:35,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONDATA_RACE (12 of 41 remaining) [2023-08-26 08:13:35,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (11 of 41 remaining) [2023-08-26 08:13:35,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONASSERT (10 of 41 remaining) [2023-08-26 08:13:35,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (9 of 41 remaining) [2023-08-26 08:13:35,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (8 of 41 remaining) [2023-08-26 08:13:35,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (7 of 41 remaining) [2023-08-26 08:13:35,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (6 of 41 remaining) [2023-08-26 08:13:35,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONDATA_RACE (5 of 41 remaining) [2023-08-26 08:13:35,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (4 of 41 remaining) [2023-08-26 08:13:35,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (3 of 41 remaining) [2023-08-26 08:13:35,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (2 of 41 remaining) [2023-08-26 08:13:35,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONDATA_RACE (1 of 41 remaining) [2023-08-26 08:13:35,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (0 of 41 remaining) [2023-08-26 08:13:35,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 08:13:35,387 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 08:13:35,388 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (1/2) [2023-08-26 08:13:35,391 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 08:13:35,391 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 08:13:35,441 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 08:13:35 BasicIcfg [2023-08-26 08:13:35,442 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 08:13:35,442 INFO L158 Benchmark]: Toolchain (without parser) took 56504.57ms. Allocated memory was 383.8MB in the beginning and 746.6MB in the end (delta: 362.8MB). Free memory was 358.6MB in the beginning and 526.7MB in the end (delta: -168.1MB). Peak memory consumption was 522.5MB. Max. memory is 16.0GB. [2023-08-26 08:13:35,442 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 383.8MB. Free memory was 361.7MB in the beginning and 361.6MB in the end (delta: 93.3kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 08:13:35,442 INFO L158 Benchmark]: CACSL2BoogieTranslator took 602.33ms. Allocated memory is still 383.8MB. Free memory was 358.0MB in the beginning and 316.1MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.0GB. [2023-08-26 08:13:35,442 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.66ms. Allocated memory is still 383.8MB. Free memory was 316.1MB in the beginning and 311.0MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-26 08:13:35,443 INFO L158 Benchmark]: Boogie Preprocessor took 68.24ms. Allocated memory is still 383.8MB. Free memory was 311.0MB in the beginning and 305.6MB in the end (delta: 5.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.0GB. [2023-08-26 08:13:35,443 INFO L158 Benchmark]: RCFGBuilder took 624.06ms. Allocated memory was 383.8MB in the beginning and 543.2MB in the end (delta: 159.4MB). Free memory was 305.6MB in the beginning and 506.0MB in the end (delta: -200.4MB). Peak memory consumption was 41.9MB. Max. memory is 16.0GB. [2023-08-26 08:13:35,443 INFO L158 Benchmark]: TraceAbstraction took 55123.76ms. Allocated memory was 543.2MB in the beginning and 746.6MB in the end (delta: 203.4MB). Free memory was 504.9MB in the beginning and 526.7MB in the end (delta: -21.8MB). Peak memory consumption was 510.9MB. Max. memory is 16.0GB. [2023-08-26 08:13:35,444 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 383.8MB. Free memory was 361.7MB in the beginning and 361.6MB in the end (delta: 93.3kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 602.33ms. Allocated memory is still 383.8MB. Free memory was 358.0MB in the beginning and 316.1MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 81.66ms. Allocated memory is still 383.8MB. Free memory was 316.1MB in the beginning and 311.0MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 68.24ms. Allocated memory is still 383.8MB. Free memory was 311.0MB in the beginning and 305.6MB in the end (delta: 5.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.0GB. * RCFGBuilder took 624.06ms. Allocated memory was 383.8MB in the beginning and 543.2MB in the end (delta: 159.4MB). Free memory was 305.6MB in the beginning and 506.0MB in the end (delta: -200.4MB). Peak memory consumption was 41.9MB. Max. memory is 16.0GB. * TraceAbstraction took 55123.76ms. Allocated memory was 543.2MB in the beginning and 746.6MB in the end (delta: 203.4MB). Free memory was 504.9MB in the beginning and 526.7MB in the end (delta: -21.8MB). Peak memory consumption was 510.9MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 244]: Unsoundness Warning unspecified type, defaulting to int C: short [244] - GenericResultAtLocation [Line: 244]: Unsoundness Warning unspecified type, defaulting to int C: short [244] - GenericResultAtLocation [Line: 1044]: Unsoundness Warning unspecified type, defaulting to int C: unsigned short [1044] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 47.7s, 420 PlacesBefore, 212 PlacesAfterwards, 448 TransitionsBefore, 236 TransitionsAfterwards, 64988 CoEnabledTransitionPairs, 8 FixpointIterations, 91 TrivialSequentialCompositions, 152 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 20 ConcurrentYvCompositions, 4 ChoiceCompositions, 267 TotalNumberOfCompositions, 416492 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 44410, independent: 41202, independent conditional: 0, independent unconditional: 41202, dependent: 3208, dependent conditional: 0, dependent unconditional: 3208, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 24694, independent: 24355, independent conditional: 0, independent unconditional: 24355, dependent: 339, dependent conditional: 0, dependent unconditional: 339, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 44410, independent: 16847, independent conditional: 0, independent unconditional: 16847, dependent: 2869, dependent conditional: 0, dependent unconditional: 2869, unknown: 24694, unknown conditional: 0, unknown unconditional: 24694] , Statistics on independence cache: Total cache size (in pairs): 1465, Positive cache size: 1271, Positive conditional cache size: 0, Positive unconditional cache size: 1271, Negative cache size: 194, Negative conditional cache size: 0, Negative unconditional cache size: 194, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 1234]: assertion can be violated assertion can be violated We found a FailurePath: [L1240] 0 pthread_mutex_t __global_lock = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1241-L1244] 0 struct s { int datum; struct s *next; } *A; [L1253] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1254] 0 pthread_mutex_t B_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1267] 0 struct s *p; [L1268] 0 A = malloc(sizeof(struct s)) [L1269] EXPR 0 \read(*A) [L1269] 0 init(A,3) [L1269] CALL 0 init(A,3) [L1246] 0 p -> datum = x [L1247] 0 p -> next = ((void *)0) [L1269] RET 0 init(A,3) [L1270] 0 pthread_t t_ids[10000]; [L1270] 0 int i=0; VAL [A={4:0}, A_mutex={5:0}, B_mutex={6:0}, __global_lock={3:0}, i=0, t_ids={11:0}] [L1270] COND TRUE 0 i<10000 [L1270] FCALL, FORK 0 pthread_create(&t_ids[i], ((void *)0), t_fun, ((void *)0)) VAL [A={4:0}, A_mutex={5:0}, B_mutex={6:0}, __global_lock={3:0}, i=0, pthread_create(&t_ids[i], ((void *)0), t_fun, ((void *)0))=-1, t_ids={11:0}] [L1256] 1 struct s *p = malloc(sizeof(struct s)); [L1257] CALL 1 init(p,7) [L1246] 1 p -> datum = x VAL [A={4:0}, A_mutex={5:0}, B_mutex={6:0}, \old(x)=3, \old(x)=7, __global_lock={3:0}, p={-2:0}, p={-2:0}, p={9:0}, p={9:0}, x=3, x=7] [L1247] 1 p -> next = ((void *)0) VAL [A={4:0}, A_mutex={5:0}, B_mutex={6:0}, \old(x)=3, \old(x)=7, __global_lock={3:0}, p={-2:0}, p={-2:0}, p={9:0}, p={9:0}, x=3, x=7] [L1257] RET 1 init(p,7) [L1259] CALL 1 insert(p, &A) [L1250] EXPR 1 \read(**list) VAL [A={4:0}, A_mutex={5:0}, B_mutex={6:0}, \read(**list)={-2:0}, __global_lock={3:0}, list={4:0}, list={4:0}, p={9:0}, p={9:0}] [L1250] 1 p->next = *list [L1251] 1 *list = p [L1259] RET 1 insert(p, &A) [L1262] COND FALSE 1 !(__VERIFIER_nondet_int()) [L1262] EXPR 1 p->datum VAL [A={4:0}, A_mutex={5:0}, B_mutex={6:0}, __global_lock={3:0}, arg={0:0}, arg={0:0}, p->datum=7, p={9:0}] [L1262] EXPR 1 (p->datum) == 0 [L1262] CALL 1 __VERIFIER_assert((p->datum) == 0) [L1235] COND TRUE 1 !(cond) [L1235] CALL 1 reach_error() [L1234] COND FALSE 1 !(0) [L1234] 1 __assert_fail ("0", "racemacros.h", 9, __extension__ __PRETTY_FUNCTION__) VAL [A={4:0}, A_mutex={5:0}, B_mutex={6:0}, __global_lock={3:0}] - UnprovableResult [Line: 1251]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1278]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1250]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1262]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1250]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1247]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1262]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1246]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1246]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1247]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1279]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1262]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1279]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1269]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1247]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1262]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1279]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1250]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1268]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1262]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1234]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: 1279]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1251]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1283]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1279]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1277]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1246]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1280]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1250]: 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, 560 locations, 42 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 54.9s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 47.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 385 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 385 mSDsluCounter, 323 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2748 IncrementalHoareTripleChecker+Invalid, 2764 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 323 mSDtfsCounter, 2748 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1698occurred in iteration=3, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 234 NumberOfCodeBlocks, 234 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 189 ConstructedInterpolants, 0 QuantifiedInterpolants, 717 SizeOfPredicates, 0 NumberOfNonLiveVariables, 289 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 0/3 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! [2023-08-26 08:13:35,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...