./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/popl20-nonblocking-cntr.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 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/weaver/popl20-nonblocking-cntr.wvr.c -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 fe7fc3189e39cd6587b4d7d83621bd29f6e1c085e1b3af197b9abc1746b629ea --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:29:46,733 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:29:46,771 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:29:46,775 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:29:46,775 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:29:46,794 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:29:46,795 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:29:46,795 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:29:46,796 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:29:46,796 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:29:46,796 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:29:46,796 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:29:46,797 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:29:46,797 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:29:46,797 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:29:46,797 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:29:46,797 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:29:46,797 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:29:46,797 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:29:46,797 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:29:46,797 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:29:46,797 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:29:46,797 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:29:46,797 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:29:46,797 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:29:46,798 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:29:46,798 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:29:46,798 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:29:46,798 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:29:46,798 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:29:46,798 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:29:46,798 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:29:46,798 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:29:46,798 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:29:46,798 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:29:46,798 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:29:46,798 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:29:46,798 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:29:46,798 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:29:46,798 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:29:46,798 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:29:46,799 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:29:46,799 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:29:46,799 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:29:46,799 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:29:46,799 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 -> fe7fc3189e39cd6587b4d7d83621bd29f6e1c085e1b3af197b9abc1746b629ea [2025-03-04 15:29:47,001 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:29:47,007 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:29:47,009 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:29:47,009 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:29:47,010 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:29:47,012 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-nonblocking-cntr.wvr.c [2025-03-04 15:29:48,128 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ce903db9/309fcd0890894b02afccbc8f74831b6a/FLAGbb88b1ec0 [2025-03-04 15:29:48,352 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:29:48,353 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-nonblocking-cntr.wvr.c [2025-03-04 15:29:48,360 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ce903db9/309fcd0890894b02afccbc8f74831b6a/FLAGbb88b1ec0 [2025-03-04 15:29:48,378 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ce903db9/309fcd0890894b02afccbc8f74831b6a [2025-03-04 15:29:48,380 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:29:48,381 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:29:48,382 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:29:48,382 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:29:48,385 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:29:48,385 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:29:48" (1/1) ... [2025-03-04 15:29:48,386 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a19b339 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:48, skipping insertion in model container [2025-03-04 15:29:48,386 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:29:48" (1/1) ... [2025-03-04 15:29:48,398 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:29:48,515 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:29:48,522 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:29:48,537 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:29:48,549 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:29:48,549 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:48 WrapperNode [2025-03-04 15:29:48,550 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:29:48,550 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:29:48,550 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:29:48,550 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:29:48,556 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:48" (1/1) ... [2025-03-04 15:29:48,560 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:48" (1/1) ... [2025-03-04 15:29:48,572 INFO L138 Inliner]: procedures = 20, calls = 15, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 43 [2025-03-04 15:29:48,574 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:29:48,575 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:29:48,575 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:29:48,575 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:29:48,581 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:48" (1/1) ... [2025-03-04 15:29:48,581 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:48" (1/1) ... [2025-03-04 15:29:48,582 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:48" (1/1) ... [2025-03-04 15:29:48,592 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 15:29:48,594 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:48" (1/1) ... [2025-03-04 15:29:48,594 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:48" (1/1) ... [2025-03-04 15:29:48,598 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:48" (1/1) ... [2025-03-04 15:29:48,600 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:48" (1/1) ... [2025-03-04 15:29:48,601 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:48" (1/1) ... [2025-03-04 15:29:48,603 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:48" (1/1) ... [2025-03-04 15:29:48,604 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:29:48,606 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:29:48,606 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:29:48,606 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:29:48,607 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:48" (1/1) ... [2025-03-04 15:29:48,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:29:48,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:48,659 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-04 15:29:48,661 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-04 15:29:48,680 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:29:48,680 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 15:29:48,680 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 15:29:48,680 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 15:29:48,680 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 15:29:48,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:29:48,680 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 15:29:48,680 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 15:29:48,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:29:48,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:29:48,681 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 15:29:48,738 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:29:48,740 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:29:48,881 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:29:48,881 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:29:48,982 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:29:48,982 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:29:48,982 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:29:48 BoogieIcfgContainer [2025-03-04 15:29:48,983 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:29:48,985 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:29:48,985 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:29:48,988 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:29:48,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:29:48" (1/3) ... [2025-03-04 15:29:48,990 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1deb5612 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:29:48, skipping insertion in model container [2025-03-04 15:29:48,990 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:48" (2/3) ... [2025-03-04 15:29:48,991 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1deb5612 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:29:48, skipping insertion in model container [2025-03-04 15:29:48,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:29:48" (3/3) ... [2025-03-04 15:29:48,992 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-nonblocking-cntr.wvr.c [2025-03-04 15:29:49,002 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:29:49,003 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-nonblocking-cntr.wvr.c that has 3 procedures, 28 locations, 1 initial locations, 2 loop locations, and 8 error locations. [2025-03-04 15:29:49,003 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:29:49,040 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 15:29:49,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 29 transitions, 72 flow [2025-03-04 15:29:49,097 INFO L124 PetriNetUnfolderBase]: 2/27 cut-off events. [2025-03-04 15:29:49,100 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 15:29:49,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 27 events. 2/27 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 63 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 24. Up to 2 conditions per place. [2025-03-04 15:29:49,103 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 29 transitions, 72 flow [2025-03-04 15:29:49,107 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 25 transitions, 59 flow [2025-03-04 15:29:49,114 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:29:49,126 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;@744af553, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:29:49,127 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-03-04 15:29:49,130 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:29:49,130 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2025-03-04 15:29:49,130 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:29:49,130 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:49,133 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 15:29:49,133 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:29:49,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:49,137 INFO L85 PathProgramCache]: Analyzing trace with hash 226056121, now seen corresponding path program 1 times [2025-03-04 15:29:49,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:49,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015349568] [2025-03-04 15:29:49,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:49,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:49,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:29:49,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:29:49,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:49,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:49,294 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-04 15:29:49,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:49,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015349568] [2025-03-04 15:29:49,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015349568] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:29:49,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:29:49,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:29:49,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554906113] [2025-03-04 15:29:49,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:29:49,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:29:49,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:49,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:29:49,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:29:49,328 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-04 15:29:49,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 25 transitions, 59 flow. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-04 15:29:49,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:49,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-04 15:29:49,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:49,427 INFO L124 PetriNetUnfolderBase]: 107/199 cut-off events. [2025-03-04 15:29:49,429 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-03-04 15:29:49,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 405 conditions, 199 events. 107/199 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 772 event pairs, 82 based on Foata normal form. 0/148 useless extension candidates. Maximal degree in co-relation 365. Up to 184 conditions per place. [2025-03-04 15:29:49,432 INFO L140 encePairwiseOnDemand]: 26/29 looper letters, 16 selfloop transitions, 1 changer transitions 0/23 dead transitions. [2025-03-04 15:29:49,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 23 transitions, 89 flow [2025-03-04 15:29:49,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:29:49,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:29:49,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2025-03-04 15:29:49,443 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4942528735632184 [2025-03-04 15:29:49,444 INFO L175 Difference]: Start difference. First operand has 30 places, 25 transitions, 59 flow. Second operand 3 states and 43 transitions. [2025-03-04 15:29:49,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 23 transitions, 89 flow [2025-03-04 15:29:49,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 23 transitions, 84 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:29:49,450 INFO L231 Difference]: Finished difference. Result has 27 places, 23 transitions, 52 flow [2025-03-04 15:29:49,452 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=27, PETRI_TRANSITIONS=23} [2025-03-04 15:29:49,454 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, -3 predicate places. [2025-03-04 15:29:49,456 INFO L471 AbstractCegarLoop]: Abstraction has has 27 places, 23 transitions, 52 flow [2025-03-04 15:29:49,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-04 15:29:49,456 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:49,457 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 15:29:49,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:29:49,457 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:29:49,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:49,459 INFO L85 PathProgramCache]: Analyzing trace with hash 226056122, now seen corresponding path program 1 times [2025-03-04 15:29:49,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:49,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813867559] [2025-03-04 15:29:49,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:49,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:49,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:29:49,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:29:49,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:49,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:49,503 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-04 15:29:49,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:49,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813867559] [2025-03-04 15:29:49,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813867559] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:29:49,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:29:49,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:29:49,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265254035] [2025-03-04 15:29:49,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:29:49,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:29:49,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:49,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:29:49,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:29:49,505 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-04 15:29:49,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 23 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-04 15:29:49,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:49,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-04 15:29:49,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:49,593 INFO L124 PetriNetUnfolderBase]: 123/260 cut-off events. [2025-03-04 15:29:49,593 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 15:29:49,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 492 conditions, 260 events. 123/260 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1082 event pairs, 43 based on Foata normal form. 0/210 useless extension candidates. Maximal degree in co-relation 486. Up to 157 conditions per place. [2025-03-04 15:29:49,596 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 22 selfloop transitions, 2 changer transitions 2/32 dead transitions. [2025-03-04 15:29:49,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 32 transitions, 125 flow [2025-03-04 15:29:49,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:29:49,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:29:49,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2025-03-04 15:29:49,598 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6206896551724138 [2025-03-04 15:29:49,598 INFO L175 Difference]: Start difference. First operand has 27 places, 23 transitions, 52 flow. Second operand 3 states and 54 transitions. [2025-03-04 15:29:49,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 32 transitions, 125 flow [2025-03-04 15:29:49,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 32 transitions, 124 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:29:49,600 INFO L231 Difference]: Finished difference. Result has 29 places, 24 transitions, 69 flow [2025-03-04 15:29:49,600 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=51, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=69, PETRI_PLACES=29, PETRI_TRANSITIONS=24} [2025-03-04 15:29:49,601 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, -1 predicate places. [2025-03-04 15:29:49,601 INFO L471 AbstractCegarLoop]: Abstraction has has 29 places, 24 transitions, 69 flow [2025-03-04 15:29:49,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-04 15:29:49,601 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:49,601 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:49,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 15:29:49,602 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:29:49,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:49,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1803390915, now seen corresponding path program 1 times [2025-03-04 15:29:49,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:49,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614037190] [2025-03-04 15:29:49,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:49,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:49,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:29:49,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:29:49,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:49,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:49,670 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-04 15:29:49,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:49,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614037190] [2025-03-04 15:29:49,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614037190] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:29:49,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:29:49,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:29:49,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925824363] [2025-03-04 15:29:49,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:29:49,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:29:49,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:49,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:29:49,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:29:49,684 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2025-03-04 15:29:49,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 24 transitions, 69 flow. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:49,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:49,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2025-03-04 15:29:49,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:49,828 INFO L124 PetriNetUnfolderBase]: 223/436 cut-off events. [2025-03-04 15:29:49,828 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2025-03-04 15:29:49,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 951 conditions, 436 events. 223/436 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1989 event pairs, 99 based on Foata normal form. 14/383 useless extension candidates. Maximal degree in co-relation 943. Up to 303 conditions per place. [2025-03-04 15:29:49,832 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 38 selfloop transitions, 3 changer transitions 1/45 dead transitions. [2025-03-04 15:29:49,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 45 transitions, 211 flow [2025-03-04 15:29:49,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:29:49,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:29:49,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2025-03-04 15:29:49,835 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5517241379310345 [2025-03-04 15:29:49,835 INFO L175 Difference]: Start difference. First operand has 29 places, 24 transitions, 69 flow. Second operand 4 states and 64 transitions. [2025-03-04 15:29:49,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 45 transitions, 211 flow [2025-03-04 15:29:49,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 45 transitions, 209 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:29:49,836 INFO L231 Difference]: Finished difference. Result has 33 places, 26 transitions, 91 flow [2025-03-04 15:29:49,836 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=91, PETRI_PLACES=33, PETRI_TRANSITIONS=26} [2025-03-04 15:29:49,837 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 3 predicate places. [2025-03-04 15:29:49,837 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 26 transitions, 91 flow [2025-03-04 15:29:49,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:49,837 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:49,837 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:49,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 15:29:49,837 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:29:49,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:49,838 INFO L85 PathProgramCache]: Analyzing trace with hash 651981522, now seen corresponding path program 1 times [2025-03-04 15:29:49,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:49,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496807909] [2025-03-04 15:29:49,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:49,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:49,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:29:49,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:29:49,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:49,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:49,886 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-04 15:29:49,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:49,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496807909] [2025-03-04 15:29:49,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496807909] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:29:49,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:29:49,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:29:49,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764118145] [2025-03-04 15:29:49,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:29:49,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:29:49,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:49,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:29:49,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:29:49,893 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-04 15:29:49,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 26 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-04 15:29:49,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:49,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-04 15:29:49,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:49,946 INFO L124 PetriNetUnfolderBase]: 113/215 cut-off events. [2025-03-04 15:29:49,946 INFO L125 PetriNetUnfolderBase]: For 85/110 co-relation queries the response was YES. [2025-03-04 15:29:49,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 548 conditions, 215 events. 113/215 cut-off events. For 85/110 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 856 event pairs, 86 based on Foata normal form. 9/195 useless extension candidates. Maximal degree in co-relation 538. Up to 195 conditions per place. [2025-03-04 15:29:49,949 INFO L140 encePairwiseOnDemand]: 27/29 looper letters, 17 selfloop transitions, 1 changer transitions 0/25 dead transitions. [2025-03-04 15:29:49,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 25 transitions, 123 flow [2025-03-04 15:29:49,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:29:49,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:29:49,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2025-03-04 15:29:49,951 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47126436781609193 [2025-03-04 15:29:49,951 INFO L175 Difference]: Start difference. First operand has 33 places, 26 transitions, 91 flow. Second operand 3 states and 41 transitions. [2025-03-04 15:29:49,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 25 transitions, 123 flow [2025-03-04 15:29:49,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 25 transitions, 121 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:29:49,952 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 87 flow [2025-03-04 15:29:49,952 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=87, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2025-03-04 15:29:49,952 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 3 predicate places. [2025-03-04 15:29:49,953 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 87 flow [2025-03-04 15:29:49,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-04 15:29:49,953 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:49,953 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:49,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 15:29:49,953 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:29:49,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:49,953 INFO L85 PathProgramCache]: Analyzing trace with hash 917577135, now seen corresponding path program 1 times [2025-03-04 15:29:49,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:49,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777878513] [2025-03-04 15:29:49,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:49,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:49,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:29:49,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:29:49,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:49,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:50,014 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-04 15:29:50,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:50,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777878513] [2025-03-04 15:29:50,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777878513] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:29:50,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:29:50,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:29:50,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167985129] [2025-03-04 15:29:50,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:29:50,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:29:50,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:50,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:29:50,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:29:50,017 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-04 15:29:50,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 87 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-04 15:29:50,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:50,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-04 15:29:50,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:50,079 INFO L124 PetriNetUnfolderBase]: 157/304 cut-off events. [2025-03-04 15:29:50,079 INFO L125 PetriNetUnfolderBase]: For 107/144 co-relation queries the response was YES. [2025-03-04 15:29:50,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 728 conditions, 304 events. 157/304 cut-off events. For 107/144 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1322 event pairs, 86 based on Foata normal form. 24/295 useless extension candidates. Maximal degree in co-relation 717. Up to 196 conditions per place. [2025-03-04 15:29:50,082 INFO L140 encePairwiseOnDemand]: 25/29 looper letters, 27 selfloop transitions, 2 changer transitions 0/36 dead transitions. [2025-03-04 15:29:50,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 36 transitions, 182 flow [2025-03-04 15:29:50,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:29:50,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:29:50,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2025-03-04 15:29:50,085 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5862068965517241 [2025-03-04 15:29:50,085 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 87 flow. Second operand 3 states and 51 transitions. [2025-03-04 15:29:50,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 36 transitions, 182 flow [2025-03-04 15:29:50,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 36 transitions, 181 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:29:50,092 INFO L231 Difference]: Finished difference. Result has 35 places, 26 transitions, 100 flow [2025-03-04 15:29:50,092 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=35, PETRI_TRANSITIONS=26} [2025-03-04 15:29:50,092 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 5 predicate places. [2025-03-04 15:29:50,092 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 26 transitions, 100 flow [2025-03-04 15:29:50,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-04 15:29:50,093 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:50,093 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:50,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:29:50,093 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:29:50,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:50,093 INFO L85 PathProgramCache]: Analyzing trace with hash 927347269, now seen corresponding path program 1 times [2025-03-04 15:29:50,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:50,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814672659] [2025-03-04 15:29:50,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:50,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:50,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:29:50,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:29:50,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:50,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:50,139 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:50,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:50,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814672659] [2025-03-04 15:29:50,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814672659] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:29:50,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799817784] [2025-03-04 15:29:50,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:50,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:50,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:50,142 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-04 15:29:50,143 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-04 15:29:50,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:29:50,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:29:50,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:50,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:50,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:29:50,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:29:50,209 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:50,209 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:29:50,232 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:50,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799817784] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:29:50,233 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:29:50,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 4 [2025-03-04 15:29:50,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479989660] [2025-03-04 15:29:50,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:29:50,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:29:50,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:50,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:29:50,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:29:50,234 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-04 15:29:50,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 100 flow. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 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-04 15:29:50,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:50,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-04 15:29:50,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:50,396 INFO L124 PetriNetUnfolderBase]: 406/1017 cut-off events. [2025-03-04 15:29:50,397 INFO L125 PetriNetUnfolderBase]: For 477/487 co-relation queries the response was YES. [2025-03-04 15:29:50,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2488 conditions, 1017 events. 406/1017 cut-off events. For 477/487 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 5857 event pairs, 45 based on Foata normal form. 17/977 useless extension candidates. Maximal degree in co-relation 2476. Up to 189 conditions per place. [2025-03-04 15:29:50,403 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 56 selfloop transitions, 14 changer transitions 0/77 dead transitions. [2025-03-04 15:29:50,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 77 transitions, 436 flow [2025-03-04 15:29:50,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:29:50,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:29:50,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 116 transitions. [2025-03-04 15:29:50,405 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-03-04 15:29:50,405 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 100 flow. Second operand 6 states and 116 transitions. [2025-03-04 15:29:50,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 77 transitions, 436 flow [2025-03-04 15:29:50,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 77 transitions, 426 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:29:50,410 INFO L231 Difference]: Finished difference. Result has 43 places, 38 transitions, 238 flow [2025-03-04 15:29:50,411 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=238, PETRI_PLACES=43, PETRI_TRANSITIONS=38} [2025-03-04 15:29:50,412 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 13 predicate places. [2025-03-04 15:29:50,412 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 38 transitions, 238 flow [2025-03-04 15:29:50,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 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-04 15:29:50,412 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:50,412 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:50,422 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-04 15:29:50,613 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,SelfDestructingSolverStorable5 [2025-03-04 15:29:50,613 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:29:50,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:50,613 INFO L85 PathProgramCache]: Analyzing trace with hash 747764541, now seen corresponding path program 1 times [2025-03-04 15:29:50,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:50,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509570187] [2025-03-04 15:29:50,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:50,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:50,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:29:50,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:29:50,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:50,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:50,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:50,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:50,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509570187] [2025-03-04 15:29:50,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509570187] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:29:50,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743428653] [2025-03-04 15:29:50,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:50,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:50,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:50,703 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-04 15:29:50,704 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-04 15:29:50,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:29:50,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:29:50,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:50,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:50,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:29:50,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:29:50,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:50,785 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:29:50,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:50,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743428653] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 15:29:50,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 15:29:50,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 8 [2025-03-04 15:29:50,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279788667] [2025-03-04 15:29:50,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:29:50,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:29:50,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:50,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:29:50,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2025-03-04 15:29:50,832 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-04 15:29:50,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 38 transitions, 238 flow. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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-04 15:29:50,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:50,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-04 15:29:50,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:50,913 INFO L124 PetriNetUnfolderBase]: 358/768 cut-off events. [2025-03-04 15:29:50,913 INFO L125 PetriNetUnfolderBase]: For 1393/1454 co-relation queries the response was YES. [2025-03-04 15:29:50,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2332 conditions, 768 events. 358/768 cut-off events. For 1393/1454 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3902 event pairs, 68 based on Foata normal form. 11/761 useless extension candidates. Maximal degree in co-relation 2315. Up to 510 conditions per place. [2025-03-04 15:29:50,917 INFO L140 encePairwiseOnDemand]: 25/29 looper letters, 40 selfloop transitions, 4 changer transitions 0/51 dead transitions. [2025-03-04 15:29:50,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 51 transitions, 376 flow [2025-03-04 15:29:50,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:29:50,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:29:50,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2025-03-04 15:29:50,918 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5086206896551724 [2025-03-04 15:29:50,918 INFO L175 Difference]: Start difference. First operand has 43 places, 38 transitions, 238 flow. Second operand 4 states and 59 transitions. [2025-03-04 15:29:50,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 51 transitions, 376 flow [2025-03-04 15:29:50,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 51 transitions, 364 flow, removed 6 selfloop flow, removed 0 redundant places. [2025-03-04 15:29:50,924 INFO L231 Difference]: Finished difference. Result has 47 places, 38 transitions, 236 flow [2025-03-04 15:29:50,925 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=236, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2025-03-04 15:29:50,926 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 17 predicate places. [2025-03-04 15:29:50,926 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 236 flow [2025-03-04 15:29:50,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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-04 15:29:50,928 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:50,929 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:50,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 15:29:51,129 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,SelfDestructingSolverStorable6 [2025-03-04 15:29:51,129 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:29:51,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:51,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1531288944, now seen corresponding path program 1 times [2025-03-04 15:29:51,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:51,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131891278] [2025-03-04 15:29:51,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:51,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:51,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:29:51,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:29:51,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:51,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:51,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:51,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:51,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131891278] [2025-03-04 15:29:51,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131891278] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:29:51,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86672713] [2025-03-04 15:29:51,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:51,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:51,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:51,206 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-04 15:29:51,208 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-04 15:29:51,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:29:51,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:29:51,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:51,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:51,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:29:51,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:29:51,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:29:51,280 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:29:51,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86672713] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:29:51,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:29:51,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2025-03-04 15:29:51,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715971618] [2025-03-04 15:29:51,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:29:51,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:29:51,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:51,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:29:51,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 15:29:51,284 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2025-03-04 15:29:51,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 236 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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-04 15:29:51,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:51,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2025-03-04 15:29:51,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:51,371 INFO L124 PetriNetUnfolderBase]: 423/788 cut-off events. [2025-03-04 15:29:51,371 INFO L125 PetriNetUnfolderBase]: For 1275/1356 co-relation queries the response was YES. [2025-03-04 15:29:51,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2441 conditions, 788 events. 423/788 cut-off events. For 1275/1356 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 3722 event pairs, 145 based on Foata normal form. 29/722 useless extension candidates. Maximal degree in co-relation 2422. Up to 366 conditions per place. [2025-03-04 15:29:51,375 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 30 selfloop transitions, 10 changer transitions 4/50 dead transitions. [2025-03-04 15:29:51,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 50 transitions, 376 flow [2025-03-04 15:29:51,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:29:51,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:29:51,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2025-03-04 15:29:51,376 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45689655172413796 [2025-03-04 15:29:51,376 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 236 flow. Second operand 4 states and 53 transitions. [2025-03-04 15:29:51,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 50 transitions, 376 flow [2025-03-04 15:29:51,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 50 transitions, 372 flow, removed 2 selfloop flow, removed 0 redundant places. [2025-03-04 15:29:51,381 INFO L231 Difference]: Finished difference. Result has 50 places, 34 transitions, 233 flow [2025-03-04 15:29:51,382 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=233, PETRI_PLACES=50, PETRI_TRANSITIONS=34} [2025-03-04 15:29:51,382 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 20 predicate places. [2025-03-04 15:29:51,382 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 34 transitions, 233 flow [2025-03-04 15:29:51,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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-04 15:29:51,382 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:51,382 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:51,389 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 15:29:51,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:51,583 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:29:51,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:51,583 INFO L85 PathProgramCache]: Analyzing trace with hash 2122503176, now seen corresponding path program 1 times [2025-03-04 15:29:51,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:51,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283173306] [2025-03-04 15:29:51,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:51,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:51,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:29:51,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:29:51,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:51,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:51,639 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-04 15:29:51,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:51,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283173306] [2025-03-04 15:29:51,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283173306] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:29:51,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [454774435] [2025-03-04 15:29:51,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:51,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:51,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:51,641 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-04 15:29:51,642 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-04 15:29:51,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:29:51,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:29:51,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:51,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:51,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:29:51,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:29:51,695 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-04 15:29:51,695 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:29:51,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [454774435] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:29:51,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:29:51,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-04 15:29:51,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924274479] [2025-03-04 15:29:51,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:29:51,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:29:51,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:51,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:29:51,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:29:51,703 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2025-03-04 15:29:51,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 34 transitions, 233 flow. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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-04 15:29:51,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:51,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2025-03-04 15:29:51,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:51,838 INFO L124 PetriNetUnfolderBase]: 362/749 cut-off events. [2025-03-04 15:29:51,838 INFO L125 PetriNetUnfolderBase]: For 1899/1931 co-relation queries the response was YES. [2025-03-04 15:29:51,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2418 conditions, 749 events. 362/749 cut-off events. For 1899/1931 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 3256 event pairs, 4 based on Foata normal form. 44/749 useless extension candidates. Maximal degree in co-relation 2396. Up to 281 conditions per place. [2025-03-04 15:29:51,842 INFO L140 encePairwiseOnDemand]: 25/29 looper letters, 58 selfloop transitions, 5 changer transitions 0/67 dead transitions. [2025-03-04 15:29:51,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 67 transitions, 597 flow [2025-03-04 15:29:51,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:29:51,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:29:51,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2025-03-04 15:29:51,844 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41379310344827586 [2025-03-04 15:29:51,844 INFO L175 Difference]: Start difference. First operand has 50 places, 34 transitions, 233 flow. Second operand 6 states and 72 transitions. [2025-03-04 15:29:51,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 67 transitions, 597 flow [2025-03-04 15:29:51,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 67 transitions, 569 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:29:51,846 INFO L231 Difference]: Finished difference. Result has 50 places, 33 transitions, 229 flow [2025-03-04 15:29:51,846 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=229, PETRI_PLACES=50, PETRI_TRANSITIONS=33} [2025-03-04 15:29:51,847 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 20 predicate places. [2025-03-04 15:29:51,847 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 33 transitions, 229 flow [2025-03-04 15:29:51,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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-04 15:29:51,847 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:51,847 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 15:29:51,853 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-04 15:29:52,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:52,050 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:29:52,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:52,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1373089206, now seen corresponding path program 1 times [2025-03-04 15:29:52,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:52,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673449332] [2025-03-04 15:29:52,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:52,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:52,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:29:52,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:29:52,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:52,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:52,099 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-04 15:29:52,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:52,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673449332] [2025-03-04 15:29:52,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673449332] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:29:52,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392821234] [2025-03-04 15:29:52,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:52,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:52,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:52,101 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-04 15:29:52,103 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-04 15:29:52,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:29:52,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:29:52,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:52,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:52,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:29:52,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:29:52,158 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-04 15:29:52,158 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:29:52,203 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-04 15:29:52,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392821234] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:29:52,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:29:52,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-04 15:29:52,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004993023] [2025-03-04 15:29:52,203 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:29:52,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 15:29:52,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:52,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 15:29:52,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 15:29:52,223 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2025-03-04 15:29:52,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 33 transitions, 229 flow. Second operand has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 12 states have internal predecessors, (80), 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-04 15:29:52,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:52,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2025-03-04 15:29:52,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:52,429 INFO L124 PetriNetUnfolderBase]: 560/1166 cut-off events. [2025-03-04 15:29:52,429 INFO L125 PetriNetUnfolderBase]: For 2730/2758 co-relation queries the response was YES. [2025-03-04 15:29:52,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3827 conditions, 1166 events. 560/1166 cut-off events. For 2730/2758 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 5482 event pairs, 134 based on Foata normal form. 72/1236 useless extension candidates. Maximal degree in co-relation 3805. Up to 356 conditions per place. [2025-03-04 15:29:52,438 INFO L140 encePairwiseOnDemand]: 25/29 looper letters, 105 selfloop transitions, 9 changer transitions 0/118 dead transitions. [2025-03-04 15:29:52,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 118 transitions, 1020 flow [2025-03-04 15:29:52,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:29:52,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 15:29:52,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions. [2025-03-04 15:29:52,440 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4379310344827586 [2025-03-04 15:29:52,440 INFO L175 Difference]: Start difference. First operand has 50 places, 33 transitions, 229 flow. Second operand 10 states and 127 transitions. [2025-03-04 15:29:52,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 118 transitions, 1020 flow [2025-03-04 15:29:52,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 118 transitions, 1005 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-03-04 15:29:52,446 INFO L231 Difference]: Finished difference. Result has 58 places, 39 transitions, 284 flow [2025-03-04 15:29:52,446 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=284, PETRI_PLACES=58, PETRI_TRANSITIONS=39} [2025-03-04 15:29:52,447 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 28 predicate places. [2025-03-04 15:29:52,447 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 39 transitions, 284 flow [2025-03-04 15:29:52,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 12 states have internal predecessors, (80), 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-04 15:29:52,447 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:52,447 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1] [2025-03-04 15:29:52,453 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-04 15:29:52,647 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,SelfDestructingSolverStorable9 [2025-03-04 15:29:52,648 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:29:52,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:52,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1672215930, now seen corresponding path program 2 times [2025-03-04 15:29:52,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:52,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397996376] [2025-03-04 15:29:52,648 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:29:52,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:52,652 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-04 15:29:52,656 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 15:29:52,656 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:29:52,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:52,709 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:52,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:52,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397996376] [2025-03-04 15:29:52,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397996376] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:29:52,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762609661] [2025-03-04 15:29:52,710 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:29:52,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:52,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:52,712 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-04 15:29:52,713 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-04 15:29:52,737 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-04 15:29:52,747 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 15:29:52,747 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:29:52,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:52,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 15:29:52,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:29:52,775 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:52,776 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:29:52,840 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:52,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762609661] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:29:52,840 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:29:52,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-04 15:29:52,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063310928] [2025-03-04 15:29:52,841 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:29:52,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 15:29:52,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:52,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 15:29:52,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-03-04 15:29:52,842 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-04 15:29:52,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 39 transitions, 284 flow. Second operand has 12 states, 12 states have (on average 10.0) internal successors, (120), 12 states have internal predecessors, (120), 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-04 15:29:52,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:52,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-04 15:29:52,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:53,120 INFO L124 PetriNetUnfolderBase]: 759/2019 cut-off events. [2025-03-04 15:29:53,120 INFO L125 PetriNetUnfolderBase]: For 7292/7370 co-relation queries the response was YES. [2025-03-04 15:29:53,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6832 conditions, 2019 events. 759/2019 cut-off events. For 7292/7370 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 12174 event pairs, 57 based on Foata normal form. 88/2106 useless extension candidates. Maximal degree in co-relation 6808. Up to 371 conditions per place. [2025-03-04 15:29:53,136 INFO L140 encePairwiseOnDemand]: 25/29 looper letters, 93 selfloop transitions, 40 changer transitions 0/143 dead transitions. [2025-03-04 15:29:53,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 143 transitions, 1210 flow [2025-03-04 15:29:53,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 15:29:53,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 15:29:53,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 198 transitions. [2025-03-04 15:29:53,137 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5689655172413793 [2025-03-04 15:29:53,137 INFO L175 Difference]: Start difference. First operand has 58 places, 39 transitions, 284 flow. Second operand 12 states and 198 transitions. [2025-03-04 15:29:53,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 143 transitions, 1210 flow [2025-03-04 15:29:53,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 143 transitions, 1181 flow, removed 12 selfloop flow, removed 2 redundant places. [2025-03-04 15:29:53,147 INFO L231 Difference]: Finished difference. Result has 77 places, 73 transitions, 760 flow [2025-03-04 15:29:53,147 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=760, PETRI_PLACES=77, PETRI_TRANSITIONS=73} [2025-03-04 15:29:53,148 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 47 predicate places. [2025-03-04 15:29:53,148 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 73 transitions, 760 flow [2025-03-04 15:29:53,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.0) internal successors, (120), 12 states have internal predecessors, (120), 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-04 15:29:53,148 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:53,148 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1] [2025-03-04 15:29:53,156 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-04 15:29:53,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:53,353 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:29:53,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:53,353 INFO L85 PathProgramCache]: Analyzing trace with hash -340649375, now seen corresponding path program 2 times [2025-03-04 15:29:53,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:53,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821421346] [2025-03-04 15:29:53,354 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:29:53,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:53,358 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-04 15:29:53,360 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 28 statements. [2025-03-04 15:29:53,360 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:29:53,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:53,387 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-04 15:29:53,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:53,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821421346] [2025-03-04 15:29:53,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821421346] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:29:53,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125281416] [2025-03-04 15:29:53,389 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:29:53,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:53,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:53,391 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-04 15:29:53,392 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-04 15:29:53,413 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-04 15:29:53,418 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 28 statements. [2025-03-04 15:29:53,418 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:29:53,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:53,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:29:53,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:29:53,455 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-04 15:29:53,455 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:29:53,487 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-04 15:29:53,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125281416] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:29:53,487 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:29:53,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-03-04 15:29:53,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417445308] [2025-03-04 15:29:53,487 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:29:53,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:29:53,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:53,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:29:53,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:29:53,498 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 29 [2025-03-04 15:29:53,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 73 transitions, 760 flow. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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-04 15:29:53,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:53,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 29 [2025-03-04 15:29:53,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:53,752 INFO L124 PetriNetUnfolderBase]: 1482/2819 cut-off events. [2025-03-04 15:29:53,752 INFO L125 PetriNetUnfolderBase]: For 12861/12943 co-relation queries the response was YES. [2025-03-04 15:29:53,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10738 conditions, 2819 events. 1482/2819 cut-off events. For 12861/12943 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 13992 event pairs, 230 based on Foata normal form. 124/2943 useless extension candidates. Maximal degree in co-relation 10702. Up to 1240 conditions per place. [2025-03-04 15:29:53,768 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 118 selfloop transitions, 13 changer transitions 0/134 dead transitions. [2025-03-04 15:29:53,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 134 transitions, 1748 flow [2025-03-04 15:29:53,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:29:53,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:29:53,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2025-03-04 15:29:53,769 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3310344827586207 [2025-03-04 15:29:53,769 INFO L175 Difference]: Start difference. First operand has 77 places, 73 transitions, 760 flow. Second operand 5 states and 48 transitions. [2025-03-04 15:29:53,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 134 transitions, 1748 flow [2025-03-04 15:29:53,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 134 transitions, 1524 flow, removed 108 selfloop flow, removed 4 redundant places. [2025-03-04 15:29:53,793 INFO L231 Difference]: Finished difference. Result has 77 places, 73 transitions, 684 flow [2025-03-04 15:29:53,793 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=646, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=684, PETRI_PLACES=77, PETRI_TRANSITIONS=73} [2025-03-04 15:29:53,795 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 47 predicate places. [2025-03-04 15:29:53,795 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 73 transitions, 684 flow [2025-03-04 15:29:53,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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-04 15:29:53,795 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:53,795 INFO L206 CegarLoopForPetriNet]: trace histogram [11, 10, 10, 10, 10, 1, 1, 1, 1] [2025-03-04 15:29:53,801 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-04 15:29:53,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:53,999 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:29:54,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:54,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1217674726, now seen corresponding path program 3 times [2025-03-04 15:29:54,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:54,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724247561] [2025-03-04 15:29:54,003 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:29:54,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:54,007 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 55 statements into 11 equivalence classes. [2025-03-04 15:29:54,022 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 15:29:54,022 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-04 15:29:54,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:54,177 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:54,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:54,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724247561] [2025-03-04 15:29:54,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724247561] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:29:54,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095420130] [2025-03-04 15:29:54,178 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:29:54,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:54,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:54,180 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-04 15:29:54,181 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-04 15:29:54,205 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 55 statements into 11 equivalence classes. [2025-03-04 15:29:54,221 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 15:29:54,221 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-04 15:29:54,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:54,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 15:29:54,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:29:54,296 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:54,297 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:29:54,502 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:54,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1095420130] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:29:54,503 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:29:54,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2025-03-04 15:29:54,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985258771] [2025-03-04 15:29:54,503 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:29:54,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 15:29:54,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:54,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 15:29:54,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2025-03-04 15:29:54,505 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-04 15:29:54,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 73 transitions, 684 flow. Second operand has 24 states, 24 states have (on average 10.0) internal successors, (240), 24 states have internal predecessors, (240), 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-04 15:29:54,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:54,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-04 15:29:54,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:55,137 INFO L124 PetriNetUnfolderBase]: 1587/4081 cut-off events. [2025-03-04 15:29:55,137 INFO L125 PetriNetUnfolderBase]: For 37525/37679 co-relation queries the response was YES. [2025-03-04 15:29:55,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14816 conditions, 4081 events. 1587/4081 cut-off events. For 37525/37679 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 23439 event pairs, 65 based on Foata normal form. 184/4264 useless extension candidates. Maximal degree in co-relation 14781. Up to 811 conditions per place. [2025-03-04 15:29:55,160 INFO L140 encePairwiseOnDemand]: 25/29 looper letters, 167 selfloop transitions, 144 changer transitions 0/321 dead transitions. [2025-03-04 15:29:55,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 321 transitions, 2980 flow [2025-03-04 15:29:55,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 15:29:55,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-03-04 15:29:55,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 402 transitions. [2025-03-04 15:29:55,162 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5775862068965517 [2025-03-04 15:29:55,162 INFO L175 Difference]: Start difference. First operand has 77 places, 73 transitions, 684 flow. Second operand 24 states and 402 transitions. [2025-03-04 15:29:55,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 321 transitions, 2980 flow [2025-03-04 15:29:55,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 321 transitions, 2930 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:29:55,180 INFO L231 Difference]: Finished difference. Result has 119 places, 179 transitions, 2247 flow [2025-03-04 15:29:55,180 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=666, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=2247, PETRI_PLACES=119, PETRI_TRANSITIONS=179} [2025-03-04 15:29:55,181 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 89 predicate places. [2025-03-04 15:29:55,181 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 179 transitions, 2247 flow [2025-03-04 15:29:55,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 10.0) internal successors, (240), 24 states have internal predecessors, (240), 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-04 15:29:55,181 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:55,181 INFO L206 CegarLoopForPetriNet]: trace histogram [23, 22, 22, 22, 22, 1, 1, 1, 1] [2025-03-04 15:29:55,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 15:29:55,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-04 15:29:55,382 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:29:55,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:55,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1453341862, now seen corresponding path program 4 times [2025-03-04 15:29:55,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:55,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287613177] [2025-03-04 15:29:55,383 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:29:55,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:55,391 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 115 statements into 2 equivalence classes. [2025-03-04 15:29:55,414 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 15:29:55,414 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:29:55,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:55,899 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:55,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:55,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287613177] [2025-03-04 15:29:55,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287613177] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:29:55,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [841704086] [2025-03-04 15:29:55,900 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:29:55,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:55,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:55,902 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:29:55,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 15:29:55,936 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 115 statements into 2 equivalence classes. [2025-03-04 15:29:55,961 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 15:29:55,961 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:29:55,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:55,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 15:29:55,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:29:56,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:56,095 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:29:56,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:56,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [841704086] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:29:56,795 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:29:56,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 46 [2025-03-04 15:29:56,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313681815] [2025-03-04 15:29:56,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:29:56,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-04 15:29:56,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:56,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-04 15:29:56,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2025-03-04 15:29:56,800 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-04 15:29:56,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 179 transitions, 2247 flow. Second operand has 48 states, 48 states have (on average 10.0) internal successors, (480), 48 states have internal predecessors, (480), 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-04 15:29:56,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:56,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-04 15:29:56,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:58,821 INFO L124 PetriNetUnfolderBase]: 4119/10737 cut-off events. [2025-03-04 15:29:58,822 INFO L125 PetriNetUnfolderBase]: For 288653/288989 co-relation queries the response was YES. [2025-03-04 15:29:58,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40501 conditions, 10737 events. 4119/10737 cut-off events. For 288653/288989 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 67341 event pairs, 97 based on Foata normal form. 376/11112 useless extension candidates. Maximal degree in co-relation 40443. Up to 2443 conditions per place. [2025-03-04 15:29:58,918 INFO L140 encePairwiseOnDemand]: 25/29 looper letters, 313 selfloop transitions, 500 changer transitions 0/823 dead transitions. [2025-03-04 15:29:58,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 823 transitions, 9747 flow [2025-03-04 15:29:58,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-04 15:29:58,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2025-03-04 15:29:58,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 810 transitions. [2025-03-04 15:29:58,925 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5818965517241379 [2025-03-04 15:29:58,926 INFO L175 Difference]: Start difference. First operand has 119 places, 179 transitions, 2247 flow. Second operand 48 states and 810 transitions. [2025-03-04 15:29:58,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 823 transitions, 9747 flow [2025-03-04 15:29:59,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 823 transitions, 8002 flow, removed 849 selfloop flow, removed 4 redundant places. [2025-03-04 15:29:59,080 INFO L231 Difference]: Finished difference. Result has 208 places, 537 transitions, 7115 flow [2025-03-04 15:29:59,082 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1944, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=149, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=48, PETRI_FLOW=7115, PETRI_PLACES=208, PETRI_TRANSITIONS=537} [2025-03-04 15:29:59,083 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 178 predicate places. [2025-03-04 15:29:59,083 INFO L471 AbstractCegarLoop]: Abstraction has has 208 places, 537 transitions, 7115 flow [2025-03-04 15:29:59,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 10.0) internal successors, (480), 48 states have internal predecessors, (480), 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-04 15:29:59,084 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:59,085 INFO L206 CegarLoopForPetriNet]: trace histogram [47, 46, 46, 46, 46, 1, 1, 1, 1] [2025-03-04 15:29:59,091 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 15:29:59,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-04 15:29:59,289 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:29:59,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:59,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1018275290, now seen corresponding path program 5 times [2025-03-04 15:29:59,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:59,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627142562] [2025-03-04 15:29:59,291 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:29:59,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:59,306 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 235 statements into 47 equivalence classes. [2025-03-04 15:29:59,394 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 235 of 235 statements. [2025-03-04 15:29:59,394 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-03-04 15:29:59,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:00,847 INFO L134 CoverageAnalysis]: Checked inductivity of 5267 backedges. 0 proven. 5267 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:30:00,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:30:00,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627142562] [2025-03-04 15:30:00,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627142562] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:30:00,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638384482] [2025-03-04 15:30:00,847 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:30:00,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:30:00,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:30:00,849 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:30:00,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 15:30:00,884 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 235 statements into 47 equivalence classes. [2025-03-04 15:30:00,959 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 235 of 235 statements. [2025-03-04 15:30:00,960 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-03-04 15:30:00,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:00,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-04 15:30:00,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:30:01,176 INFO L134 CoverageAnalysis]: Checked inductivity of 5267 backedges. 0 proven. 5267 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:30:01,176 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:30:03,142 INFO L134 CoverageAnalysis]: Checked inductivity of 5267 backedges. 0 proven. 5267 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:30:03,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638384482] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:30:03,142 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:30:03,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 94 [2025-03-04 15:30:03,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691174493] [2025-03-04 15:30:03,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:30:03,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2025-03-04 15:30:03,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:30:03,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2025-03-04 15:30:03,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2025-03-04 15:30:03,148 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-04 15:30:03,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 537 transitions, 7115 flow. Second operand has 96 states, 96 states have (on average 10.0) internal successors, (960), 96 states have internal predecessors, (960), 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-04 15:30:03,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:30:03,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-04 15:30:03,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:30:13,413 INFO L124 PetriNetUnfolderBase]: 12651/33281 cut-off events. [2025-03-04 15:30:13,413 INFO L125 PetriNetUnfolderBase]: For 2246611/2247321 co-relation queries the response was YES. [2025-03-04 15:30:13,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125619 conditions, 33281 events. 12651/33281 cut-off events. For 2246611/2247321 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 241074 event pairs, 177 based on Foata normal form. 760/34040 useless extension candidates. Maximal degree in co-relation 125517. Up to 8011 conditions per place. [2025-03-04 15:30:14,131 INFO L140 encePairwiseOnDemand]: 25/29 looper letters, 603 selfloop transitions, 1792 changer transitions 0/2405 dead transitions. [2025-03-04 15:30:14,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 2405 transitions, 31135 flow [2025-03-04 15:30:14,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-03-04 15:30:14,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2025-03-04 15:30:14,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 1626 transitions. [2025-03-04 15:30:14,144 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.584051724137931 [2025-03-04 15:30:14,144 INFO L175 Difference]: Start difference. First operand has 208 places, 537 transitions, 7115 flow. Second operand 96 states and 1626 transitions. [2025-03-04 15:30:14,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 2405 transitions, 31135 flow [2025-03-04 15:30:15,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 2405 transitions, 24622 flow, removed 3147 selfloop flow, removed 10 redundant places. [2025-03-04 15:30:15,060 INFO L231 Difference]: Finished difference. Result has 387 places, 1831 transitions, 24491 flow [2025-03-04 15:30:15,061 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=6364, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=537, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=505, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=96, PETRI_FLOW=24491, PETRI_PLACES=387, PETRI_TRANSITIONS=1831} [2025-03-04 15:30:15,061 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 357 predicate places. [2025-03-04 15:30:15,061 INFO L471 AbstractCegarLoop]: Abstraction has has 387 places, 1831 transitions, 24491 flow [2025-03-04 15:30:15,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 96 states have (on average 10.0) internal successors, (960), 96 states have internal predecessors, (960), 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-04 15:30:15,062 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:30:15,062 INFO L206 CegarLoopForPetriNet]: trace histogram [95, 94, 94, 94, 94, 1, 1, 1, 1] [2025-03-04 15:30:15,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 15:30:15,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 15:30:15,263 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:30:15,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:30:15,266 INFO L85 PathProgramCache]: Analyzing trace with hash -2118325542, now seen corresponding path program 6 times [2025-03-04 15:30:15,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:30:15,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193475019] [2025-03-04 15:30:15,266 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 15:30:15,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:30:15,287 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 475 statements into 95 equivalence classes. [2025-03-04 15:30:15,645 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) and asserted 475 of 475 statements. [2025-03-04 15:30:15,645 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2025-03-04 15:30:15,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:20,229 INFO L134 CoverageAnalysis]: Checked inductivity of 22043 backedges. 0 proven. 22043 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:30:20,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:30:20,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193475019] [2025-03-04 15:30:20,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193475019] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:30:20,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594490321] [2025-03-04 15:30:20,229 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 15:30:20,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:30:20,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:30:20,231 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:30:20,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 15:30:20,280 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 475 statements into 95 equivalence classes. [2025-03-04 15:30:20,439 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) and asserted 475 of 475 statements. [2025-03-04 15:30:20,439 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2025-03-04 15:30:20,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:20,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 1081 conjuncts, 97 conjuncts are in the unsatisfiable core [2025-03-04 15:30:20,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:30:20,818 INFO L134 CoverageAnalysis]: Checked inductivity of 22043 backedges. 0 proven. 22043 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:30:20,818 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:30:27,877 INFO L134 CoverageAnalysis]: Checked inductivity of 22043 backedges. 0 proven. 22043 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:30:27,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [594490321] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:30:27,878 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:30:27,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 190 [2025-03-04 15:30:27,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542455124] [2025-03-04 15:30:27,878 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:30:27,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 192 states [2025-03-04 15:30:27,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:30:27,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2025-03-04 15:30:27,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2025-03-04 15:30:27,890 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-04 15:30:27,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 387 places, 1831 transitions, 24491 flow. Second operand has 192 states, 192 states have (on average 10.0) internal successors, (1920), 192 states have internal predecessors, (1920), 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-04 15:30:27,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:30:27,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-04 15:30:27,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand