./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/10-synch_02-thread_nonunique.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/10-synch_02-thread_nonunique.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2b48d13cab05bc3b998f8de65b383ec2ee92eaa2c6f230f8a23e235950b9a5ba --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 14:31:26,826 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 14:31:26,933 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-10 14:31:26,939 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 14:31:26,940 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 14:31:26,971 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 14:31:26,971 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 14:31:26,972 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 14:31:26,973 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 14:31:26,973 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 14:31:26,974 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 14:31:26,974 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 14:31:26,975 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 14:31:26,977 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 14:31:26,977 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 14:31:26,977 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 14:31:26,978 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 14:31:26,978 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 14:31:26,978 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 14:31:26,978 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 14:31:26,979 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 14:31:26,982 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 14:31:26,982 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-10 14:31:26,983 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 14:31:26,983 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 14:31:26,983 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 14:31:26,983 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 14:31:26,984 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 14:31:26,984 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 14:31:26,984 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 14:31:26,984 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 14:31:26,985 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:31:26,985 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 14:31:26,986 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 14:31:26,986 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 14:31:26,986 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 14:31:26,986 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 14:31:26,987 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 14:31:26,987 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 14:31:26,987 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 14:31:26,987 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 14:31:26,988 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2b48d13cab05bc3b998f8de65b383ec2ee92eaa2c6f230f8a23e235950b9a5ba [2024-11-10 14:31:27,213 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 14:31:27,237 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 14:31:27,240 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 14:31:27,241 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 14:31:27,242 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 14:31:27,243 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/10-synch_02-thread_nonunique.i [2024-11-10 14:31:28,623 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 14:31:28,866 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 14:31:28,867 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/10-synch_02-thread_nonunique.i [2024-11-10 14:31:28,885 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2f763c43/6a7e44b53846423295fd44f7a8b7ead3/FLAG24b7d82a2 [2024-11-10 14:31:28,898 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2f763c43/6a7e44b53846423295fd44f7a8b7ead3 [2024-11-10 14:31:28,901 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 14:31:28,903 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 14:31:28,905 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 14:31:28,905 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 14:31:28,911 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 14:31:28,912 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:31:28" (1/1) ... [2024-11-10 14:31:28,914 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@122f8480 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:31:28, skipping insertion in model container [2024-11-10 14:31:28,915 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:31:28" (1/1) ... [2024-11-10 14:31:28,958 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 14:31:29,407 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:31:29,412 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 14:31:29,460 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:31:29,503 INFO L204 MainTranslator]: Completed translation [2024-11-10 14:31:29,504 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:31:29 WrapperNode [2024-11-10 14:31:29,504 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 14:31:29,505 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 14:31:29,505 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 14:31:29,505 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 14:31:29,511 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:31:29" (1/1) ... [2024-11-10 14:31:29,524 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:31:29" (1/1) ... [2024-11-10 14:31:29,545 INFO L138 Inliner]: procedures = 259, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 44 [2024-11-10 14:31:29,546 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 14:31:29,546 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 14:31:29,547 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 14:31:29,547 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 14:31:29,554 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:31:29" (1/1) ... [2024-11-10 14:31:29,554 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:31:29" (1/1) ... [2024-11-10 14:31:29,557 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:31:29" (1/1) ... [2024-11-10 14:31:29,557 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:31:29" (1/1) ... [2024-11-10 14:31:29,563 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:31:29" (1/1) ... [2024-11-10 14:31:29,564 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:31:29" (1/1) ... [2024-11-10 14:31:29,565 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:31:29" (1/1) ... [2024-11-10 14:31:29,566 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:31:29" (1/1) ... [2024-11-10 14:31:29,569 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 14:31:29,570 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 14:31:29,570 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 14:31:29,570 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 14:31:29,571 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:31:29" (1/1) ... [2024-11-10 14:31:29,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:31:29,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:31:29,610 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 14:31:29,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 14:31:29,658 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-10 14:31:29,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 14:31:29,659 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-10 14:31:29,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-10 14:31:29,660 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-10 14:31:29,660 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-10 14:31:29,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 14:31:29,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 14:31:29,661 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 14:31:29,818 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 14:31:29,820 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 14:31:29,974 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L923: havoc main_~#id~0#1.base, main_~#id~0#1.offset; [2024-11-10 14:31:29,974 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L923-1: SUMMARY for call ULTIMATE.dealloc(main_~#id~0#1.base, main_~#id~0#1.offset); srcloc: null [2024-11-10 14:31:29,991 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 14:31:29,991 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 14:31:30,001 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 14:31:30,001 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 14:31:30,002 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:31:30 BoogieIcfgContainer [2024-11-10 14:31:30,002 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 14:31:30,004 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 14:31:30,004 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 14:31:30,006 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 14:31:30,006 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:31:28" (1/3) ... [2024-11-10 14:31:30,007 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57b8d349 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:31:30, skipping insertion in model container [2024-11-10 14:31:30,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:31:29" (2/3) ... [2024-11-10 14:31:30,007 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57b8d349 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:31:30, skipping insertion in model container [2024-11-10 14:31:30,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:31:30" (3/3) ... [2024-11-10 14:31:30,010 INFO L112 eAbstractionObserver]: Analyzing ICFG 10-synch_02-thread_nonunique.i [2024-11-10 14:31:30,021 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 14:31:30,022 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-10 14:31:30,022 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 14:31:30,064 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-10 14:31:30,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 58 transitions, 123 flow [2024-11-10 14:31:30,128 INFO L124 PetriNetUnfolderBase]: 5/90 cut-off events. [2024-11-10 14:31:30,128 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-10 14:31:30,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 90 events. 5/90 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 158 event pairs, 0 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 44. Up to 4 conditions per place. [2024-11-10 14:31:30,133 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 58 transitions, 123 flow [2024-11-10 14:31:30,136 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 58 transitions, 123 flow [2024-11-10 14:31:30,144 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:31:30,151 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7ddb13fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:31:30,151 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-10 14:31:30,167 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:31:30,168 INFO L124 PetriNetUnfolderBase]: 2/37 cut-off events. [2024-11-10 14:31:30,168 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:31:30,168 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:31:30,169 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:31:30,169 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 14:31:30,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:31:30,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1599280596, now seen corresponding path program 1 times [2024-11-10 14:31:30,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:31:30,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807001547] [2024-11-10 14:31:30,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:31:30,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:31:30,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:31:30,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:31:30,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:31:30,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807001547] [2024-11-10 14:31:30,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807001547] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:31:30,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:31:30,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:31:30,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701389933] [2024-11-10 14:31:30,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:31:30,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 14:31:30,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:31:30,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 14:31:30,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 14:31:30,404 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 58 [2024-11-10 14:31:30,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 58 transitions, 123 flow. Second operand has 2 states, 2 states have (on average 54.5) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:31:30,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:31:30,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 58 [2024-11-10 14:31:30,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:31:30,450 INFO L124 PetriNetUnfolderBase]: 1/86 cut-off events. [2024-11-10 14:31:30,451 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-10 14:31:30,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 86 events. 1/86 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 147 event pairs, 0 based on Foata normal form. 4/81 useless extension candidates. Maximal degree in co-relation 3. Up to 3 conditions per place. [2024-11-10 14:31:30,452 INFO L140 encePairwiseOnDemand]: 56/58 looper letters, 2 selfloop transitions, 0 changer transitions 0/56 dead transitions. [2024-11-10 14:31:30,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 56 transitions, 123 flow [2024-11-10 14:31:30,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 14:31:30,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-10 14:31:30,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 112 transitions. [2024-11-10 14:31:30,466 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9655172413793104 [2024-11-10 14:31:30,468 INFO L175 Difference]: Start difference. First operand has 58 places, 58 transitions, 123 flow. Second operand 2 states and 112 transitions. [2024-11-10 14:31:30,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 56 transitions, 123 flow [2024-11-10 14:31:30,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 56 transitions, 123 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:31:30,478 INFO L231 Difference]: Finished difference. Result has 59 places, 56 transitions, 119 flow [2024-11-10 14:31:30,480 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=119, PETRI_PLACES=59, PETRI_TRANSITIONS=56} [2024-11-10 14:31:30,498 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 1 predicate places. [2024-11-10 14:31:30,498 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 56 transitions, 119 flow [2024-11-10 14:31:30,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 54.5) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:31:30,498 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:31:30,498 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:31:30,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 14:31:30,499 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 14:31:30,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:31:30,500 INFO L85 PathProgramCache]: Analyzing trace with hash -482556750, now seen corresponding path program 1 times [2024-11-10 14:31:30,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:31:30,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895493707] [2024-11-10 14:31:30,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:31:30,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:31:30,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:31:30,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:31:30,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:31:30,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895493707] [2024-11-10 14:31:30,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895493707] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:31:30,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:31:30,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:31:30,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174426989] [2024-11-10 14:31:30,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:31:30,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:31:30,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:31:30,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:31:30,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:31:30,735 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 58 [2024-11-10 14:31:30,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 56 transitions, 119 flow. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:31:30,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:31:30,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 58 [2024-11-10 14:31:30,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:31:30,767 INFO L124 PetriNetUnfolderBase]: 0/77 cut-off events. [2024-11-10 14:31:30,768 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-10 14:31:30,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 77 events. 0/77 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 79 event pairs, 0 based on Foata normal form. 2/74 useless extension candidates. Maximal degree in co-relation 0. Up to 8 conditions per place. [2024-11-10 14:31:30,768 INFO L140 encePairwiseOnDemand]: 52/58 looper letters, 5 selfloop transitions, 4 changer transitions 7/56 dead transitions. [2024-11-10 14:31:30,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 56 transitions, 141 flow [2024-11-10 14:31:30,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:31:30,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:31:30,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2024-11-10 14:31:30,772 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8505747126436781 [2024-11-10 14:31:30,772 INFO L175 Difference]: Start difference. First operand has 59 places, 56 transitions, 119 flow. Second operand 3 states and 148 transitions. [2024-11-10 14:31:30,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 56 transitions, 141 flow [2024-11-10 14:31:30,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 56 transitions, 141 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:31:30,777 INFO L231 Difference]: Finished difference. Result has 62 places, 49 transitions, 119 flow [2024-11-10 14:31:30,779 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=119, PETRI_PLACES=62, PETRI_TRANSITIONS=49} [2024-11-10 14:31:30,780 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 4 predicate places. [2024-11-10 14:31:30,780 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 49 transitions, 119 flow [2024-11-10 14:31:30,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:31:30,781 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:31:30,781 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:31:30,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 14:31:30,782 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 14:31:30,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:31:30,783 INFO L85 PathProgramCache]: Analyzing trace with hash 791904713, now seen corresponding path program 1 times [2024-11-10 14:31:30,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:31:30,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217639530] [2024-11-10 14:31:30,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:31:30,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:31:30,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:31:31,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:31:31,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:31:31,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217639530] [2024-11-10 14:31:31,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217639530] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:31:31,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:31:31,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:31:31,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789751032] [2024-11-10 14:31:31,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:31:31,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:31:31,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:31:31,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:31:31,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:31:31,467 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 58 [2024-11-10 14:31:31,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 49 transitions, 119 flow. Second operand has 6 states, 6 states have (on average 34.666666666666664) internal successors, (208), 6 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:31:31,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:31:31,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 58 [2024-11-10 14:31:31,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:31:31,510 INFO L124 PetriNetUnfolderBase]: 0/68 cut-off events. [2024-11-10 14:31:31,511 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-11-10 14:31:31,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 68 events. 0/68 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 56 event pairs, 0 based on Foata normal form. 0/67 useless extension candidates. Maximal degree in co-relation 0. Up to 21 conditions per place. [2024-11-10 14:31:31,515 INFO L140 encePairwiseOnDemand]: 52/58 looper letters, 15 selfloop transitions, 5 changer transitions 0/48 dead transitions. [2024-11-10 14:31:31,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 48 transitions, 157 flow [2024-11-10 14:31:31,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:31:31,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:31:31,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 219 transitions. [2024-11-10 14:31:31,518 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6293103448275862 [2024-11-10 14:31:31,518 INFO L175 Difference]: Start difference. First operand has 62 places, 49 transitions, 119 flow. Second operand 6 states and 219 transitions. [2024-11-10 14:31:31,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 48 transitions, 157 flow [2024-11-10 14:31:31,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 48 transitions, 149 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:31:31,522 INFO L231 Difference]: Finished difference. Result has 57 places, 48 transitions, 119 flow [2024-11-10 14:31:31,523 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=119, PETRI_PLACES=57, PETRI_TRANSITIONS=48} [2024-11-10 14:31:31,524 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, -1 predicate places. [2024-11-10 14:31:31,524 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 48 transitions, 119 flow [2024-11-10 14:31:31,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 34.666666666666664) internal successors, (208), 6 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:31:31,525 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:31:31,525 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:31:31,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 14:31:31,526 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 14:31:31,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:31:31,527 INFO L85 PathProgramCache]: Analyzing trace with hash -200494559, now seen corresponding path program 1 times [2024-11-10 14:31:31,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:31:31,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093613311] [2024-11-10 14:31:31,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:31:31,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:31:31,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:31:31,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:31:31,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:31:31,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093613311] [2024-11-10 14:31:31,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093613311] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:31:31,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:31:31,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:31:31,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7682290] [2024-11-10 14:31:31,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:31:31,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:31:31,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:31:31,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:31:31,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:31:31,582 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 58 [2024-11-10 14:31:31,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 48 transitions, 119 flow. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:31:31,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:31:31,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 58 [2024-11-10 14:31:31,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:31:31,605 INFO L124 PetriNetUnfolderBase]: 0/67 cut-off events. [2024-11-10 14:31:31,605 INFO L125 PetriNetUnfolderBase]: For 4/8 co-relation queries the response was YES. [2024-11-10 14:31:31,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 67 events. 0/67 cut-off events. For 4/8 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 50 event pairs, 0 based on Foata normal form. 1/66 useless extension candidates. Maximal degree in co-relation 0. Up to 5 conditions per place. [2024-11-10 14:31:31,605 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 4 selfloop transitions, 2 changer transitions 0/47 dead transitions. [2024-11-10 14:31:31,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 47 transitions, 129 flow [2024-11-10 14:31:31,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:31:31,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:31:31,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 154 transitions. [2024-11-10 14:31:31,610 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8850574712643678 [2024-11-10 14:31:31,610 INFO L175 Difference]: Start difference. First operand has 57 places, 48 transitions, 119 flow. Second operand 3 states and 154 transitions. [2024-11-10 14:31:31,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 47 transitions, 129 flow [2024-11-10 14:31:31,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 47 transitions, 119 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-10 14:31:31,612 INFO L231 Difference]: Finished difference. Result has 53 places, 47 transitions, 111 flow [2024-11-10 14:31:31,615 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=111, PETRI_PLACES=53, PETRI_TRANSITIONS=47} [2024-11-10 14:31:31,615 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, -5 predicate places. [2024-11-10 14:31:31,616 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 47 transitions, 111 flow [2024-11-10 14:31:31,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:31:31,616 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:31:31,616 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:31:31,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 14:31:31,617 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 14:31:31,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:31:31,620 INFO L85 PathProgramCache]: Analyzing trace with hash 2043925868, now seen corresponding path program 1 times [2024-11-10 14:31:31,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:31:31,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689260170] [2024-11-10 14:31:31,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:31:31,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:31:31,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:31:31,710 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:31:31,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:31:31,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689260170] [2024-11-10 14:31:31,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689260170] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 14:31:31,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615780175] [2024-11-10 14:31:31,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:31:31,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:31:31,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:31:31,715 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) [2024-11-10 14:31:31,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 14:31:31,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:31:31,805 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 14:31:31,810 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:31:31,891 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:31:31,892 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 14:31:31,959 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:31:31,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615780175] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 14:31:31,960 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 14:31:31,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-10 14:31:31,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023383156] [2024-11-10 14:31:31,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 14:31:31,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 14:31:31,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:31:31,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 14:31:31,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-10 14:31:32,156 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 58 [2024-11-10 14:31:32,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 47 transitions, 111 flow. Second operand has 10 states, 10 states have (on average 43.3) internal successors, (433), 10 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:31:32,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:31:32,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 58 [2024-11-10 14:31:32,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:31:32,195 INFO L124 PetriNetUnfolderBase]: 0/43 cut-off events. [2024-11-10 14:31:32,196 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-10 14:31:32,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 43 events. 0/43 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 16 event pairs, 0 based on Foata normal form. 1/44 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2024-11-10 14:31:32,196 INFO L140 encePairwiseOnDemand]: 53/58 looper letters, 5 selfloop transitions, 4 changer transitions 0/33 dead transitions. [2024-11-10 14:31:32,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 33 transitions, 94 flow [2024-11-10 14:31:32,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:31:32,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:31:32,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 256 transitions. [2024-11-10 14:31:32,201 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.735632183908046 [2024-11-10 14:31:32,201 INFO L175 Difference]: Start difference. First operand has 53 places, 47 transitions, 111 flow. Second operand 6 states and 256 transitions. [2024-11-10 14:31:32,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 33 transitions, 94 flow [2024-11-10 14:31:32,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 33 transitions, 88 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-10 14:31:32,202 INFO L231 Difference]: Finished difference. Result has 41 places, 32 transitions, 76 flow [2024-11-10 14:31:32,204 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=76, PETRI_PLACES=41, PETRI_TRANSITIONS=32} [2024-11-10 14:31:32,204 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, -17 predicate places. [2024-11-10 14:31:32,204 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 32 transitions, 76 flow [2024-11-10 14:31:32,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 43.3) internal successors, (433), 10 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:31:32,207 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:31:32,207 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:31:32,226 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 14:31:32,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:31:32,408 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 14:31:32,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:31:32,408 INFO L85 PathProgramCache]: Analyzing trace with hash -209207748, now seen corresponding path program 1 times [2024-11-10 14:31:32,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:31:32,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652490293] [2024-11-10 14:31:32,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:31:32,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:31:32,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:31:32,429 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 14:31:32,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:31:32,463 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 14:31:32,464 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 14:31:32,465 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2024-11-10 14:31:32,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 5 remaining) [2024-11-10 14:31:32,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (2 of 5 remaining) [2024-11-10 14:31:32,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 5 remaining) [2024-11-10 14:31:32,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 5 remaining) [2024-11-10 14:31:32,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 14:31:32,468 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-10 14:31:32,475 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-10 14:31:32,475 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-10 14:31:32,489 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-10 14:31:32,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 69 transitions, 154 flow [2024-11-10 14:31:32,513 INFO L124 PetriNetUnfolderBase]: 10/161 cut-off events. [2024-11-10 14:31:32,514 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-10 14:31:32,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 161 events. 10/161 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 312 event pairs, 0 based on Foata normal form. 0/138 useless extension candidates. Maximal degree in co-relation 92. Up to 8 conditions per place. [2024-11-10 14:31:32,515 INFO L82 GeneralOperation]: Start removeDead. Operand has 70 places, 69 transitions, 154 flow [2024-11-10 14:31:32,516 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 70 places, 69 transitions, 154 flow [2024-11-10 14:31:32,517 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:31:32,518 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7ddb13fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:31:32,518 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-10 14:31:32,521 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:31:32,521 INFO L124 PetriNetUnfolderBase]: 2/37 cut-off events. [2024-11-10 14:31:32,521 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:31:32,521 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:31:32,522 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:31:32,522 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 14:31:32,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:31:32,522 INFO L85 PathProgramCache]: Analyzing trace with hash 86492020, now seen corresponding path program 1 times [2024-11-10 14:31:32,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:31:32,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688389790] [2024-11-10 14:31:32,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:31:32,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:31:32,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:31:32,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:31:32,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:31:32,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688389790] [2024-11-10 14:31:32,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688389790] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:31:32,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:31:32,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:31:32,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106355612] [2024-11-10 14:31:32,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:31:32,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 14:31:32,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:31:32,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 14:31:32,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 14:31:32,540 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 69 [2024-11-10 14:31:32,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 69 transitions, 154 flow. Second operand has 2 states, 2 states have (on average 63.5) internal successors, (127), 2 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:31:32,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:31:32,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 69 [2024-11-10 14:31:32,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:31:32,564 INFO L124 PetriNetUnfolderBase]: 3/154 cut-off events. [2024-11-10 14:31:32,566 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2024-11-10 14:31:32,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 154 events. 3/154 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 305 event pairs, 0 based on Foata normal form. 7/145 useless extension candidates. Maximal degree in co-relation 90. Up to 7 conditions per place. [2024-11-10 14:31:32,568 INFO L140 encePairwiseOnDemand]: 67/69 looper letters, 4 selfloop transitions, 0 changer transitions 0/67 dead transitions. [2024-11-10 14:31:32,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 67 transitions, 158 flow [2024-11-10 14:31:32,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 14:31:32,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-10 14:31:32,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 132 transitions. [2024-11-10 14:31:32,569 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9565217391304348 [2024-11-10 14:31:32,569 INFO L175 Difference]: Start difference. First operand has 70 places, 69 transitions, 154 flow. Second operand 2 states and 132 transitions. [2024-11-10 14:31:32,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 67 transitions, 158 flow [2024-11-10 14:31:32,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 67 transitions, 158 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:31:32,571 INFO L231 Difference]: Finished difference. Result has 71 places, 67 transitions, 150 flow [2024-11-10 14:31:32,572 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=150, PETRI_PLACES=71, PETRI_TRANSITIONS=67} [2024-11-10 14:31:32,573 INFO L277 CegarLoopForPetriNet]: 70 programPoint places, 1 predicate places. [2024-11-10 14:31:32,574 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 67 transitions, 150 flow [2024-11-10 14:31:32,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 63.5) internal successors, (127), 2 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:31:32,574 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:31:32,575 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:31:32,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 14:31:32,575 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 14:31:32,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:31:32,576 INFO L85 PathProgramCache]: Analyzing trace with hash -134362281, now seen corresponding path program 1 times [2024-11-10 14:31:32,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:31:32,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899200191] [2024-11-10 14:31:32,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:31:32,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:31:32,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:31:32,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:31:32,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:31:32,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899200191] [2024-11-10 14:31:32,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899200191] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:31:32,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:31:32,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:31:32,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184970767] [2024-11-10 14:31:32,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:31:32,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:31:32,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:31:32,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:31:32,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:31:32,654 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 69 [2024-11-10 14:31:32,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 67 transitions, 150 flow. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:31:32,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:31:32,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 69 [2024-11-10 14:31:32,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:31:32,679 INFO L124 PetriNetUnfolderBase]: 2/157 cut-off events. [2024-11-10 14:31:32,679 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-11-10 14:31:32,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 157 events. 2/157 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 341 event pairs, 0 based on Foata normal form. 3/150 useless extension candidates. Maximal degree in co-relation 193. Up to 20 conditions per place. [2024-11-10 14:31:32,680 INFO L140 encePairwiseOnDemand]: 63/69 looper letters, 13 selfloop transitions, 4 changer transitions 0/71 dead transitions. [2024-11-10 14:31:32,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 71 transitions, 198 flow [2024-11-10 14:31:32,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:31:32,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:31:32,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 181 transitions. [2024-11-10 14:31:32,684 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8743961352657005 [2024-11-10 14:31:32,684 INFO L175 Difference]: Start difference. First operand has 71 places, 67 transitions, 150 flow. Second operand 3 states and 181 transitions. [2024-11-10 14:31:32,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 71 transitions, 198 flow [2024-11-10 14:31:32,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 71 transitions, 198 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:31:32,686 INFO L231 Difference]: Finished difference. Result has 74 places, 69 transitions, 174 flow [2024-11-10 14:31:32,686 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=74, PETRI_TRANSITIONS=69} [2024-11-10 14:31:32,687 INFO L277 CegarLoopForPetriNet]: 70 programPoint places, 4 predicate places. [2024-11-10 14:31:32,687 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 69 transitions, 174 flow [2024-11-10 14:31:32,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:31:32,689 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:31:32,690 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:31:32,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 14:31:32,691 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 14:31:32,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:31:32,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1140099182, now seen corresponding path program 1 times [2024-11-10 14:31:32,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:31:32,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097968780] [2024-11-10 14:31:32,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:31:32,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:31:32,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:31:32,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:31:32,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:31:32,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097968780] [2024-11-10 14:31:32,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097968780] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:31:32,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:31:32,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:31:32,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406608279] [2024-11-10 14:31:32,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:31:32,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:31:32,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:31:32,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:31:32,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:31:33,019 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 69 [2024-11-10 14:31:33,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 69 transitions, 174 flow. Second operand has 6 states, 6 states have (on average 43.666666666666664) internal successors, (262), 6 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:31:33,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:31:33,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 69 [2024-11-10 14:31:33,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:31:33,082 INFO L124 PetriNetUnfolderBase]: 2/154 cut-off events. [2024-11-10 14:31:33,082 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-11-10 14:31:33,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 257 conditions, 154 events. 2/154 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 324 event pairs, 1 based on Foata normal form. 0/152 useless extension candidates. Maximal degree in co-relation 250. Up to 52 conditions per place. [2024-11-10 14:31:33,083 INFO L140 encePairwiseOnDemand]: 63/69 looper letters, 20 selfloop transitions, 6 changer transitions 0/68 dead transitions. [2024-11-10 14:31:33,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 68 transitions, 224 flow [2024-11-10 14:31:33,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:31:33,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:31:33,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 277 transitions. [2024-11-10 14:31:33,085 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6690821256038647 [2024-11-10 14:31:33,085 INFO L175 Difference]: Start difference. First operand has 74 places, 69 transitions, 174 flow. Second operand 6 states and 277 transitions. [2024-11-10 14:31:33,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 68 transitions, 224 flow [2024-11-10 14:31:33,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 68 transitions, 220 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:31:33,087 INFO L231 Difference]: Finished difference. Result has 77 places, 68 transitions, 180 flow [2024-11-10 14:31:33,089 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=180, PETRI_PLACES=77, PETRI_TRANSITIONS=68} [2024-11-10 14:31:33,090 INFO L277 CegarLoopForPetriNet]: 70 programPoint places, 7 predicate places. [2024-11-10 14:31:33,091 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 68 transitions, 180 flow [2024-11-10 14:31:33,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 43.666666666666664) internal successors, (262), 6 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:31:33,091 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:31:33,092 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:31:33,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 14:31:33,092 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 14:31:33,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:31:33,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1159976835, now seen corresponding path program 1 times [2024-11-10 14:31:33,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:31:33,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736058726] [2024-11-10 14:31:33,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:31:33,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:31:33,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:31:33,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:31:33,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:31:33,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736058726] [2024-11-10 14:31:33,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736058726] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:31:33,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:31:33,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:31:33,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376658659] [2024-11-10 14:31:33,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:31:33,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:31:33,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:31:33,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:31:33,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:31:33,142 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 69 [2024-11-10 14:31:33,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 68 transitions, 180 flow. Second operand has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:31:33,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:31:33,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 69 [2024-11-10 14:31:33,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:31:33,184 INFO L124 PetriNetUnfolderBase]: 18/261 cut-off events. [2024-11-10 14:31:33,184 INFO L125 PetriNetUnfolderBase]: For 63/126 co-relation queries the response was YES. [2024-11-10 14:31:33,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 379 conditions, 261 events. 18/261 cut-off events. For 63/126 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1083 event pairs, 9 based on Foata normal form. 3/240 useless extension candidates. Maximal degree in co-relation 372. Up to 34 conditions per place. [2024-11-10 14:31:33,187 INFO L140 encePairwiseOnDemand]: 64/69 looper letters, 11 selfloop transitions, 4 changer transitions 0/73 dead transitions. [2024-11-10 14:31:33,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 73 transitions, 228 flow [2024-11-10 14:31:33,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:31:33,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:31:33,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 187 transitions. [2024-11-10 14:31:33,188 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9033816425120773 [2024-11-10 14:31:33,188 INFO L175 Difference]: Start difference. First operand has 77 places, 68 transitions, 180 flow. Second operand 3 states and 187 transitions. [2024-11-10 14:31:33,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 73 transitions, 228 flow [2024-11-10 14:31:33,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 73 transitions, 216 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-10 14:31:33,192 INFO L231 Difference]: Finished difference. Result has 76 places, 71 transitions, 198 flow [2024-11-10 14:31:33,193 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=198, PETRI_PLACES=76, PETRI_TRANSITIONS=71} [2024-11-10 14:31:33,194 INFO L277 CegarLoopForPetriNet]: 70 programPoint places, 6 predicate places. [2024-11-10 14:31:33,194 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 71 transitions, 198 flow [2024-11-10 14:31:33,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:31:33,194 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:31:33,194 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:31:33,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 14:31:33,194 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 14:31:33,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:31:33,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1112138837, now seen corresponding path program 1 times [2024-11-10 14:31:33,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:31:33,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502329058] [2024-11-10 14:31:33,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:31:33,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:31:33,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:31:33,280 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:31:33,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:31:33,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502329058] [2024-11-10 14:31:33,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502329058] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 14:31:33,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312921842] [2024-11-10 14:31:33,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:31:33,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:31:33,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:31:33,285 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 14:31:33,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 14:31:33,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:31:33,365 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 14:31:33,366 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:31:33,414 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:31:33,414 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 14:31:33,465 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:31:33,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312921842] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 14:31:33,465 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 14:31:33,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-10 14:31:33,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538101608] [2024-11-10 14:31:33,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 14:31:33,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 14:31:33,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:31:33,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 14:31:33,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-10 14:31:33,622 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 69 [2024-11-10 14:31:33,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 71 transitions, 198 flow. Second operand has 10 states, 10 states have (on average 52.3) internal successors, (523), 10 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:31:33,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:31:33,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 69 [2024-11-10 14:31:33,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:31:33,681 INFO L124 PetriNetUnfolderBase]: 3/88 cut-off events. [2024-11-10 14:31:33,682 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-11-10 14:31:33,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 88 events. 3/88 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 158 event pairs, 1 based on Foata normal form. 2/85 useless extension candidates. Maximal degree in co-relation 130. Up to 9 conditions per place. [2024-11-10 14:31:33,682 INFO L140 encePairwiseOnDemand]: 64/69 looper letters, 7 selfloop transitions, 7 changer transitions 0/51 dead transitions. [2024-11-10 14:31:33,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 51 transitions, 170 flow [2024-11-10 14:31:33,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 14:31:33,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-10 14:31:33,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 466 transitions. [2024-11-10 14:31:33,684 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.750402576489533 [2024-11-10 14:31:33,685 INFO L175 Difference]: Start difference. First operand has 76 places, 71 transitions, 198 flow. Second operand 9 states and 466 transitions. [2024-11-10 14:31:33,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 51 transitions, 170 flow [2024-11-10 14:31:33,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 51 transitions, 162 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:31:33,686 INFO L231 Difference]: Finished difference. Result has 61 places, 49 transitions, 144 flow [2024-11-10 14:31:33,687 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=144, PETRI_PLACES=61, PETRI_TRANSITIONS=49} [2024-11-10 14:31:33,687 INFO L277 CegarLoopForPetriNet]: 70 programPoint places, -9 predicate places. [2024-11-10 14:31:33,687 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 49 transitions, 144 flow [2024-11-10 14:31:33,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 52.3) internal successors, (523), 10 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:31:33,688 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:31:33,688 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:31:33,705 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 14:31:33,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-10 14:31:33,889 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 14:31:33,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:31:33,889 INFO L85 PathProgramCache]: Analyzing trace with hash 811397475, now seen corresponding path program 1 times [2024-11-10 14:31:33,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:31:33,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681158432] [2024-11-10 14:31:33,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:31:33,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:31:33,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:31:33,919 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 14:31:33,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:31:33,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681158432] [2024-11-10 14:31:33,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681158432] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:31:33,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:31:33,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:31:33,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385218774] [2024-11-10 14:31:33,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:31:33,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:31:33,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:31:33,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:31:33,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:31:33,929 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 69 [2024-11-10 14:31:33,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 49 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:31:33,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:31:33,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 69 [2024-11-10 14:31:33,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:31:33,950 INFO L124 PetriNetUnfolderBase]: 7/114 cut-off events. [2024-11-10 14:31:33,950 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-11-10 14:31:33,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193 conditions, 114 events. 7/114 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 303 event pairs, 3 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 185. Up to 19 conditions per place. [2024-11-10 14:31:33,951 INFO L140 encePairwiseOnDemand]: 64/69 looper letters, 7 selfloop transitions, 5 changer transitions 0/52 dead transitions. [2024-11-10 14:31:33,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 52 transitions, 176 flow [2024-11-10 14:31:33,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:31:33,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:31:33,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 183 transitions. [2024-11-10 14:31:33,953 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8840579710144928 [2024-11-10 14:31:33,953 INFO L175 Difference]: Start difference. First operand has 61 places, 49 transitions, 144 flow. Second operand 3 states and 183 transitions. [2024-11-10 14:31:33,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 52 transitions, 176 flow [2024-11-10 14:31:33,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 52 transitions, 161 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-11-10 14:31:33,955 INFO L231 Difference]: Finished difference. Result has 60 places, 52 transitions, 165 flow [2024-11-10 14:31:33,955 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=165, PETRI_PLACES=60, PETRI_TRANSITIONS=52} [2024-11-10 14:31:33,955 INFO L277 CegarLoopForPetriNet]: 70 programPoint places, -10 predicate places. [2024-11-10 14:31:33,956 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 52 transitions, 165 flow [2024-11-10 14:31:33,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:31:33,956 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:31:33,956 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:31:33,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 14:31:33,956 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 14:31:33,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:31:33,957 INFO L85 PathProgramCache]: Analyzing trace with hash -686390564, now seen corresponding path program 1 times [2024-11-10 14:31:33,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:31:33,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830835766] [2024-11-10 14:31:33,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:31:33,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:31:33,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:31:33,970 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 14:31:33,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:31:33,982 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 14:31:33,982 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 14:31:33,982 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (5 of 6 remaining) [2024-11-10 14:31:33,982 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 6 remaining) [2024-11-10 14:31:33,983 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (3 of 6 remaining) [2024-11-10 14:31:33,983 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-11-10 14:31:33,983 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 6 remaining) [2024-11-10 14:31:33,983 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 6 remaining) [2024-11-10 14:31:33,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 14:31:33,983 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:31:34,014 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2024-11-10 14:31:34,015 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 14:31:34,020 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 02:31:34 BasicIcfg [2024-11-10 14:31:34,020 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 14:31:34,021 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 14:31:34,021 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 14:31:34,021 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 14:31:34,021 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:31:30" (3/4) ... [2024-11-10 14:31:34,023 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-10 14:31:34,069 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 14:31:34,069 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 14:31:34,070 INFO L158 Benchmark]: Toolchain (without parser) took 5166.02ms. Allocated memory was 159.4MB in the beginning and 205.5MB in the end (delta: 46.1MB). Free memory was 93.0MB in the beginning and 120.3MB in the end (delta: -27.3MB). Peak memory consumption was 17.5MB. Max. memory is 16.1GB. [2024-11-10 14:31:34,070 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 96.5MB. Free memory was 50.8MB in the beginning and 50.7MB in the end (delta: 92.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 14:31:34,070 INFO L158 Benchmark]: CACSL2BoogieTranslator took 599.08ms. Allocated memory is still 159.4MB. Free memory was 92.6MB in the beginning and 111.3MB in the end (delta: -18.7MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. [2024-11-10 14:31:34,071 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.31ms. Allocated memory is still 159.4MB. Free memory was 111.3MB in the beginning and 109.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 14:31:34,071 INFO L158 Benchmark]: Boogie Preprocessor took 23.00ms. Allocated memory is still 159.4MB. Free memory was 108.6MB in the beginning and 107.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 14:31:34,071 INFO L158 Benchmark]: IcfgBuilder took 431.97ms. Allocated memory is still 159.4MB. Free memory was 107.1MB in the beginning and 93.2MB in the end (delta: 14.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-10 14:31:34,071 INFO L158 Benchmark]: TraceAbstraction took 4016.11ms. Allocated memory was 159.4MB in the beginning and 205.5MB in the end (delta: 46.1MB). Free memory was 92.5MB in the beginning and 125.5MB in the end (delta: -33.1MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. [2024-11-10 14:31:34,072 INFO L158 Benchmark]: Witness Printer took 48.32ms. Allocated memory is still 205.5MB. Free memory was 125.5MB in the beginning and 120.3MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 14:31:34,074 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.18ms. Allocated memory is still 96.5MB. Free memory was 50.8MB in the beginning and 50.7MB in the end (delta: 92.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 599.08ms. Allocated memory is still 159.4MB. Free memory was 92.6MB in the beginning and 111.3MB in the end (delta: -18.7MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.31ms. Allocated memory is still 159.4MB. Free memory was 111.3MB in the beginning and 109.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.00ms. Allocated memory is still 159.4MB. Free memory was 108.6MB in the beginning and 107.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 431.97ms. Allocated memory is still 159.4MB. Free memory was 107.1MB in the beginning and 93.2MB in the end (delta: 14.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 4016.11ms. Allocated memory was 159.4MB in the beginning and 205.5MB in the end (delta: 46.1MB). Free memory was 92.5MB in the beginning and 125.5MB in the end (delta: -33.1MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. * Witness Printer took 48.32ms. Allocated memory is still 205.5MB. Free memory was 125.5MB in the beginning and 120.3MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 919]: Data race detected Data race detected The following path leads to a data race: [L917] 0 int myglobal; VAL [myglobal=0] [L923] 0 pthread_t id[10]; VAL [id={8:0}, myglobal=0] [L924] 0 int i; VAL [id={8:0}, myglobal=0] [L925] 0 i=0 VAL [i=0, id={8:0}, myglobal=0] [L925] COND TRUE 0 i<10 VAL [i=0, id={8:0}, myglobal=0] [L926] 0 pthread_create(&id[i], ((void *)0), t_fun, ((void *)0)) VAL [i=0, id={8:0}, myglobal=0] [L926] FCALL, FORK 0 pthread_create(&id[i], ((void *)0), t_fun, ((void *)0)) VAL [\old(arg)={0:0}, i=0, id={8:0}, myglobal=0] [L925] 0 i++ VAL [\old(arg)={0:0}, i=1, id={8:0}, myglobal=0] [L925] COND TRUE 0 i<10 VAL [\old(arg)={0:0}, i=1, id={8:0}, myglobal=0] [L926] 0 pthread_create(&id[i], ((void *)0), t_fun, ((void *)0)) VAL [\old(arg)={0:0}, i=1, id={8:0}, myglobal=0] [L926] FCALL, FORK 0 pthread_create(&id[i], ((void *)0), t_fun, ((void *)0)) VAL [\old(arg)={0:0}, i=1, id={8:0}, myglobal=0] [L919] 2 myglobal=42 VAL [\old(arg)={0:0}, arg={0:0}, myglobal=42] [L919] 1 myglobal=42 VAL [\old(arg)={0:0}, arg={0:0}, myglobal=42] Now there is a data race, but we were unable to determine exactly which statements and variables are involved. - UnprovableResult [Line: 928]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 926]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 926]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 66 locations, 5 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: 2.4s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 260 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 180 mSDsluCounter, 50 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 40 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 451 IncrementalHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 10 mSDtfsCounter, 451 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=123occurred in iteration=0, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 184 NumberOfCodeBlocks, 184 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 176 ConstructedInterpolants, 0 QuantifiedInterpolants, 399 SizeOfPredicates, 2 NumberOfNonLiveVariables, 95 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 0/6 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 76 locations, 6 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: 1.5s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 293 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 190 mSDsluCounter, 68 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 55 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 511 IncrementalHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 13 mSDtfsCounter, 511 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=198occurred in iteration=4, InterpolantAutomatonStates: 26, 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.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 233 NumberOfCodeBlocks, 233 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 215 ConstructedInterpolants, 0 QuantifiedInterpolants, 440 SizeOfPredicates, 2 NumberOfNonLiveVariables, 95 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 12/18 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-10 14:31:34,097 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE