./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_12-ptr_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 3289d67d 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/28-race_reach_12-ptr_racefree.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 7cd6aaa75855c8ee03a174376352b142cf57dd56532b968b1b6c916585172927 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 23:39:21,587 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 23:39:21,641 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-16 23:39:21,647 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 23:39:21,648 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 23:39:21,671 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 23:39:21,671 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 23:39:21,672 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 23:39:21,672 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 23:39:21,673 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 23:39:21,674 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 23:39:21,674 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 23:39:21,674 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 23:39:21,674 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 23:39:21,676 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 23:39:21,676 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 23:39:21,676 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 23:39:21,677 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 23:39:21,677 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 23:39:21,677 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 23:39:21,677 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 23:39:21,677 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 23:39:21,678 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-16 23:39:21,681 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 23:39:21,681 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-16 23:39:21,681 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 23:39:21,681 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 23:39:21,681 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 23:39:21,682 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 23:39:21,682 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 23:39:21,682 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 23:39:21,682 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 23:39:21,682 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 23:39:21,682 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 23:39:21,682 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 23:39:21,683 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 23:39:21,683 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 23:39:21,683 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 23:39:21,683 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 23:39:21,683 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 23:39:21,683 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 23:39:21,684 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 -> 7cd6aaa75855c8ee03a174376352b142cf57dd56532b968b1b6c916585172927 [2024-11-16 23:39:21,988 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 23:39:22,013 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 23:39:22,015 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 23:39:22,016 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 23:39:22,019 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 23:39:22,020 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_12-ptr_racefree.i [2024-11-16 23:39:23,505 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 23:39:23,772 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 23:39:23,773 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_12-ptr_racefree.i [2024-11-16 23:39:23,791 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44e5df1c9/b68653c4641e4833b9e3292da0dacd8c/FLAG15931844b [2024-11-16 23:39:23,806 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44e5df1c9/b68653c4641e4833b9e3292da0dacd8c [2024-11-16 23:39:23,808 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 23:39:23,810 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 23:39:23,812 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 23:39:23,813 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 23:39:23,817 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 23:39:23,818 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:39:23" (1/1) ... [2024-11-16 23:39:23,819 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43f308ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:23, skipping insertion in model container [2024-11-16 23:39:23,820 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:39:23" (1/1) ... [2024-11-16 23:39:23,862 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 23:39:24,207 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 23:39:24,226 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 23:39:24,281 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 23:39:24,378 INFO L204 MainTranslator]: Completed translation [2024-11-16 23:39:24,379 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:24 WrapperNode [2024-11-16 23:39:24,379 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 23:39:24,380 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 23:39:24,380 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 23:39:24,380 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 23:39:24,385 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:24" (1/1) ... [2024-11-16 23:39:24,405 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:24" (1/1) ... [2024-11-16 23:39:24,431 INFO L138 Inliner]: procedures = 171, calls = 43, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 150 [2024-11-16 23:39:24,431 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 23:39:24,432 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 23:39:24,432 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 23:39:24,432 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 23:39:24,439 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:24" (1/1) ... [2024-11-16 23:39:24,440 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:24" (1/1) ... [2024-11-16 23:39:24,443 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:24" (1/1) ... [2024-11-16 23:39:24,443 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:24" (1/1) ... [2024-11-16 23:39:24,451 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:24" (1/1) ... [2024-11-16 23:39:24,452 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:24" (1/1) ... [2024-11-16 23:39:24,454 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:24" (1/1) ... [2024-11-16 23:39:24,455 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:24" (1/1) ... [2024-11-16 23:39:24,457 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 23:39:24,458 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 23:39:24,458 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 23:39:24,458 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 23:39:24,459 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:24" (1/1) ... [2024-11-16 23:39:24,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 23:39:24,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 23:39:24,509 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-16 23:39:24,513 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-16 23:39:24,555 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-16 23:39:24,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-16 23:39:24,555 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-16 23:39:24,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 23:39:24,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-16 23:39:24,555 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-16 23:39:24,555 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-16 23:39:24,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-16 23:39:24,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-16 23:39:24,555 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-16 23:39:24,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 23:39:24,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 23:39:24,557 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-16 23:39:24,736 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 23:39:24,738 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 23:39:24,944 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L708: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2024-11-16 23:39:24,945 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L708-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2024-11-16 23:39:25,014 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-16 23:39:25,014 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 23:39:25,052 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 23:39:25,053 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 23:39:25,053 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:39:25 BoogieIcfgContainer [2024-11-16 23:39:25,053 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 23:39:25,054 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 23:39:25,055 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 23:39:25,057 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 23:39:25,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:39:23" (1/3) ... [2024-11-16 23:39:25,058 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f2cd114 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:39:25, skipping insertion in model container [2024-11-16 23:39:25,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:24" (2/3) ... [2024-11-16 23:39:25,058 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f2cd114 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:39:25, skipping insertion in model container [2024-11-16 23:39:25,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:39:25" (3/3) ... [2024-11-16 23:39:25,059 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_12-ptr_racefree.i [2024-11-16 23:39:25,071 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 23:39:25,071 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-11-16 23:39:25,071 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-16 23:39:25,135 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-16 23:39:25,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 216 places, 226 transitions, 459 flow [2024-11-16 23:39:25,227 INFO L124 PetriNetUnfolderBase]: 19/293 cut-off events. [2024-11-16 23:39:25,227 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-16 23:39:25,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 298 conditions, 293 events. 19/293 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 755 event pairs, 0 based on Foata normal form. 0/261 useless extension candidates. Maximal degree in co-relation 151. Up to 4 conditions per place. [2024-11-16 23:39:25,236 INFO L82 GeneralOperation]: Start removeDead. Operand has 216 places, 226 transitions, 459 flow [2024-11-16 23:39:25,240 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 216 places, 226 transitions, 459 flow [2024-11-16 23:39:25,247 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 23:39:25,252 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;@716b2413, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 23:39:25,253 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-11-16 23:39:25,269 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-16 23:39:25,269 INFO L124 PetriNetUnfolderBase]: 2/115 cut-off events. [2024-11-16 23:39:25,269 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 23:39:25,270 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:39:25,270 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:39:25,271 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-16 23:39:25,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:39:25,276 INFO L85 PathProgramCache]: Analyzing trace with hash -399674039, now seen corresponding path program 1 times [2024-11-16 23:39:25,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:39:25,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552983216] [2024-11-16 23:39:25,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:39:25,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:39:25,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:39:26,130 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-16 23:39:26,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:39:26,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552983216] [2024-11-16 23:39:26,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552983216] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:39:26,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:39:26,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:39:26,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18295402] [2024-11-16 23:39:26,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:39:26,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 23:39:26,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:39:26,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 23:39:26,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:39:26,386 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 226 [2024-11-16 23:39:26,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 226 transitions, 459 flow. Second operand has 6 states, 6 states have (on average 164.5) internal successors, (987), 6 states have internal predecessors, (987), 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-16 23:39:26,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:39:26,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 226 [2024-11-16 23:39:26,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:39:27,116 INFO L124 PetriNetUnfolderBase]: 579/2244 cut-off events. [2024-11-16 23:39:27,116 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-16 23:39:27,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3502 conditions, 2244 events. 579/2244 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 15433 event pairs, 343 based on Foata normal form. 295/2374 useless extension candidates. Maximal degree in co-relation 3300. Up to 1080 conditions per place. [2024-11-16 23:39:27,138 INFO L140 encePairwiseOnDemand]: 191/226 looper letters, 73 selfloop transitions, 70 changer transitions 0/305 dead transitions. [2024-11-16 23:39:27,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 305 transitions, 903 flow [2024-11-16 23:39:27,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:39:27,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 23:39:27,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1158 transitions. [2024-11-16 23:39:27,158 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8539823008849557 [2024-11-16 23:39:27,161 INFO L175 Difference]: Start difference. First operand has 216 places, 226 transitions, 459 flow. Second operand 6 states and 1158 transitions. [2024-11-16 23:39:27,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 305 transitions, 903 flow [2024-11-16 23:39:27,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 305 transitions, 903 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:39:27,177 INFO L231 Difference]: Finished difference. Result has 224 places, 281 transitions, 893 flow [2024-11-16 23:39:27,180 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=431, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=893, PETRI_PLACES=224, PETRI_TRANSITIONS=281} [2024-11-16 23:39:27,184 INFO L277 CegarLoopForPetriNet]: 216 programPoint places, 8 predicate places. [2024-11-16 23:39:27,186 INFO L471 AbstractCegarLoop]: Abstraction has has 224 places, 281 transitions, 893 flow [2024-11-16 23:39:27,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 164.5) internal successors, (987), 6 states have internal predecessors, (987), 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-16 23:39:27,187 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:39:27,188 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:39:27,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 23:39:27,189 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-16 23:39:27,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:39:27,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1557724775, now seen corresponding path program 1 times [2024-11-16 23:39:27,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:39:27,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470204939] [2024-11-16 23:39:27,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:39:27,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:39:27,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:39:27,327 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-16 23:39:27,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:39:27,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470204939] [2024-11-16 23:39:27,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470204939] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:39:27,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:39:27,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 23:39:27,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594147451] [2024-11-16 23:39:27,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:39:27,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:39:27,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:39:27,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:39:27,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:39:27,363 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 226 [2024-11-16 23:39:27,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 281 transitions, 893 flow. Second operand has 3 states, 3 states have (on average 197.0) internal successors, (591), 3 states have internal predecessors, (591), 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-16 23:39:27,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:39:27,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 226 [2024-11-16 23:39:27,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:39:27,482 INFO L124 PetriNetUnfolderBase]: 157/1140 cut-off events. [2024-11-16 23:39:27,482 INFO L125 PetriNetUnfolderBase]: For 118/132 co-relation queries the response was YES. [2024-11-16 23:39:27,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1794 conditions, 1140 events. 157/1140 cut-off events. For 118/132 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 6608 event pairs, 42 based on Foata normal form. 1/1067 useless extension candidates. Maximal degree in co-relation 1635. Up to 207 conditions per place. [2024-11-16 23:39:27,487 INFO L140 encePairwiseOnDemand]: 223/226 looper letters, 22 selfloop transitions, 3 changer transitions 0/287 dead transitions. [2024-11-16 23:39:27,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 287 transitions, 955 flow [2024-11-16 23:39:27,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:39:27,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:39:27,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 610 transitions. [2024-11-16 23:39:27,488 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8997050147492626 [2024-11-16 23:39:27,488 INFO L175 Difference]: Start difference. First operand has 224 places, 281 transitions, 893 flow. Second operand 3 states and 610 transitions. [2024-11-16 23:39:27,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 287 transitions, 955 flow [2024-11-16 23:39:27,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 287 transitions, 955 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:39:27,496 INFO L231 Difference]: Finished difference. Result has 227 places, 281 transitions, 904 flow [2024-11-16 23:39:27,497 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=893, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=904, PETRI_PLACES=227, PETRI_TRANSITIONS=281} [2024-11-16 23:39:27,497 INFO L277 CegarLoopForPetriNet]: 216 programPoint places, 11 predicate places. [2024-11-16 23:39:27,497 INFO L471 AbstractCegarLoop]: Abstraction has has 227 places, 281 transitions, 904 flow [2024-11-16 23:39:27,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 197.0) internal successors, (591), 3 states have internal predecessors, (591), 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-16 23:39:27,498 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:39:27,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:39:27,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 23:39:27,498 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-16 23:39:27,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:39:27,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1677181944, now seen corresponding path program 1 times [2024-11-16 23:39:27,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:39:27,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170820574] [2024-11-16 23:39:27,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:39:27,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:39:27,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:39:28,137 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-16 23:39:28,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:39:28,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170820574] [2024-11-16 23:39:28,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170820574] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:39:28,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:39:28,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:39:28,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118380913] [2024-11-16 23:39:28,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:39:28,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 23:39:28,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:39:28,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 23:39:28,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:39:28,331 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 226 [2024-11-16 23:39:28,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 281 transitions, 904 flow. Second operand has 6 states, 6 states have (on average 176.16666666666666) internal successors, (1057), 6 states have internal predecessors, (1057), 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-16 23:39:28,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:39:28,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 226 [2024-11-16 23:39:28,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:39:28,607 INFO L124 PetriNetUnfolderBase]: 370/1641 cut-off events. [2024-11-16 23:39:28,607 INFO L125 PetriNetUnfolderBase]: For 469/488 co-relation queries the response was YES. [2024-11-16 23:39:28,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3319 conditions, 1641 events. 370/1641 cut-off events. For 469/488 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 10892 event pairs, 96 based on Foata normal form. 2/1587 useless extension candidates. Maximal degree in co-relation 3146. Up to 642 conditions per place. [2024-11-16 23:39:28,616 INFO L140 encePairwiseOnDemand]: 208/226 looper letters, 112 selfloop transitions, 53 changer transitions 0/340 dead transitions. [2024-11-16 23:39:28,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 340 transitions, 1476 flow [2024-11-16 23:39:28,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:39:28,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 23:39:28,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1127 transitions. [2024-11-16 23:39:28,619 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8311209439528023 [2024-11-16 23:39:28,619 INFO L175 Difference]: Start difference. First operand has 227 places, 281 transitions, 904 flow. Second operand 6 states and 1127 transitions. [2024-11-16 23:39:28,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 340 transitions, 1476 flow [2024-11-16 23:39:28,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 340 transitions, 1470 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:39:28,633 INFO L231 Difference]: Finished difference. Result has 235 places, 324 transitions, 1386 flow [2024-11-16 23:39:28,633 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=898, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1386, PETRI_PLACES=235, PETRI_TRANSITIONS=324} [2024-11-16 23:39:28,634 INFO L277 CegarLoopForPetriNet]: 216 programPoint places, 19 predicate places. [2024-11-16 23:39:28,635 INFO L471 AbstractCegarLoop]: Abstraction has has 235 places, 324 transitions, 1386 flow [2024-11-16 23:39:28,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 176.16666666666666) internal successors, (1057), 6 states have internal predecessors, (1057), 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-16 23:39:28,636 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:39:28,636 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:39:28,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 23:39:28,636 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-16 23:39:28,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:39:28,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1724731986, now seen corresponding path program 1 times [2024-11-16 23:39:28,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:39:28,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100640301] [2024-11-16 23:39:28,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:39:28,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:39:28,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 23:39:28,674 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 23:39:28,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 23:39:28,727 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 23:39:28,728 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 23:39:28,729 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining) [2024-11-16 23:39:28,730 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2024-11-16 23:39:28,731 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2024-11-16 23:39:28,731 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining) [2024-11-16 23:39:28,731 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining) [2024-11-16 23:39:28,732 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining) [2024-11-16 23:39:28,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining) [2024-11-16 23:39:28,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2024-11-16 23:39:28,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2024-11-16 23:39:28,734 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining) [2024-11-16 23:39:28,734 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2024-11-16 23:39:28,734 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2024-11-16 23:39:28,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 23:39:28,734 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-16 23:39:28,736 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-16 23:39:28,737 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-16 23:39:28,776 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-16 23:39:28,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 279 places, 294 transitions, 604 flow [2024-11-16 23:39:28,820 INFO L124 PetriNetUnfolderBase]: 34/457 cut-off events. [2024-11-16 23:39:28,820 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-16 23:39:28,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 469 conditions, 457 events. 34/457 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1526 event pairs, 0 based on Foata normal form. 0/401 useless extension candidates. Maximal degree in co-relation 295. Up to 8 conditions per place. [2024-11-16 23:39:28,822 INFO L82 GeneralOperation]: Start removeDead. Operand has 279 places, 294 transitions, 604 flow [2024-11-16 23:39:28,827 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 279 places, 294 transitions, 604 flow [2024-11-16 23:39:28,828 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 23:39:28,829 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;@716b2413, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 23:39:28,830 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-11-16 23:39:28,836 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-16 23:39:28,837 INFO L124 PetriNetUnfolderBase]: 2/115 cut-off events. [2024-11-16 23:39:28,837 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 23:39:28,837 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:39:28,837 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:39:28,837 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-16 23:39:28,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:39:28,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1294290735, now seen corresponding path program 1 times [2024-11-16 23:39:28,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:39:28,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134122474] [2024-11-16 23:39:28,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:39:28,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:39:28,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:39:29,151 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-16 23:39:29,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:39:29,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134122474] [2024-11-16 23:39:29,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134122474] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:39:29,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:39:29,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:39:29,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483761278] [2024-11-16 23:39:29,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:39:29,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 23:39:29,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:39:29,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 23:39:29,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:39:29,434 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 294 [2024-11-16 23:39:29,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 294 transitions, 604 flow. Second operand has 6 states, 6 states have (on average 202.5) internal successors, (1215), 6 states have internal predecessors, (1215), 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-16 23:39:29,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:39:29,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 294 [2024-11-16 23:39:29,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:39:37,615 INFO L124 PetriNetUnfolderBase]: 29152/69355 cut-off events. [2024-11-16 23:39:37,619 INFO L125 PetriNetUnfolderBase]: For 713/713 co-relation queries the response was YES. [2024-11-16 23:39:37,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114893 conditions, 69355 events. 29152/69355 cut-off events. For 713/713 co-relation queries the response was YES. Maximal size of possible extension queue 1191. Compared 780239 event pairs, 20498 based on Foata normal form. 11311/76523 useless extension candidates. Maximal degree in co-relation 90400. Up to 40551 conditions per place. [2024-11-16 23:39:37,995 INFO L140 encePairwiseOnDemand]: 237/294 looper letters, 122 selfloop transitions, 134 changer transitions 0/456 dead transitions. [2024-11-16 23:39:37,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 456 transitions, 1445 flow [2024-11-16 23:39:37,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:39:37,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 23:39:37,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1529 transitions. [2024-11-16 23:39:38,000 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8667800453514739 [2024-11-16 23:39:38,000 INFO L175 Difference]: Start difference. First operand has 279 places, 294 transitions, 604 flow. Second operand 6 states and 1529 transitions. [2024-11-16 23:39:38,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 456 transitions, 1445 flow [2024-11-16 23:39:38,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 456 transitions, 1445 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:39:38,017 INFO L231 Difference]: Finished difference. Result has 287 places, 407 transitions, 1442 flow [2024-11-16 23:39:38,018 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=564, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1442, PETRI_PLACES=287, PETRI_TRANSITIONS=407} [2024-11-16 23:39:38,019 INFO L277 CegarLoopForPetriNet]: 279 programPoint places, 8 predicate places. [2024-11-16 23:39:38,020 INFO L471 AbstractCegarLoop]: Abstraction has has 287 places, 407 transitions, 1442 flow [2024-11-16 23:39:38,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 202.5) internal successors, (1215), 6 states have internal predecessors, (1215), 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-16 23:39:38,021 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:39:38,021 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:39:38,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 23:39:38,022 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-16 23:39:38,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:39:38,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1776388697, now seen corresponding path program 1 times [2024-11-16 23:39:38,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:39:38,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749871674] [2024-11-16 23:39:38,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:39:38,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:39:38,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:39:38,080 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-16 23:39:38,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:39:38,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749871674] [2024-11-16 23:39:38,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749871674] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:39:38,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:39:38,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 23:39:38,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772904137] [2024-11-16 23:39:38,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:39:38,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:39:38,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:39:38,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:39:38,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:39:38,106 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 294 [2024-11-16 23:39:38,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 407 transitions, 1442 flow. Second operand has 3 states, 3 states have (on average 251.0) internal successors, (753), 3 states have internal predecessors, (753), 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-16 23:39:38,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:39:38,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 294 [2024-11-16 23:39:38,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:39:42,037 INFO L124 PetriNetUnfolderBase]: 9617/31008 cut-off events. [2024-11-16 23:39:42,038 INFO L125 PetriNetUnfolderBase]: For 5255/5598 co-relation queries the response was YES. [2024-11-16 23:39:42,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55312 conditions, 31008 events. 9617/31008 cut-off events. For 5255/5598 co-relation queries the response was YES. Maximal size of possible extension queue 574. Compared 351302 event pairs, 3405 based on Foata normal form. 1/28516 useless extension candidates. Maximal degree in co-relation 28583. Up to 8560 conditions per place. [2024-11-16 23:39:42,360 INFO L140 encePairwiseOnDemand]: 291/294 looper letters, 32 selfloop transitions, 3 changer transitions 0/415 dead transitions. [2024-11-16 23:39:42,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 415 transitions, 1534 flow [2024-11-16 23:39:42,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:39:42,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:39:42,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 781 transitions. [2024-11-16 23:39:42,367 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8854875283446711 [2024-11-16 23:39:42,367 INFO L175 Difference]: Start difference. First operand has 287 places, 407 transitions, 1442 flow. Second operand 3 states and 781 transitions. [2024-11-16 23:39:42,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 415 transitions, 1534 flow [2024-11-16 23:39:42,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 415 transitions, 1534 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:39:42,605 INFO L231 Difference]: Finished difference. Result has 290 places, 409 transitions, 1467 flow [2024-11-16 23:39:42,606 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=1442, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=407, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1467, PETRI_PLACES=290, PETRI_TRANSITIONS=409} [2024-11-16 23:39:42,609 INFO L277 CegarLoopForPetriNet]: 279 programPoint places, 11 predicate places. [2024-11-16 23:39:42,609 INFO L471 AbstractCegarLoop]: Abstraction has has 290 places, 409 transitions, 1467 flow [2024-11-16 23:39:42,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 251.0) internal successors, (753), 3 states have internal predecessors, (753), 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-16 23:39:42,610 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:39:42,610 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:39:42,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 23:39:42,610 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-16 23:39:42,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:39:42,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1191222778, now seen corresponding path program 1 times [2024-11-16 23:39:42,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:39:42,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437212989] [2024-11-16 23:39:42,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:39:42,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:39:42,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:39:43,011 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-16 23:39:43,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:39:43,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437212989] [2024-11-16 23:39:43,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437212989] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:39:43,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:39:43,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:39:43,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060080408] [2024-11-16 23:39:43,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:39:43,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 23:39:43,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:39:43,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 23:39:43,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:39:43,338 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 220 out of 294 [2024-11-16 23:39:43,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 409 transitions, 1467 flow. Second operand has 6 states, 6 states have (on average 222.16666666666666) internal successors, (1333), 6 states have internal predecessors, (1333), 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-16 23:39:43,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:39:43,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 294 [2024-11-16 23:39:43,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:39:50,001 INFO L124 PetriNetUnfolderBase]: 22754/54764 cut-off events. [2024-11-16 23:39:50,002 INFO L125 PetriNetUnfolderBase]: For 20276/21812 co-relation queries the response was YES. [2024-11-16 23:39:50,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122184 conditions, 54764 events. 22754/54764 cut-off events. For 20276/21812 co-relation queries the response was YES. Maximal size of possible extension queue 1094. Compared 602900 event pairs, 8064 based on Foata normal form. 56/51815 useless extension candidates. Maximal degree in co-relation 121960. Up to 26533 conditions per place. [2024-11-16 23:39:50,432 INFO L140 encePairwiseOnDemand]: 268/294 looper letters, 192 selfloop transitions, 141 changer transitions 0/588 dead transitions. [2024-11-16 23:39:50,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 588 transitions, 2935 flow [2024-11-16 23:39:50,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:39:50,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 23:39:50,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1483 transitions. [2024-11-16 23:39:50,438 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.840702947845805 [2024-11-16 23:39:50,438 INFO L175 Difference]: Start difference. First operand has 290 places, 409 transitions, 1467 flow. Second operand 6 states and 1483 transitions. [2024-11-16 23:39:50,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 588 transitions, 2935 flow [2024-11-16 23:39:50,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 588 transitions, 2932 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-16 23:39:50,687 INFO L231 Difference]: Finished difference. Result has 299 places, 540 transitions, 2848 flow [2024-11-16 23:39:50,688 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=1464, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=409, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=328, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2848, PETRI_PLACES=299, PETRI_TRANSITIONS=540} [2024-11-16 23:39:50,689 INFO L277 CegarLoopForPetriNet]: 279 programPoint places, 20 predicate places. [2024-11-16 23:39:50,689 INFO L471 AbstractCegarLoop]: Abstraction has has 299 places, 540 transitions, 2848 flow [2024-11-16 23:39:50,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 222.16666666666666) internal successors, (1333), 6 states have internal predecessors, (1333), 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-16 23:39:50,691 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:39:50,691 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:39:50,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 23:39:50,691 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-16 23:39:50,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:39:50,692 INFO L85 PathProgramCache]: Analyzing trace with hash 217313896, now seen corresponding path program 1 times [2024-11-16 23:39:50,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:39:50,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468610113] [2024-11-16 23:39:50,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:39:50,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:39:50,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:39:50,789 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-16 23:39:50,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:39:50,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468610113] [2024-11-16 23:39:50,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468610113] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 23:39:50,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940507721] [2024-11-16 23:39:50,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:39:50,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 23:39:50,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 23:39:50,796 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-16 23:39:50,800 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-16 23:39:50,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:39:50,914 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-16 23:39:50,922 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 23:39:51,018 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-16 23:39:51,018 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 23:39:51,063 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-16 23:39:51,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [940507721] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 23:39:51,064 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 23:39:51,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-16 23:39:51,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235707874] [2024-11-16 23:39:51,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 23:39:51,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 23:39:51,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:39:51,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 23:39:51,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-16 23:39:51,140 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 294 [2024-11-16 23:39:51,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 540 transitions, 2848 flow. Second operand has 10 states, 10 states have (on average 248.3) internal successors, (2483), 10 states have internal predecessors, (2483), 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-16 23:39:51,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:39:51,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 294 [2024-11-16 23:39:51,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:39:55,968 INFO L124 PetriNetUnfolderBase]: 12252/34057 cut-off events. [2024-11-16 23:39:55,968 INFO L125 PetriNetUnfolderBase]: For 21139/22449 co-relation queries the response was YES. [2024-11-16 23:39:56,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81660 conditions, 34057 events. 12252/34057 cut-off events. For 21139/22449 co-relation queries the response was YES. Maximal size of possible extension queue 616. Compared 362213 event pairs, 2212 based on Foata normal form. 186/32641 useless extension candidates. Maximal degree in co-relation 30966. Up to 13951 conditions per place. [2024-11-16 23:39:56,197 INFO L140 encePairwiseOnDemand]: 289/294 looper letters, 72 selfloop transitions, 9 changer transitions 0/546 dead transitions. [2024-11-16 23:39:56,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 546 transitions, 3014 flow [2024-11-16 23:39:56,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 23:39:56,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-16 23:39:56,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2295 transitions. [2024-11-16 23:39:56,203 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8673469387755102 [2024-11-16 23:39:56,203 INFO L175 Difference]: Start difference. First operand has 299 places, 540 transitions, 2848 flow. Second operand 9 states and 2295 transitions. [2024-11-16 23:39:56,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 546 transitions, 3014 flow [2024-11-16 23:39:56,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 546 transitions, 2996 flow, removed 9 selfloop flow, removed 0 redundant places. [2024-11-16 23:39:56,388 INFO L231 Difference]: Finished difference. Result has 257 places, 490 transitions, 2740 flow [2024-11-16 23:39:56,388 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=2718, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=488, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=481, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2740, PETRI_PLACES=257, PETRI_TRANSITIONS=490} [2024-11-16 23:39:56,389 INFO L277 CegarLoopForPetriNet]: 279 programPoint places, -22 predicate places. [2024-11-16 23:39:56,389 INFO L471 AbstractCegarLoop]: Abstraction has has 257 places, 490 transitions, 2740 flow [2024-11-16 23:39:56,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 248.3) internal successors, (2483), 10 states have internal predecessors, (2483), 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-16 23:39:56,390 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:39:56,390 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:39:56,409 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-16 23:39:56,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 23:39:56,595 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-16 23:39:56,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:39:56,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1398698531, now seen corresponding path program 1 times [2024-11-16 23:39:56,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:39:56,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361579156] [2024-11-16 23:39:56,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:39:56,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:39:56,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:39:56,854 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-16 23:39:56,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:39:56,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361579156] [2024-11-16 23:39:56,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361579156] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:39:56,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:39:56,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:39:56,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473427978] [2024-11-16 23:39:56,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:39:56,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 23:39:56,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:39:56,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 23:39:56,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:39:57,006 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 294 [2024-11-16 23:39:57,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 490 transitions, 2740 flow. Second operand has 6 states, 6 states have (on average 206.16666666666666) internal successors, (1237), 6 states have internal predecessors, (1237), 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-16 23:39:57,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:39:57,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 294 [2024-11-16 23:39:57,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:40:03,064 INFO L124 PetriNetUnfolderBase]: 19385/43910 cut-off events. [2024-11-16 23:40:03,064 INFO L125 PetriNetUnfolderBase]: For 43064/45123 co-relation queries the response was YES. [2024-11-16 23:40:03,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130259 conditions, 43910 events. 19385/43910 cut-off events. For 43064/45123 co-relation queries the response was YES. Maximal size of possible extension queue 731. Compared 438853 event pairs, 5110 based on Foata normal form. 41/42217 useless extension candidates. Maximal degree in co-relation 111015. Up to 28120 conditions per place. [2024-11-16 23:40:03,419 INFO L140 encePairwiseOnDemand]: 267/294 looper letters, 338 selfloop transitions, 213 changer transitions 0/721 dead transitions. [2024-11-16 23:40:03,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 721 transitions, 5184 flow [2024-11-16 23:40:03,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:40:03,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 23:40:03,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1390 transitions. [2024-11-16 23:40:03,423 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7879818594104309 [2024-11-16 23:40:03,423 INFO L175 Difference]: Start difference. First operand has 257 places, 490 transitions, 2740 flow. Second operand 6 states and 1390 transitions. [2024-11-16 23:40:03,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 721 transitions, 5184 flow [2024-11-16 23:40:03,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 721 transitions, 5161 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-11-16 23:40:03,804 INFO L231 Difference]: Finished difference. Result has 262 places, 693 transitions, 5027 flow [2024-11-16 23:40:03,805 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=2717, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=490, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=385, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5027, PETRI_PLACES=262, PETRI_TRANSITIONS=693} [2024-11-16 23:40:03,805 INFO L277 CegarLoopForPetriNet]: 279 programPoint places, -17 predicate places. [2024-11-16 23:40:03,805 INFO L471 AbstractCegarLoop]: Abstraction has has 262 places, 693 transitions, 5027 flow [2024-11-16 23:40:03,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 206.16666666666666) internal successors, (1237), 6 states have internal predecessors, (1237), 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-16 23:40:03,806 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:40:03,806 INFO L204 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:40:03,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 23:40:03,807 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-16 23:40:03,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:40:03,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1341048747, now seen corresponding path program 1 times [2024-11-16 23:40:03,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:40:03,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603426600] [2024-11-16 23:40:03,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:40:03,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:40:03,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:40:04,250 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-16 23:40:04,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:40:04,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603426600] [2024-11-16 23:40:04,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603426600] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 23:40:04,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349442849] [2024-11-16 23:40:04,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:40:04,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 23:40:04,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 23:40:04,253 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-16 23:40:04,261 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-16 23:40:04,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:40:04,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-16 23:40:04,383 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 23:40:04,627 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-16 23:40:04,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-16 23:40:04,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-16 23:40:04,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2024-11-16 23:40:04,727 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 23:40:04,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2024-11-16 23:40:04,747 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 23:40:04,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2024-11-16 23:40:04,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2024-11-16 23:40:04,931 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-16 23:40:04,932 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 23:40:04,964 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_ArrVal_555 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet16#1| (select (select (store |c_#race| c_t_funThread1of2ForFork0_~p~0.base v_ArrVal_555) |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.offset|)))) (forall ((v_ArrVal_555 (Array Int Int))) (= (select (select (store |c_#race| c_t_funThread1of2ForFork0_~p~0.base v_ArrVal_555) |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (+ .cse0 3 |c_ULTIMATE.start_main_~#t_ids~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet16#1|)) (forall ((v_ArrVal_555 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet16#1| (select (select (store |c_#race| c_t_funThread1of2ForFork0_~p~0.base v_ArrVal_555) |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.offset| 1)))) (forall ((v_ArrVal_555 (Array Int Int))) (= (select (select (store |c_#race| c_t_funThread1of2ForFork0_~p~0.base v_ArrVal_555) |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (+ .cse0 2 |c_ULTIMATE.start_main_~#t_ids~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet16#1|)))) is different from false [2024-11-16 23:40:05,067 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_ArrVal_555 (Array Int Int))) (= (select (select (store |c_#race| |c_~#global~0.base| v_ArrVal_555) |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.offset| 1)) |c_ULTIMATE.start_main_#t~nondet16#1|)) (forall ((v_ArrVal_555 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet16#1| (select (select (store |c_#race| |c_~#global~0.base| v_ArrVal_555) |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (+ .cse0 2 |c_ULTIMATE.start_main_~#t_ids~0#1.offset|)))) (forall ((v_ArrVal_555 (Array Int Int))) (= (select (select (store |c_#race| |c_~#global~0.base| v_ArrVal_555) |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet16#1|)) (forall ((v_ArrVal_555 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet16#1| (select (select (store |c_#race| |c_~#global~0.base| v_ArrVal_555) |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (+ .cse0 3 |c_ULTIMATE.start_main_~#t_ids~0#1.offset|)))))) is different from false [2024-11-16 23:40:05,222 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (+ .cse1 3 |c_ULTIMATE.start_main_~#t_ids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#t_ids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t_ids~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~nondet16#1|)))) (and (forall ((v_ArrVal_555 (Array Int Int))) (= (select (select (store .cse0 |c_~#global~0.base| v_ArrVal_555) |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (+ .cse1 2 |c_ULTIMATE.start_main_~#t_ids~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet16#1|)) (forall ((v_ArrVal_555 (Array Int Int))) (= (select (select (store .cse0 |c_~#global~0.base| v_ArrVal_555) |c_ULTIMATE.start_main_~#t_ids~0#1.base|) .cse2) |c_ULTIMATE.start_main_#t~nondet16#1|)) (forall ((v_ArrVal_555 (Array Int Int))) (= (select (select (store .cse0 |c_~#global~0.base| v_ArrVal_555) |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~#t_ids~0#1.offset| 1)) |c_ULTIMATE.start_main_#t~nondet16#1|)) (forall ((v_ArrVal_555 (Array Int Int))) (= (select (select (store .cse0 |c_~#global~0.base| v_ArrVal_555) |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~#t_ids~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet16#1|)))))) is different from false [2024-11-16 23:40:05,389 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 23:40:05,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 67 [2024-11-16 23:40:05,398 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 23:40:05,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 111 treesize of output 35 [2024-11-16 23:40:05,407 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-16 23:40:05,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 1 [2024-11-16 23:40:05,415 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-16 23:40:05,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-11-16 23:40:05,421 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-16 23:40:05,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-11-16 23:40:09,290 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 2 times theorem prover too weak. 7 trivial. 1 not checked. [2024-11-16 23:40:09,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [349442849] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 23:40:09,291 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 23:40:09,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 20 [2024-11-16 23:40:09,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725063277] [2024-11-16 23:40:09,292 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 23:40:09,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-16 23:40:09,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:40:09,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-16 23:40:09,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=227, Unknown=18, NotChecked=102, Total=420 [2024-11-16 23:40:09,592 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 294 [2024-11-16 23:40:09,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 693 transitions, 5027 flow. Second operand has 21 states, 21 states have (on average 163.0952380952381) internal successors, (3425), 21 states have internal predecessors, (3425), 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-16 23:40:09,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:40:09,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 294 [2024-11-16 23:40:09,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand