./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/pthread-C-DAC/pthread-demo-datarace-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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/pthread-C-DAC/pthread-demo-datarace-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-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 ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 81147b3e42a82bd92b2fd1c17836bc41bf8598e66ad2317620561a8ac507fa9a --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 19:35:34,343 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 19:35:34,395 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 19:35:34,400 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 19:35:34,404 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 19:35:34,420 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 19:35:34,421 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 19:35:34,421 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 19:35:34,422 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 19:35:34,422 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 19:35:34,422 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 19:35:34,423 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 19:35:34,423 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 19:35:34,423 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 19:35:34,423 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 19:35:34,424 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 19:35:34,424 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 19:35:34,424 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 19:35:34,424 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 19:35:34,424 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 19:35:34,424 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 19:35:34,424 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 19:35:34,424 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 19:35:34,424 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 19:35:34,424 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 19:35:34,424 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 19:35:34,424 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 19:35:34,424 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 19:35:34,425 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 19:35:34,425 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 19:35:34,425 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 19:35:34,425 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 19:35:34,425 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 19:35:34,425 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 19:35:34,425 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 19:35:34,425 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 19:35:34,426 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 19:35:34,426 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 19:35:34,426 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 19:35:34,426 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 19:35:34,426 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 19:35:34,426 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 19:35:34,426 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 19:35:34,426 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 19:35:34,426 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 19:35:34,426 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 ! overflow) ) 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 -> 81147b3e42a82bd92b2fd1c17836bc41bf8598e66ad2317620561a8ac507fa9a [2025-03-17 19:35:34,680 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 19:35:34,687 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 19:35:34,690 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 19:35:34,691 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 19:35:34,691 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 19:35:34,693 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-C-DAC/pthread-demo-datarace-1.i [2025-03-17 19:35:35,868 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfdcbccef/76503fba1b7f469fa2faf4466b4cb67d/FLAG61d6310ae [2025-03-17 19:35:36,168 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 19:35:36,171 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-C-DAC/pthread-demo-datarace-1.i [2025-03-17 19:35:36,186 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfdcbccef/76503fba1b7f469fa2faf4466b4cb67d/FLAG61d6310ae [2025-03-17 19:35:36,201 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfdcbccef/76503fba1b7f469fa2faf4466b4cb67d [2025-03-17 19:35:36,203 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 19:35:36,205 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 19:35:36,206 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 19:35:36,207 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 19:35:36,210 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 19:35:36,211 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:35:36" (1/1) ... [2025-03-17 19:35:36,211 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70260108 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:35:36, skipping insertion in model container [2025-03-17 19:35:36,211 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:35:36" (1/1) ... [2025-03-17 19:35:36,239 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 19:35:36,550 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:35:36,560 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 19:35:36,611 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:35:36,672 INFO L204 MainTranslator]: Completed translation [2025-03-17 19:35:36,672 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:35:36 WrapperNode [2025-03-17 19:35:36,673 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 19:35:36,673 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 19:35:36,674 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 19:35:36,674 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 19:35:36,678 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:35:36" (1/1) ... [2025-03-17 19:35:36,689 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:35:36" (1/1) ... [2025-03-17 19:35:36,704 INFO L138 Inliner]: procedures = 364, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 66 [2025-03-17 19:35:36,704 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 19:35:36,705 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 19:35:36,705 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 19:35:36,705 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 19:35:36,710 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:35:36" (1/1) ... [2025-03-17 19:35:36,711 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:35:36" (1/1) ... [2025-03-17 19:35:36,715 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:35:36" (1/1) ... [2025-03-17 19:35:36,733 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5]. The 0 writes are split as follows [0, 0]. [2025-03-17 19:35:36,734 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:35:36" (1/1) ... [2025-03-17 19:35:36,734 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:35:36" (1/1) ... [2025-03-17 19:35:36,737 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:35:36" (1/1) ... [2025-03-17 19:35:36,738 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:35:36" (1/1) ... [2025-03-17 19:35:36,738 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:35:36" (1/1) ... [2025-03-17 19:35:36,739 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:35:36" (1/1) ... [2025-03-17 19:35:36,743 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 19:35:36,744 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 19:35:36,744 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 19:35:36,745 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 19:35:36,746 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:35:36" (1/1) ... [2025-03-17 19:35:36,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 19:35:36,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:35:36,783 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) [2025-03-17 19:35:36,789 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 [2025-03-17 19:35:36,807 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-17 19:35:36,807 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-17 19:35:36,807 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 19:35:36,807 INFO L130 BoogieDeclarations]: Found specification of procedure thread_function_mutex [2025-03-17 19:35:36,807 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_function_mutex [2025-03-17 19:35:36,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 19:35:36,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 19:35:36,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 19:35:36,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 19:35:36,808 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 19:35:36,931 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 19:35:36,933 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 19:35:37,118 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 19:35:37,118 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 19:35:37,200 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 19:35:37,202 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 19:35:37,202 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:35:37 BoogieIcfgContainer [2025-03-17 19:35:37,202 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 19:35:37,205 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 19:35:37,205 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 19:35:37,208 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 19:35:37,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 07:35:36" (1/3) ... [2025-03-17 19:35:37,209 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@455c89f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 07:35:37, skipping insertion in model container [2025-03-17 19:35:37,209 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:35:36" (2/3) ... [2025-03-17 19:35:37,210 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@455c89f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 07:35:37, skipping insertion in model container [2025-03-17 19:35:37,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:35:37" (3/3) ... [2025-03-17 19:35:37,211 INFO L128 eAbstractionObserver]: Analyzing ICFG pthread-demo-datarace-1.i [2025-03-17 19:35:37,221 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 19:35:37,223 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pthread-demo-datarace-1.i that has 2 procedures, 34 locations, 1 initial locations, 2 loop locations, and 8 error locations. [2025-03-17 19:35:37,223 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 19:35:37,252 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-17 19:35:37,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 35 transitions, 77 flow [2025-03-17 19:35:37,299 INFO L124 PetriNetUnfolderBase]: 2/34 cut-off events. [2025-03-17 19:35:37,301 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 19:35:37,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 34 events. 2/34 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 75 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 30. Up to 2 conditions per place. [2025-03-17 19:35:37,303 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 35 transitions, 77 flow [2025-03-17 19:35:37,305 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 32 transitions, 67 flow [2025-03-17 19:35:37,311 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 19:35:37,321 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;@3611dac5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 19:35:37,321 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-03-17 19:35:37,326 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 19:35:37,327 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-03-17 19:35:37,327 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 19:35:37,327 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:35:37,327 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:35:37,328 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-17 19:35:37,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:35:37,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1419499975, now seen corresponding path program 1 times [2025-03-17 19:35:37,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:35:37,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180717887] [2025-03-17 19:35:37,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:35:37,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:35:37,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:35:37,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:35:37,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:35:37,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:35:37,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:35:37,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:35:37,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180717887] [2025-03-17 19:35:37,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180717887] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:35:37,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:35:37,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 19:35:37,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247875124] [2025-03-17 19:35:37,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:35:37,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:35:37,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:35:37,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:35:37,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:35:37,588 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 35 [2025-03-17 19:35:37,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 32 transitions, 67 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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) [2025-03-17 19:35:37,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:35:37,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 35 [2025-03-17 19:35:37,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:35:37,671 INFO L124 PetriNetUnfolderBase]: 79/235 cut-off events. [2025-03-17 19:35:37,671 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 19:35:37,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 398 conditions, 235 events. 79/235 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1050 event pairs, 26 based on Foata normal form. 3/203 useless extension candidates. Maximal degree in co-relation 389. Up to 135 conditions per place. [2025-03-17 19:35:37,674 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 23 selfloop transitions, 3 changer transitions 0/40 dead transitions. [2025-03-17 19:35:37,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 40 transitions, 135 flow [2025-03-17 19:35:37,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:35:37,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 19:35:37,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2025-03-17 19:35:37,685 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6952380952380952 [2025-03-17 19:35:37,687 INFO L175 Difference]: Start difference. First operand has 34 places, 32 transitions, 67 flow. Second operand 3 states and 73 transitions. [2025-03-17 19:35:37,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 40 transitions, 135 flow [2025-03-17 19:35:37,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 40 transitions, 134 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 19:35:37,693 INFO L231 Difference]: Finished difference. Result has 36 places, 34 transitions, 87 flow [2025-03-17 19:35:37,695 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=87, PETRI_PLACES=36, PETRI_TRANSITIONS=34} [2025-03-17 19:35:37,697 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 2 predicate places. [2025-03-17 19:35:37,698 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 34 transitions, 87 flow [2025-03-17 19:35:37,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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) [2025-03-17 19:35:37,698 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:35:37,698 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:35:37,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 19:35:37,699 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thread_function_mutexErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-17 19:35:37,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:35:37,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1445780750, now seen corresponding path program 1 times [2025-03-17 19:35:37,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:35:37,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980181236] [2025-03-17 19:35:37,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:35:37,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:35:37,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:35:37,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:35:37,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:35:37,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:35:37,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:35:37,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:35:37,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980181236] [2025-03-17 19:35:37,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980181236] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:35:37,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:35:37,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:35:37,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239655280] [2025-03-17 19:35:37,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:35:37,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:35:37,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:35:37,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:35:37,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:35:37,823 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2025-03-17 19:35:37,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 34 transitions, 87 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:35:37,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:35:37,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2025-03-17 19:35:37,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:35:37,948 INFO L124 PetriNetUnfolderBase]: 102/272 cut-off events. [2025-03-17 19:35:37,948 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2025-03-17 19:35:37,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 547 conditions, 272 events. 102/272 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1268 event pairs, 34 based on Foata normal form. 20/262 useless extension candidates. Maximal degree in co-relation 536. Up to 173 conditions per place. [2025-03-17 19:35:37,951 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 33 selfloop transitions, 6 changer transitions 0/51 dead transitions. [2025-03-17 19:35:37,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 51 transitions, 210 flow [2025-03-17 19:35:37,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 19:35:37,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 19:35:37,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2025-03-17 19:35:37,952 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6171428571428571 [2025-03-17 19:35:37,953 INFO L175 Difference]: Start difference. First operand has 36 places, 34 transitions, 87 flow. Second operand 5 states and 108 transitions. [2025-03-17 19:35:37,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 51 transitions, 210 flow [2025-03-17 19:35:37,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 51 transitions, 206 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 19:35:37,957 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 126 flow [2025-03-17 19:35:37,957 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=126, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2025-03-17 19:35:37,957 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 8 predicate places. [2025-03-17 19:35:37,958 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 126 flow [2025-03-17 19:35:37,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:35:37,958 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:35:37,958 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:35:37,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 19:35:37,958 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thread_function_mutexErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-17 19:35:37,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:35:37,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1952682608, now seen corresponding path program 1 times [2025-03-17 19:35:37,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:35:37,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665297581] [2025-03-17 19:35:37,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:35:37,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:35:37,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 19:35:37,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 19:35:37,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:35:37,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:35:38,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:35:38,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:35:38,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665297581] [2025-03-17 19:35:38,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665297581] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:35:38,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:35:38,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:35:38,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901600420] [2025-03-17 19:35:38,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:35:38,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:35:38,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:35:38,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:35:38,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:35:38,060 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 35 [2025-03-17 19:35:38,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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) [2025-03-17 19:35:38,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:35:38,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 35 [2025-03-17 19:35:38,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:35:38,157 INFO L124 PetriNetUnfolderBase]: 117/340 cut-off events. [2025-03-17 19:35:38,157 INFO L125 PetriNetUnfolderBase]: For 131/141 co-relation queries the response was YES. [2025-03-17 19:35:38,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 744 conditions, 340 events. 117/340 cut-off events. For 131/141 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1625 event pairs, 39 based on Foata normal form. 14/330 useless extension candidates. Maximal degree in co-relation 729. Up to 132 conditions per place. [2025-03-17 19:35:38,166 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 39 selfloop transitions, 3 changer transitions 0/56 dead transitions. [2025-03-17 19:35:38,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 56 transitions, 263 flow [2025-03-17 19:35:38,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:35:38,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 19:35:38,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2025-03-17 19:35:38,167 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7071428571428572 [2025-03-17 19:35:38,167 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 126 flow. Second operand 4 states and 99 transitions. [2025-03-17 19:35:38,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 56 transitions, 263 flow [2025-03-17 19:35:38,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 56 transitions, 253 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 19:35:38,169 INFO L231 Difference]: Finished difference. Result has 45 places, 39 transitions, 142 flow [2025-03-17 19:35:38,169 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=142, PETRI_PLACES=45, PETRI_TRANSITIONS=39} [2025-03-17 19:35:38,169 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 11 predicate places. [2025-03-17 19:35:38,169 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 39 transitions, 142 flow [2025-03-17 19:35:38,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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) [2025-03-17 19:35:38,173 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:35:38,173 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:35:38,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 19:35:38,174 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-17 19:35:38,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:35:38,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1941287159, now seen corresponding path program 1 times [2025-03-17 19:35:38,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:35:38,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108917793] [2025-03-17 19:35:38,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:35:38,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:35:38,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 19:35:38,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 19:35:38,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:35:38,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:35:38,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:35:38,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:35:38,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108917793] [2025-03-17 19:35:38,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108917793] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:35:38,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:35:38,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:35:38,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327044230] [2025-03-17 19:35:38,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:35:38,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:35:38,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:35:38,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:35:38,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:35:38,263 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2025-03-17 19:35:38,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 39 transitions, 142 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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) [2025-03-17 19:35:38,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:35:38,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2025-03-17 19:35:38,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:35:38,380 INFO L124 PetriNetUnfolderBase]: 217/598 cut-off events. [2025-03-17 19:35:38,380 INFO L125 PetriNetUnfolderBase]: For 394/457 co-relation queries the response was YES. [2025-03-17 19:35:38,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1380 conditions, 598 events. 217/598 cut-off events. For 394/457 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3105 event pairs, 79 based on Foata normal form. 29/608 useless extension candidates. Maximal degree in co-relation 1364. Up to 278 conditions per place. [2025-03-17 19:35:38,385 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 52 selfloop transitions, 3 changer transitions 0/68 dead transitions. [2025-03-17 19:35:38,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 68 transitions, 371 flow [2025-03-17 19:35:38,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:35:38,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 19:35:38,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2025-03-17 19:35:38,386 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7071428571428572 [2025-03-17 19:35:38,386 INFO L175 Difference]: Start difference. First operand has 45 places, 39 transitions, 142 flow. Second operand 4 states and 99 transitions. [2025-03-17 19:35:38,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 68 transitions, 371 flow [2025-03-17 19:35:38,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 68 transitions, 365 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 19:35:38,389 INFO L231 Difference]: Finished difference. Result has 49 places, 41 transitions, 164 flow [2025-03-17 19:35:38,390 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=164, PETRI_PLACES=49, PETRI_TRANSITIONS=41} [2025-03-17 19:35:38,390 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 15 predicate places. [2025-03-17 19:35:38,390 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 164 flow [2025-03-17 19:35:38,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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) [2025-03-17 19:35:38,391 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:35:38,391 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:35:38,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 19:35:38,391 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-17 19:35:38,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:35:38,391 INFO L85 PathProgramCache]: Analyzing trace with hash 337860258, now seen corresponding path program 1 times [2025-03-17 19:35:38,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:35:38,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065620498] [2025-03-17 19:35:38,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:35:38,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:35:38,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 19:35:38,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 19:35:38,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:35:38,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:35:38,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:35:38,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:35:38,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065620498] [2025-03-17 19:35:38,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065620498] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:35:38,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:35:38,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:35:38,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062404088] [2025-03-17 19:35:38,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:35:38,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:35:38,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:35:38,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:35:38,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:35:38,456 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 35 [2025-03-17 19:35:38,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 164 flow. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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) [2025-03-17 19:35:38,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:35:38,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 35 [2025-03-17 19:35:38,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:35:38,547 INFO L124 PetriNetUnfolderBase]: 111/407 cut-off events. [2025-03-17 19:35:38,547 INFO L125 PetriNetUnfolderBase]: For 268/284 co-relation queries the response was YES. [2025-03-17 19:35:38,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1007 conditions, 407 events. 111/407 cut-off events. For 268/284 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1922 event pairs, 37 based on Foata normal form. 20/425 useless extension candidates. Maximal degree in co-relation 989. Up to 128 conditions per place. [2025-03-17 19:35:38,549 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 30 selfloop transitions, 4 changer transitions 0/50 dead transitions. [2025-03-17 19:35:38,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 50 transitions, 269 flow [2025-03-17 19:35:38,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:35:38,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 19:35:38,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2025-03-17 19:35:38,550 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7238095238095238 [2025-03-17 19:35:38,550 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 164 flow. Second operand 3 states and 76 transitions. [2025-03-17 19:35:38,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 50 transitions, 269 flow [2025-03-17 19:35:38,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 50 transitions, 259 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-17 19:35:38,552 INFO L231 Difference]: Finished difference. Result has 48 places, 39 transitions, 151 flow [2025-03-17 19:35:38,553 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=151, PETRI_PLACES=48, PETRI_TRANSITIONS=39} [2025-03-17 19:35:38,553 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 14 predicate places. [2025-03-17 19:35:38,553 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 151 flow [2025-03-17 19:35:38,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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) [2025-03-17 19:35:38,553 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:35:38,553 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:35:38,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 19:35:38,553 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-17 19:35:38,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:35:38,554 INFO L85 PathProgramCache]: Analyzing trace with hash 95674451, now seen corresponding path program 1 times [2025-03-17 19:35:38,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:35:38,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973493499] [2025-03-17 19:35:38,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:35:38,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:35:38,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 19:35:38,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 19:35:38,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:35:38,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:35:38,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:35:38,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:35:38,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973493499] [2025-03-17 19:35:38,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973493499] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:35:38,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:35:38,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:35:38,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872131255] [2025-03-17 19:35:38,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:35:38,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 19:35:38,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:35:38,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 19:35:38,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:35:38,637 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2025-03-17 19:35:38,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 151 flow. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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) [2025-03-17 19:35:38,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:35:38,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2025-03-17 19:35:38,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:35:38,760 INFO L124 PetriNetUnfolderBase]: 206/602 cut-off events. [2025-03-17 19:35:38,760 INFO L125 PetriNetUnfolderBase]: For 412/448 co-relation queries the response was YES. [2025-03-17 19:35:38,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1611 conditions, 602 events. 206/602 cut-off events. For 412/448 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3173 event pairs, 81 based on Foata normal form. 10/587 useless extension candidates. Maximal degree in co-relation 1594. Up to 223 conditions per place. [2025-03-17 19:35:38,764 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 46 selfloop transitions, 6 changer transitions 0/64 dead transitions. [2025-03-17 19:35:38,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 64 transitions, 359 flow [2025-03-17 19:35:38,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 19:35:38,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 19:35:38,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2025-03-17 19:35:38,765 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6285714285714286 [2025-03-17 19:35:38,765 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 151 flow. Second operand 5 states and 110 transitions. [2025-03-17 19:35:38,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 64 transitions, 359 flow [2025-03-17 19:35:38,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 64 transitions, 349 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 19:35:38,768 INFO L231 Difference]: Finished difference. Result has 53 places, 41 transitions, 180 flow [2025-03-17 19:35:38,768 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=180, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2025-03-17 19:35:38,769 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 19 predicate places. [2025-03-17 19:35:38,769 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 180 flow [2025-03-17 19:35:38,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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) [2025-03-17 19:35:38,769 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:35:38,769 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:35:38,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 19:35:38,769 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread_function_mutexErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-17 19:35:38,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:35:38,770 INFO L85 PathProgramCache]: Analyzing trace with hash 593571690, now seen corresponding path program 1 times [2025-03-17 19:35:38,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:35:38,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121215548] [2025-03-17 19:35:38,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:35:38,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:35:38,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 19:35:38,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 19:35:38,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:35:38,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:35:38,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:35:38,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:35:38,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121215548] [2025-03-17 19:35:38,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121215548] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:35:38,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:35:38,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:35:38,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134729970] [2025-03-17 19:35:38,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:35:38,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 19:35:38,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:35:38,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 19:35:38,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:35:38,837 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2025-03-17 19:35:38,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 180 flow. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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) [2025-03-17 19:35:38,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:35:38,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2025-03-17 19:35:38,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:35:38,976 INFO L124 PetriNetUnfolderBase]: 245/768 cut-off events. [2025-03-17 19:35:38,976 INFO L125 PetriNetUnfolderBase]: For 731/762 co-relation queries the response was YES. [2025-03-17 19:35:38,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2036 conditions, 768 events. 245/768 cut-off events. For 731/762 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 4363 event pairs, 105 based on Foata normal form. 16/773 useless extension candidates. Maximal degree in co-relation 2015. Up to 272 conditions per place. [2025-03-17 19:35:38,981 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 65 selfloop transitions, 7 changer transitions 0/84 dead transitions. [2025-03-17 19:35:38,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 84 transitions, 509 flow [2025-03-17 19:35:38,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 19:35:38,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 19:35:38,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 135 transitions. [2025-03-17 19:35:38,982 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2025-03-17 19:35:38,982 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 180 flow. Second operand 6 states and 135 transitions. [2025-03-17 19:35:38,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 84 transitions, 509 flow [2025-03-17 19:35:38,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 84 transitions, 504 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 19:35:38,984 INFO L231 Difference]: Finished difference. Result has 59 places, 45 transitions, 233 flow [2025-03-17 19:35:38,985 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=233, PETRI_PLACES=59, PETRI_TRANSITIONS=45} [2025-03-17 19:35:38,985 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 25 predicate places. [2025-03-17 19:35:38,985 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 45 transitions, 233 flow [2025-03-17 19:35:38,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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) [2025-03-17 19:35:38,985 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:35:38,985 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:35:38,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 19:35:38,985 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-17 19:35:38,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:35:38,987 INFO L85 PathProgramCache]: Analyzing trace with hash -656161010, now seen corresponding path program 1 times [2025-03-17 19:35:38,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:35:38,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653207086] [2025-03-17 19:35:38,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:35:38,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:35:38,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 19:35:38,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 19:35:39,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:35:39,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:35:39,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:35:39,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:35:39,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653207086] [2025-03-17 19:35:39,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653207086] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:35:39,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:35:39,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:35:39,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877224757] [2025-03-17 19:35:39,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:35:39,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 19:35:39,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:35:39,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 19:35:39,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:35:39,077 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2025-03-17 19:35:39,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 45 transitions, 233 flow. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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) [2025-03-17 19:35:39,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:35:39,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2025-03-17 19:35:39,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:35:39,184 INFO L124 PetriNetUnfolderBase]: 244/721 cut-off events. [2025-03-17 19:35:39,184 INFO L125 PetriNetUnfolderBase]: For 1022/1093 co-relation queries the response was YES. [2025-03-17 19:35:39,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2078 conditions, 721 events. 244/721 cut-off events. For 1022/1093 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3878 event pairs, 100 based on Foata normal form. 5/724 useless extension candidates. Maximal degree in co-relation 2053. Up to 447 conditions per place. [2025-03-17 19:35:39,192 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 51 selfloop transitions, 7 changer transitions 0/70 dead transitions. [2025-03-17 19:35:39,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 70 transitions, 464 flow [2025-03-17 19:35:39,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 19:35:39,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 19:35:39,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2025-03-17 19:35:39,194 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6285714285714286 [2025-03-17 19:35:39,194 INFO L175 Difference]: Start difference. First operand has 59 places, 45 transitions, 233 flow. Second operand 5 states and 110 transitions. [2025-03-17 19:35:39,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 70 transitions, 464 flow [2025-03-17 19:35:39,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 70 transitions, 457 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-17 19:35:39,198 INFO L231 Difference]: Finished difference. Result has 63 places, 47 transitions, 267 flow [2025-03-17 19:35:39,198 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=267, PETRI_PLACES=63, PETRI_TRANSITIONS=47} [2025-03-17 19:35:39,198 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 29 predicate places. [2025-03-17 19:35:39,198 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 47 transitions, 267 flow [2025-03-17 19:35:39,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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) [2025-03-17 19:35:39,199 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:35:39,199 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:35:39,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 19:35:39,199 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread_function_mutexErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-17 19:35:39,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:35:39,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1220853410, now seen corresponding path program 1 times [2025-03-17 19:35:39,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:35:39,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860293090] [2025-03-17 19:35:39,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:35:39,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:35:39,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 19:35:39,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 19:35:39,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:35:39,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:35:39,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:35:39,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:35:39,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860293090] [2025-03-17 19:35:39,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860293090] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:35:39,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:35:39,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:35:39,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386656090] [2025-03-17 19:35:39,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:35:39,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 19:35:39,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:35:39,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 19:35:39,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:35:39,257 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2025-03-17 19:35:39,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 47 transitions, 267 flow. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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) [2025-03-17 19:35:39,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:35:39,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2025-03-17 19:35:39,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:35:39,363 INFO L124 PetriNetUnfolderBase]: 242/799 cut-off events. [2025-03-17 19:35:39,363 INFO L125 PetriNetUnfolderBase]: For 1207/1214 co-relation queries the response was YES. [2025-03-17 19:35:39,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2272 conditions, 799 events. 242/799 cut-off events. For 1207/1214 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 4815 event pairs, 121 based on Foata normal form. 3/792 useless extension candidates. Maximal degree in co-relation 2245. Up to 457 conditions per place. [2025-03-17 19:35:39,367 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 50 selfloop transitions, 9 changer transitions 0/71 dead transitions. [2025-03-17 19:35:39,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 71 transitions, 494 flow [2025-03-17 19:35:39,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 19:35:39,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 19:35:39,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 137 transitions. [2025-03-17 19:35:39,368 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5591836734693878 [2025-03-17 19:35:39,368 INFO L175 Difference]: Start difference. First operand has 63 places, 47 transitions, 267 flow. Second operand 7 states and 137 transitions. [2025-03-17 19:35:39,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 71 transitions, 494 flow [2025-03-17 19:35:39,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 71 transitions, 481 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-03-17 19:35:39,371 INFO L231 Difference]: Finished difference. Result has 69 places, 50 transitions, 310 flow [2025-03-17 19:35:39,371 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=310, PETRI_PLACES=69, PETRI_TRANSITIONS=50} [2025-03-17 19:35:39,374 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 35 predicate places. [2025-03-17 19:35:39,374 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 50 transitions, 310 flow [2025-03-17 19:35:39,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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) [2025-03-17 19:35:39,374 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:35:39,374 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:35:39,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 19:35:39,374 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread_function_mutexErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-17 19:35:39,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:35:39,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1474462951, now seen corresponding path program 1 times [2025-03-17 19:35:39,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:35:39,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184415937] [2025-03-17 19:35:39,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:35:39,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:35:39,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 19:35:39,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 19:35:39,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:35:39,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:35:39,468 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:35:39,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:35:39,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184415937] [2025-03-17 19:35:39,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184415937] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:35:39,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125764484] [2025-03-17 19:35:39,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:35:39,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:35:39,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:35:39,471 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) [2025-03-17 19:35:39,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 19:35:39,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 19:35:39,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 19:35:39,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:35:39,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:35:39,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 19:35:39,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:35:39,581 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:35:39,581 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:35:39,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125764484] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:35:39,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:35:39,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 8 [2025-03-17 19:35:39,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475556770] [2025-03-17 19:35:39,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:35:39,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 19:35:39,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:35:39,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 19:35:39,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-17 19:35:39,590 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 35 [2025-03-17 19:35:39,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 50 transitions, 310 flow. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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) [2025-03-17 19:35:39,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:35:39,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 35 [2025-03-17 19:35:39,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:35:39,686 INFO L124 PetriNetUnfolderBase]: 245/733 cut-off events. [2025-03-17 19:35:39,686 INFO L125 PetriNetUnfolderBase]: For 1252/1296 co-relation queries the response was YES. [2025-03-17 19:35:39,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2154 conditions, 733 events. 245/733 cut-off events. For 1252/1296 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 4112 event pairs, 119 based on Foata normal form. 22/745 useless extension candidates. Maximal degree in co-relation 2124. Up to 485 conditions per place. [2025-03-17 19:35:39,689 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 42 selfloop transitions, 4 changer transitions 0/57 dead transitions. [2025-03-17 19:35:39,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 57 transitions, 417 flow [2025-03-17 19:35:39,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:35:39,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 19:35:39,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2025-03-17 19:35:39,690 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5571428571428572 [2025-03-17 19:35:39,690 INFO L175 Difference]: Start difference. First operand has 69 places, 50 transitions, 310 flow. Second operand 4 states and 78 transitions. [2025-03-17 19:35:39,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 57 transitions, 417 flow [2025-03-17 19:35:39,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 57 transitions, 399 flow, removed 1 selfloop flow, removed 5 redundant places. [2025-03-17 19:35:39,692 INFO L231 Difference]: Finished difference. Result has 64 places, 48 transitions, 278 flow [2025-03-17 19:35:39,696 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=278, PETRI_PLACES=64, PETRI_TRANSITIONS=48} [2025-03-17 19:35:39,697 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 30 predicate places. [2025-03-17 19:35:39,697 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 48 transitions, 278 flow [2025-03-17 19:35:39,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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) [2025-03-17 19:35:39,698 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:35:39,698 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:35:39,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 19:35:39,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-17 19:35:39,902 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread_function_mutexErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-17 19:35:39,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:35:39,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1536288571, now seen corresponding path program 1 times [2025-03-17 19:35:39,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:35:39,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914662968] [2025-03-17 19:35:39,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:35:39,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:35:39,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 19:35:39,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 19:35:39,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:35:39,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:35:39,976 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:35:39,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:35:39,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914662968] [2025-03-17 19:35:39,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914662968] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:35:39,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [674572935] [2025-03-17 19:35:39,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:35:39,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:35:39,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:35:39,979 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) [2025-03-17 19:35:39,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 19:35:40,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 19:35:40,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 19:35:40,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:35:40,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:35:40,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 19:35:40,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:35:40,074 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:35:40,074 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:35:40,127 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:35:40,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [674572935] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:35:40,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:35:40,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-03-17 19:35:40,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769105766] [2025-03-17 19:35:40,128 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:35:40,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 19:35:40,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:35:40,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 19:35:40,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-17 19:35:40,152 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2025-03-17 19:35:40,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 48 transitions, 278 flow. Second operand has 12 states, 12 states have (on average 15.5) internal successors, (186), 12 states have internal predecessors, (186), 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) [2025-03-17 19:35:40,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:35:40,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2025-03-17 19:35:40,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:35:40,499 INFO L124 PetriNetUnfolderBase]: 535/1731 cut-off events. [2025-03-17 19:35:40,499 INFO L125 PetriNetUnfolderBase]: For 2766/2896 co-relation queries the response was YES. [2025-03-17 19:35:40,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4692 conditions, 1731 events. 535/1731 cut-off events. For 2766/2896 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 12789 event pairs, 86 based on Foata normal form. 66/1784 useless extension candidates. Maximal degree in co-relation 4664. Up to 354 conditions per place. [2025-03-17 19:35:40,507 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 153 selfloop transitions, 28 changer transitions 0/193 dead transitions. [2025-03-17 19:35:40,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 193 transitions, 1306 flow [2025-03-17 19:35:40,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 19:35:40,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-17 19:35:40,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 367 transitions. [2025-03-17 19:35:40,509 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6553571428571429 [2025-03-17 19:35:40,509 INFO L175 Difference]: Start difference. First operand has 64 places, 48 transitions, 278 flow. Second operand 16 states and 367 transitions. [2025-03-17 19:35:40,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 193 transitions, 1306 flow [2025-03-17 19:35:40,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 193 transitions, 1305 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 19:35:40,516 INFO L231 Difference]: Finished difference. Result has 86 places, 73 transitions, 584 flow [2025-03-17 19:35:40,516 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=277, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=584, PETRI_PLACES=86, PETRI_TRANSITIONS=73} [2025-03-17 19:35:40,517 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 52 predicate places. [2025-03-17 19:35:40,517 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 73 transitions, 584 flow [2025-03-17 19:35:40,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 15.5) internal successors, (186), 12 states have internal predecessors, (186), 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) [2025-03-17 19:35:40,518 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:35:40,518 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-17 19:35:40,523 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 19:35:40,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-17 19:35:40,718 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread_function_mutexErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-17 19:35:40,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:35:40,719 INFO L85 PathProgramCache]: Analyzing trace with hash -401047319, now seen corresponding path program 1 times [2025-03-17 19:35:40,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:35:40,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766301679] [2025-03-17 19:35:40,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:35:40,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:35:40,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 19:35:40,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 19:35:40,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:35:40,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:35:40,777 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:35:40,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:35:40,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766301679] [2025-03-17 19:35:40,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766301679] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:35:40,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534262097] [2025-03-17 19:35:40,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:35:40,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:35:40,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:35:40,779 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:35:40,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 19:35:40,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 19:35:40,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 19:35:40,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:35:40,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:35:40,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 19:35:40,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:35:40,867 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:35:40,867 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:35:40,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1534262097] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:35:40,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:35:40,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-17 19:35:40,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248904282] [2025-03-17 19:35:40,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:35:40,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 19:35:40,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:35:40,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 19:35:40,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 19:35:40,880 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 35 [2025-03-17 19:35:40,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 73 transitions, 584 flow. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 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) [2025-03-17 19:35:40,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:35:40,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 35 [2025-03-17 19:35:40,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:35:41,083 INFO L124 PetriNetUnfolderBase]: 548/1649 cut-off events. [2025-03-17 19:35:41,083 INFO L125 PetriNetUnfolderBase]: For 3184/3302 co-relation queries the response was YES. [2025-03-17 19:35:41,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4908 conditions, 1649 events. 548/1649 cut-off events. For 3184/3302 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 12006 event pairs, 52 based on Foata normal form. 55/1649 useless extension candidates. Maximal degree in co-relation 4871. Up to 680 conditions per place. [2025-03-17 19:35:41,090 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 115 selfloop transitions, 5 changer transitions 0/136 dead transitions. [2025-03-17 19:35:41,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 136 transitions, 1258 flow [2025-03-17 19:35:41,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 19:35:41,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 19:35:41,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 138 transitions. [2025-03-17 19:35:41,091 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6571428571428571 [2025-03-17 19:35:41,091 INFO L175 Difference]: Start difference. First operand has 86 places, 73 transitions, 584 flow. Second operand 6 states and 138 transitions. [2025-03-17 19:35:41,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 136 transitions, 1258 flow [2025-03-17 19:35:41,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 136 transitions, 1060 flow, removed 84 selfloop flow, removed 6 redundant places. [2025-03-17 19:35:41,099 INFO L231 Difference]: Finished difference. Result has 84 places, 72 transitions, 486 flow [2025-03-17 19:35:41,099 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=486, PETRI_PLACES=84, PETRI_TRANSITIONS=72} [2025-03-17 19:35:41,099 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 50 predicate places. [2025-03-17 19:35:41,099 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 72 transitions, 486 flow [2025-03-17 19:35:41,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 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) [2025-03-17 19:35:41,100 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:35:41,100 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-17 19:35:41,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 19:35:41,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:35:41,300 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-17 19:35:41,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:35:41,301 INFO L85 PathProgramCache]: Analyzing trace with hash -232749046, now seen corresponding path program 1 times [2025-03-17 19:35:41,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:35:41,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317793228] [2025-03-17 19:35:41,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:35:41,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:35:41,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 19:35:41,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 19:35:41,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:35:41,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:35:41,362 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:35:41,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:35:41,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317793228] [2025-03-17 19:35:41,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317793228] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:35:41,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2076832557] [2025-03-17 19:35:41,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:35:41,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:35:41,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:35:41,365 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:35:41,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 19:35:41,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 19:35:41,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 19:35:41,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:35:41,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:35:41,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 19:35:41,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:35:41,445 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:35:41,445 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:35:41,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2076832557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:35:41,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:35:41,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-17 19:35:41,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862161287] [2025-03-17 19:35:41,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:35:41,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 19:35:41,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:35:41,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 19:35:41,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 19:35:41,457 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2025-03-17 19:35:41,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 72 transitions, 486 flow. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 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) [2025-03-17 19:35:41,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:35:41,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2025-03-17 19:35:41,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:35:41,676 INFO L124 PetriNetUnfolderBase]: 675/1982 cut-off events. [2025-03-17 19:35:41,677 INFO L125 PetriNetUnfolderBase]: For 3718/3760 co-relation queries the response was YES. [2025-03-17 19:35:41,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5886 conditions, 1982 events. 675/1982 cut-off events. For 3718/3760 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 14790 event pairs, 81 based on Foata normal form. 75/1975 useless extension candidates. Maximal degree in co-relation 5851. Up to 798 conditions per place. [2025-03-17 19:35:41,687 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 138 selfloop transitions, 5 changer transitions 0/157 dead transitions. [2025-03-17 19:35:41,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 157 transitions, 1331 flow [2025-03-17 19:35:41,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 19:35:41,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 19:35:41,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 140 transitions. [2025-03-17 19:35:41,688 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-03-17 19:35:41,688 INFO L175 Difference]: Start difference. First operand has 84 places, 72 transitions, 486 flow. Second operand 6 states and 140 transitions. [2025-03-17 19:35:41,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 157 transitions, 1331 flow [2025-03-17 19:35:41,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 157 transitions, 1306 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 19:35:41,697 INFO L231 Difference]: Finished difference. Result has 85 places, 71 transitions, 487 flow [2025-03-17 19:35:41,697 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=477, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=487, PETRI_PLACES=85, PETRI_TRANSITIONS=71} [2025-03-17 19:35:41,698 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 51 predicate places. [2025-03-17 19:35:41,698 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 71 transitions, 487 flow [2025-03-17 19:35:41,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 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) [2025-03-17 19:35:41,698 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:35:41,698 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-17 19:35:41,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 19:35:41,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:35:41,903 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread_function_mutexErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-17 19:35:41,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:35:41,903 INFO L85 PathProgramCache]: Analyzing trace with hash 452435209, now seen corresponding path program 1 times [2025-03-17 19:35:41,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:35:41,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136692831] [2025-03-17 19:35:41,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:35:41,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:35:41,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 19:35:41,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 19:35:41,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:35:41,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:35:41,953 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 19:35:41,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:35:41,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136692831] [2025-03-17 19:35:41,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136692831] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:35:41,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:35:41,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:35:41,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402443738] [2025-03-17 19:35:41,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:35:41,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:35:41,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:35:41,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:35:41,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:35:41,966 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2025-03-17 19:35:41,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 71 transitions, 487 flow. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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) [2025-03-17 19:35:41,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:35:41,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2025-03-17 19:35:41,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:35:42,153 INFO L124 PetriNetUnfolderBase]: 605/1811 cut-off events. [2025-03-17 19:35:42,153 INFO L125 PetriNetUnfolderBase]: For 3423/3458 co-relation queries the response was YES. [2025-03-17 19:35:42,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5473 conditions, 1811 events. 605/1811 cut-off events. For 3423/3458 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 13095 event pairs, 133 based on Foata normal form. 55/1866 useless extension candidates. Maximal degree in co-relation 5438. Up to 706 conditions per place. [2025-03-17 19:35:42,168 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 89 selfloop transitions, 6 changer transitions 0/109 dead transitions. [2025-03-17 19:35:42,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 109 transitions, 902 flow [2025-03-17 19:35:42,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:35:42,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 19:35:42,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2025-03-17 19:35:42,169 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6214285714285714 [2025-03-17 19:35:42,169 INFO L175 Difference]: Start difference. First operand has 85 places, 71 transitions, 487 flow. Second operand 4 states and 87 transitions. [2025-03-17 19:35:42,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 109 transitions, 902 flow [2025-03-17 19:35:42,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 109 transitions, 883 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-03-17 19:35:42,181 INFO L231 Difference]: Finished difference. Result has 84 places, 71 transitions, 494 flow [2025-03-17 19:35:42,181 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=494, PETRI_PLACES=84, PETRI_TRANSITIONS=71} [2025-03-17 19:35:42,182 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 50 predicate places. [2025-03-17 19:35:42,182 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 71 transitions, 494 flow [2025-03-17 19:35:42,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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) [2025-03-17 19:35:42,182 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:35:42,182 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-17 19:35:42,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 19:35:42,183 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-17 19:35:42,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:35:42,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1374714349, now seen corresponding path program 1 times [2025-03-17 19:35:42,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:35:42,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211837699] [2025-03-17 19:35:42,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:35:42,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:35:42,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 19:35:42,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 19:35:42,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:35:42,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:35:42,219 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 19:35:42,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:35:42,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211837699] [2025-03-17 19:35:42,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211837699] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:35:42,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:35:42,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:35:42,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507816751] [2025-03-17 19:35:42,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:35:42,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:35:42,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:35:42,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:35:42,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:35:42,226 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2025-03-17 19:35:42,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 71 transitions, 494 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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) [2025-03-17 19:35:42,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:35:42,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2025-03-17 19:35:42,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:35:42,434 INFO L124 PetriNetUnfolderBase]: 739/2042 cut-off events. [2025-03-17 19:35:42,435 INFO L125 PetriNetUnfolderBase]: For 4550/4554 co-relation queries the response was YES. [2025-03-17 19:35:42,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6504 conditions, 2042 events. 739/2042 cut-off events. For 4550/4554 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 14523 event pairs, 177 based on Foata normal form. 75/2110 useless extension candidates. Maximal degree in co-relation 6470. Up to 824 conditions per place. [2025-03-17 19:35:42,445 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 112 selfloop transitions, 6 changer transitions 0/131 dead transitions. [2025-03-17 19:35:42,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 131 transitions, 1176 flow [2025-03-17 19:35:42,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:35:42,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 19:35:42,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2025-03-17 19:35:42,447 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6285714285714286 [2025-03-17 19:35:42,447 INFO L175 Difference]: Start difference. First operand has 84 places, 71 transitions, 494 flow. Second operand 4 states and 88 transitions. [2025-03-17 19:35:42,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 131 transitions, 1176 flow [2025-03-17 19:35:42,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 131 transitions, 1150 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-03-17 19:35:42,455 INFO L231 Difference]: Finished difference. Result has 84 places, 71 transitions, 498 flow [2025-03-17 19:35:42,455 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=498, PETRI_PLACES=84, PETRI_TRANSITIONS=71} [2025-03-17 19:35:42,456 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 50 predicate places. [2025-03-17 19:35:42,456 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 71 transitions, 498 flow [2025-03-17 19:35:42,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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) [2025-03-17 19:35:42,456 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:35:42,456 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:35:42,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 19:35:42,456 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread_function_mutexErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-17 19:35:42,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:35:42,457 INFO L85 PathProgramCache]: Analyzing trace with hash 581904889, now seen corresponding path program 1 times [2025-03-17 19:35:42,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:35:42,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398528643] [2025-03-17 19:35:42,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:35:42,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:35:42,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-17 19:35:42,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 19:35:42,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:35:42,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:35:42,655 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:35:42,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:35:42,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398528643] [2025-03-17 19:35:42,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398528643] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:35:42,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823707902] [2025-03-17 19:35:42,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:35:42,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:35:42,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:35:42,658 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:35:42,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 19:35:42,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-17 19:35:42,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 19:35:42,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:35:42,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:35:42,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 19:35:42,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:35:42,818 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:35:42,818 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:35:42,967 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:35:42,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823707902] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:35:42,968 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:35:42,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-03-17 19:35:42,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972674264] [2025-03-17 19:35:42,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:35:42,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-17 19:35:42,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:35:42,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-17 19:35:42,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=330, Unknown=0, NotChecked=0, Total=462 [2025-03-17 19:35:43,012 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2025-03-17 19:35:43,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 71 transitions, 498 flow. Second operand has 22 states, 22 states have (on average 15.863636363636363) internal successors, (349), 22 states have internal predecessors, (349), 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) [2025-03-17 19:35:43,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:35:43,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2025-03-17 19:35:43,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:35:44,713 INFO L124 PetriNetUnfolderBase]: 2847/8721 cut-off events. [2025-03-17 19:35:44,713 INFO L125 PetriNetUnfolderBase]: For 32196/32196 co-relation queries the response was YES. [2025-03-17 19:35:44,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27662 conditions, 8721 events. 2847/8721 cut-off events. For 32196/32196 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 75105 event pairs, 320 based on Foata normal form. 454/9159 useless extension candidates. Maximal degree in co-relation 27628. Up to 1262 conditions per place. [2025-03-17 19:35:44,762 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 541 selfloop transitions, 133 changer transitions 0/684 dead transitions. [2025-03-17 19:35:44,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 684 transitions, 5394 flow [2025-03-17 19:35:44,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2025-03-17 19:35:44,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2025-03-17 19:35:44,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 1275 transitions. [2025-03-17 19:35:44,771 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6746031746031746 [2025-03-17 19:35:44,771 INFO L175 Difference]: Start difference. First operand has 84 places, 71 transitions, 498 flow. Second operand 54 states and 1275 transitions. [2025-03-17 19:35:44,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 684 transitions, 5394 flow [2025-03-17 19:35:44,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 684 transitions, 5188 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 19:35:44,861 INFO L231 Difference]: Finished difference. Result has 171 places, 189 transitions, 1983 flow [2025-03-17 19:35:44,862 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=54, PETRI_FLOW=1983, PETRI_PLACES=171, PETRI_TRANSITIONS=189} [2025-03-17 19:35:44,867 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 137 predicate places. [2025-03-17 19:35:44,867 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 189 transitions, 1983 flow [2025-03-17 19:35:44,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 15.863636363636363) internal successors, (349), 22 states have internal predecessors, (349), 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) [2025-03-17 19:35:44,868 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:35:44,868 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-17 19:35:44,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 19:35:45,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-17 19:35:45,069 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-17 19:35:45,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:35:45,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1037859091, now seen corresponding path program 1 times [2025-03-17 19:35:45,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:35:45,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343146068] [2025-03-17 19:35:45,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:35:45,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:35:45,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-17 19:35:45,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-17 19:35:45,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:35:45,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:35:45,382 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:35:45,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:35:45,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343146068] [2025-03-17 19:35:45,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343146068] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:35:45,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550585763] [2025-03-17 19:35:45,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:35:45,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:35:45,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:35:45,384 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:35:45,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 19:35:45,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-17 19:35:45,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-17 19:35:45,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:35:45,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:35:45,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 19:35:45,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:35:45,563 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:35:45,564 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:35:45,785 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:35:45,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1550585763] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:35:45,786 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:35:45,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 26 [2025-03-17 19:35:45,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720209007] [2025-03-17 19:35:45,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:35:45,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-17 19:35:45,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:35:45,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-17 19:35:45,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=511, Unknown=0, NotChecked=0, Total=756 [2025-03-17 19:35:45,837 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2025-03-17 19:35:45,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 189 transitions, 1983 flow. Second operand has 28 states, 28 states have (on average 16.607142857142858) internal successors, (465), 28 states have internal predecessors, (465), 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) [2025-03-17 19:35:45,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:35:45,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2025-03-17 19:35:45,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:35:51,625 INFO L124 PetriNetUnfolderBase]: 10347/32337 cut-off events. [2025-03-17 19:35:51,626 INFO L125 PetriNetUnfolderBase]: For 673066/673066 co-relation queries the response was YES. [2025-03-17 19:35:52,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106278 conditions, 32337 events. 10347/32337 cut-off events. For 673066/673066 co-relation queries the response was YES. Maximal size of possible extension queue 439. Compared 331313 event pairs, 1436 based on Foata normal form. 1087/33397 useless extension candidates. Maximal degree in co-relation 106206. Up to 4786 conditions per place. [2025-03-17 19:35:52,085 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 908 selfloop transitions, 464 changer transitions 0/1382 dead transitions. [2025-03-17 19:35:52,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 1382 transitions, 13012 flow [2025-03-17 19:35:52,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2025-03-17 19:35:52,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2025-03-17 19:35:52,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 2028 transitions. [2025-03-17 19:35:52,091 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6737541528239203 [2025-03-17 19:35:52,091 INFO L175 Difference]: Start difference. First operand has 171 places, 189 transitions, 1983 flow. Second operand 86 states and 2028 transitions. [2025-03-17 19:35:52,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 1382 transitions, 13012 flow [2025-03-17 19:35:52,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 1382 transitions, 11383 flow, removed 794 selfloop flow, removed 9 redundant places. [2025-03-17 19:35:52,569 INFO L231 Difference]: Finished difference. Result has 297 places, 580 transitions, 6240 flow [2025-03-17 19:35:52,570 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1536, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=130, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=86, PETRI_FLOW=6240, PETRI_PLACES=297, PETRI_TRANSITIONS=580} [2025-03-17 19:35:52,570 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 263 predicate places. [2025-03-17 19:35:52,570 INFO L471 AbstractCegarLoop]: Abstraction has has 297 places, 580 transitions, 6240 flow [2025-03-17 19:35:52,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 16.607142857142858) internal successors, (465), 28 states have internal predecessors, (465), 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) [2025-03-17 19:35:52,570 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:35:52,570 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-17 19:35:52,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-17 19:35:52,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-17 19:35:52,771 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread_function_mutexErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-17 19:35:52,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:35:52,772 INFO L85 PathProgramCache]: Analyzing trace with hash 501340439, now seen corresponding path program 1 times [2025-03-17 19:35:52,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:35:52,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364450855] [2025-03-17 19:35:52,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:35:52,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:35:52,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-17 19:35:52,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-17 19:35:52,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:35:52,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:35:53,060 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:35:53,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:35:53,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364450855] [2025-03-17 19:35:53,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364450855] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:35:53,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [263173831] [2025-03-17 19:35:53,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:35:53,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:35:53,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:35:53,087 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:35:53,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 19:35:53,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-17 19:35:53,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-17 19:35:53,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:35:53,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:35:53,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-17 19:35:53,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:35:53,258 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:35:53,258 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:35:53,512 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:35:53,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [263173831] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:35:53,513 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:35:53,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 32 [2025-03-17 19:35:53,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605466329] [2025-03-17 19:35:53,513 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:35:53,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-17 19:35:53,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:35:53,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-17 19:35:53,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=808, Unknown=0, NotChecked=0, Total=1122 [2025-03-17 19:35:53,555 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2025-03-17 19:35:53,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 580 transitions, 6240 flow. Second operand has 34 states, 34 states have (on average 16.147058823529413) internal successors, (549), 34 states have internal predecessors, (549), 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) [2025-03-17 19:35:53,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:35:53,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2025-03-17 19:35:53,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:36:12,349 INFO L124 PetriNetUnfolderBase]: 24205/75820 cut-off events. [2025-03-17 19:36:12,349 INFO L125 PetriNetUnfolderBase]: For 4098190/4098190 co-relation queries the response was YES. [2025-03-17 19:36:14,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 259822 conditions, 75820 events. 24205/75820 cut-off events. For 4098190/4098190 co-relation queries the response was YES. Maximal size of possible extension queue 916. Compared 910457 event pairs, 2729 based on Foata normal form. 1523/77311 useless extension candidates. Maximal degree in co-relation 259700. Up to 11430 conditions per place. [2025-03-17 19:36:14,227 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 1411 selfloop transitions, 1180 changer transitions 0/2601 dead transitions. [2025-03-17 19:36:14,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 430 places, 2601 transitions, 26975 flow [2025-03-17 19:36:14,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2025-03-17 19:36:14,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2025-03-17 19:36:14,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 3129 transitions. [2025-03-17 19:36:14,232 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6671641791044776 [2025-03-17 19:36:14,232 INFO L175 Difference]: Start difference. First operand has 297 places, 580 transitions, 6240 flow. Second operand 134 states and 3129 transitions. [2025-03-17 19:36:14,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 430 places, 2601 transitions, 26975 flow [2025-03-17 19:36:19,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 2601 transitions, 25597 flow, removed 650 selfloop flow, removed 22 redundant places. [2025-03-17 19:36:19,616 INFO L231 Difference]: Finished difference. Result has 456 places, 1296 transitions, 15883 flow [2025-03-17 19:36:19,617 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=5458, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=580, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=517, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=134, PETRI_FLOW=15883, PETRI_PLACES=456, PETRI_TRANSITIONS=1296} [2025-03-17 19:36:19,617 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 422 predicate places. [2025-03-17 19:36:19,617 INFO L471 AbstractCegarLoop]: Abstraction has has 456 places, 1296 transitions, 15883 flow [2025-03-17 19:36:19,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 16.147058823529413) internal successors, (549), 34 states have internal predecessors, (549), 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) [2025-03-17 19:36:19,618 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:36:19,618 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1] [2025-03-17 19:36:19,626 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 19:36:19,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:36:19,819 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-17 19:36:19,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:36:19,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1353178001, now seen corresponding path program 2 times [2025-03-17 19:36:19,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:36:19,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685243269] [2025-03-17 19:36:19,820 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:36:19,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:36:19,833 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 114 statements into 2 equivalence classes. [2025-03-17 19:36:19,852 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 114 of 114 statements. [2025-03-17 19:36:19,853 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:36:19,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:36:20,547 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:36:20,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:36:20,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685243269] [2025-03-17 19:36:20,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685243269] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:36:20,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654303076] [2025-03-17 19:36:20,548 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:36:20,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:36:20,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:36:20,550 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:36:20,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 19:36:20,618 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 114 statements into 2 equivalence classes. [2025-03-17 19:36:20,656 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 114 of 114 statements. [2025-03-17 19:36:20,656 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:36:20,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:36:20,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-17 19:36:20,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:36:20,814 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:36:20,814 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:36:21,290 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:36:21,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [654303076] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:36:21,291 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:36:21,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 42 [2025-03-17 19:36:21,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190062256] [2025-03-17 19:36:21,291 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:36:21,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-03-17 19:36:21,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:36:21,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-03-17 19:36:21,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=541, Invalid=1351, Unknown=0, NotChecked=0, Total=1892 [2025-03-17 19:36:21,357 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2025-03-17 19:36:21,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 456 places, 1296 transitions, 15883 flow. Second operand has 44 states, 44 states have (on average 16.386363636363637) internal successors, (721), 44 states have internal predecessors, (721), 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) [2025-03-17 19:36:21,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:36:21,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2025-03-17 19:36:21,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand