./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/chl-array-int-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-array-int-symm.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 8a0558934008acf79b7e5b205fa256c568a1b783af274566f36b253458639325 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 19:40:11,584 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 19:40:11,627 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 19:40:11,631 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 19:40:11,631 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 19:40:11,654 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 19:40:11,654 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 19:40:11,654 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 19:40:11,655 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 19:40:11,655 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 19:40:11,656 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 19:40:11,656 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 19:40:11,656 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 19:40:11,656 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 19:40:11,657 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 19:40:11,657 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 19:40:11,657 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 19:40:11,657 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 19:40:11,657 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 19:40:11,657 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 19:40:11,657 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 19:40:11,657 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 19:40:11,657 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 19:40:11,657 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 19:40:11,657 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 19:40:11,657 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 19:40:11,657 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 19:40:11,657 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 19:40:11,657 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 19:40:11,658 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 19:40:11,658 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 19:40:11,658 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 19:40:11,658 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 19:40:11,658 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 19:40:11,658 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 19:40:11,658 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 19:40:11,658 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 19:40:11,658 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 19:40:11,658 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 19:40:11,658 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 19:40:11,658 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 19:40:11,658 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 19:40:11,658 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 19:40:11,659 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 19:40:11,659 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 19:40:11,659 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 -> 8a0558934008acf79b7e5b205fa256c568a1b783af274566f36b253458639325 [2025-03-17 19:40:11,852 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 19:40:11,861 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 19:40:11,862 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 19:40:11,863 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 19:40:11,863 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 19:40:11,866 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-array-int-symm.wvr.c [2025-03-17 19:40:13,078 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15d60d702/c4aea9f249304a0c8a56ad462005ce9c/FLAG15fed1b53 [2025-03-17 19:40:13,361 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 19:40:13,365 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-array-int-symm.wvr.c [2025-03-17 19:40:13,373 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15d60d702/c4aea9f249304a0c8a56ad462005ce9c/FLAG15fed1b53 [2025-03-17 19:40:13,391 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15d60d702/c4aea9f249304a0c8a56ad462005ce9c [2025-03-17 19:40:13,393 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 19:40:13,394 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 19:40:13,396 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 19:40:13,396 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 19:40:13,399 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 19:40:13,401 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:40:13" (1/1) ... [2025-03-17 19:40:13,403 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@191d48b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:40:13, skipping insertion in model container [2025-03-17 19:40:13,403 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:40:13" (1/1) ... [2025-03-17 19:40:13,419 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 19:40:13,539 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:40:13,547 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 19:40:13,570 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:40:13,582 INFO L204 MainTranslator]: Completed translation [2025-03-17 19:40:13,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:40:13 WrapperNode [2025-03-17 19:40:13,583 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 19:40:13,583 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 19:40:13,583 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 19:40:13,583 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 19:40:13,588 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:40:13" (1/1) ... [2025-03-17 19:40:13,595 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:40:13" (1/1) ... [2025-03-17 19:40:13,618 INFO L138 Inliner]: procedures = 24, calls = 30, calls flagged for inlining = 14, calls inlined = 18, statements flattened = 223 [2025-03-17 19:40:13,618 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 19:40:13,619 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 19:40:13,619 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 19:40:13,619 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 19:40:13,625 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:40:13" (1/1) ... [2025-03-17 19:40:13,625 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:40:13" (1/1) ... [2025-03-17 19:40:13,627 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:40:13" (1/1) ... [2025-03-17 19:40:13,644 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-03-17 19:40:13,645 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:40:13" (1/1) ... [2025-03-17 19:40:13,646 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:40:13" (1/1) ... [2025-03-17 19:40:13,653 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:40:13" (1/1) ... [2025-03-17 19:40:13,655 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:40:13" (1/1) ... [2025-03-17 19:40:13,656 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:40:13" (1/1) ... [2025-03-17 19:40:13,657 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:40:13" (1/1) ... [2025-03-17 19:40:13,662 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 19:40:13,663 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 19:40:13,663 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 19:40:13,663 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 19:40:13,663 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:40:13" (1/1) ... [2025-03-17 19:40:13,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 19:40:13,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:40:13,695 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 19:40:13,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 19:40:13,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 19:40:13,717 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-17 19:40:13,717 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-17 19:40:13,718 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-17 19:40:13,718 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-17 19:40:13,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 19:40:13,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 19:40:13,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 19:40:13,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 19:40:13,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 19:40:13,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 19:40:13,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 19:40:13,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 19:40:13,719 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 19:40:13,720 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 19:40:13,804 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 19:40:13,805 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 19:40:14,121 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 19:40:14,121 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 19:40:14,321 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 19:40:14,321 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 19:40:14,321 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:40:14 BoogieIcfgContainer [2025-03-17 19:40:14,321 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 19:40:14,323 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 19:40:14,323 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 19:40:14,326 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 19:40:14,326 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 07:40:13" (1/3) ... [2025-03-17 19:40:14,327 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@694115ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 07:40:14, skipping insertion in model container [2025-03-17 19:40:14,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:40:13" (2/3) ... [2025-03-17 19:40:14,328 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@694115ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 07:40:14, skipping insertion in model container [2025-03-17 19:40:14,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:40:14" (3/3) ... [2025-03-17 19:40:14,329 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-array-int-symm.wvr.c [2025-03-17 19:40:14,342 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 19:40:14,343 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-array-int-symm.wvr.c that has 3 procedures, 77 locations, 1 initial locations, 4 loop locations, and 24 error locations. [2025-03-17 19:40:14,343 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 19:40:14,401 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-17 19:40:14,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 86 transitions, 186 flow [2025-03-17 19:40:14,461 INFO L124 PetriNetUnfolderBase]: 10/84 cut-off events. [2025-03-17 19:40:14,464 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 19:40:14,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 84 events. 10/84 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 296 event pairs, 0 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2025-03-17 19:40:14,468 INFO L82 GeneralOperation]: Start removeDead. Operand has 83 places, 86 transitions, 186 flow [2025-03-17 19:40:14,471 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 79 places, 82 transitions, 173 flow [2025-03-17 19:40:14,479 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 19:40:14,488 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;@510f4383, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 19:40:14,488 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2025-03-17 19:40:14,492 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 19:40:14,492 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-03-17 19:40:14,492 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 19:40:14,492 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:40:14,493 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-17 19:40:14,493 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-17 19:40:14,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:40:14,497 INFO L85 PathProgramCache]: Analyzing trace with hash 637764, now seen corresponding path program 1 times [2025-03-17 19:40:14,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:40:14,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173615686] [2025-03-17 19:40:14,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:40:14,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:40:14,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:40:14,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:40:14,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:40:14,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:40:14,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:40:14,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:40:14,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173615686] [2025-03-17 19:40:14,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173615686] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:40:14,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:40:14,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:40:14,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35540906] [2025-03-17 19:40:14,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:40:14,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:40:14,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:40:14,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:40:14,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:40:14,723 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 86 [2025-03-17 19:40:14,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 82 transitions, 173 flow. Second operand has 4 states, 4 states have (on average 44.75) internal successors, (179), 4 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:40:14,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:40:14,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 86 [2025-03-17 19:40:14,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:40:14,958 INFO L124 PetriNetUnfolderBase]: 498/1342 cut-off events. [2025-03-17 19:40:14,959 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-03-17 19:40:14,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2135 conditions, 1342 events. 498/1342 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 9518 event pairs, 306 based on Foata normal form. 2/1056 useless extension candidates. Maximal degree in co-relation 2032. Up to 754 conditions per place. [2025-03-17 19:40:14,971 INFO L140 encePairwiseOnDemand]: 75/86 looper letters, 39 selfloop transitions, 7 changer transitions 0/88 dead transitions. [2025-03-17 19:40:14,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 88 transitions, 277 flow [2025-03-17 19:40:14,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:40:14,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 19:40:14,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 226 transitions. [2025-03-17 19:40:14,981 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6569767441860465 [2025-03-17 19:40:14,982 INFO L175 Difference]: Start difference. First operand has 79 places, 82 transitions, 173 flow. Second operand 4 states and 226 transitions. [2025-03-17 19:40:14,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 88 transitions, 277 flow [2025-03-17 19:40:14,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 88 transitions, 272 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 19:40:14,990 INFO L231 Difference]: Finished difference. Result has 82 places, 88 transitions, 228 flow [2025-03-17 19:40:14,991 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=228, PETRI_PLACES=82, PETRI_TRANSITIONS=88} [2025-03-17 19:40:14,994 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 3 predicate places. [2025-03-17 19:40:14,995 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 88 transitions, 228 flow [2025-03-17 19:40:14,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.75) internal successors, (179), 4 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:40:14,996 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:40:14,996 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-17 19:40:14,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 19:40:14,996 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-17 19:40:14,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:40:14,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1820307492, now seen corresponding path program 1 times [2025-03-17 19:40:14,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:40:14,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422250013] [2025-03-17 19:40:14,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:40:14,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:40:15,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:40:15,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:40:15,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:40:15,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:40:15,110 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-17 19:40:15,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:40:15,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422250013] [2025-03-17 19:40:15,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422250013] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:40:15,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204442323] [2025-03-17 19:40:15,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:40:15,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:40:15,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:40:15,113 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:40:15,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 19:40:15,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:40:15,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:40:15,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:40:15,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:40:15,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 19:40:15,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:40:15,205 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:40:15,205 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:40:15,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [204442323] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:40:15,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:40:15,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-17 19:40:15,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948268148] [2025-03-17 19:40:15,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:40:15,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 19:40:15,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:40:15,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 19:40:15,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 19:40:15,219 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 86 [2025-03-17 19:40:15,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 88 transitions, 228 flow. Second operand has 6 states, 6 states have (on average 44.833333333333336) internal successors, (269), 6 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:40:15,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:40:15,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 86 [2025-03-17 19:40:15,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:40:15,446 INFO L124 PetriNetUnfolderBase]: 498/1340 cut-off events. [2025-03-17 19:40:15,447 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-03-17 19:40:15,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2144 conditions, 1340 events. 498/1340 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 9489 event pairs, 306 based on Foata normal form. 2/1057 useless extension candidates. Maximal degree in co-relation 2094. Up to 744 conditions per place. [2025-03-17 19:40:15,452 INFO L140 encePairwiseOnDemand]: 77/86 looper letters, 32 selfloop transitions, 12 changer transitions 0/86 dead transitions. [2025-03-17 19:40:15,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 86 transitions, 308 flow [2025-03-17 19:40:15,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 19:40:15,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 19:40:15,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 310 transitions. [2025-03-17 19:40:15,454 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6007751937984496 [2025-03-17 19:40:15,454 INFO L175 Difference]: Start difference. First operand has 82 places, 88 transitions, 228 flow. Second operand 6 states and 310 transitions. [2025-03-17 19:40:15,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 86 transitions, 308 flow [2025-03-17 19:40:15,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 86 transitions, 308 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 19:40:15,456 INFO L231 Difference]: Finished difference. Result has 85 places, 86 transitions, 244 flow [2025-03-17 19:40:15,456 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=244, PETRI_PLACES=85, PETRI_TRANSITIONS=86} [2025-03-17 19:40:15,456 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 6 predicate places. [2025-03-17 19:40:15,456 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 86 transitions, 244 flow [2025-03-17 19:40:15,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 44.833333333333336) internal successors, (269), 6 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:40:15,456 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:40:15,457 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 19:40:15,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 19:40:15,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:40:15,661 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-17 19:40:15,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:40:15,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1821854254, now seen corresponding path program 1 times [2025-03-17 19:40:15,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:40:15,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480321393] [2025-03-17 19:40:15,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:40:15,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:40:15,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:40:15,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:40:15,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:40:15,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:40:15,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:40:15,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:40:15,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480321393] [2025-03-17 19:40:15,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480321393] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:40:15,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:40:15,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:40:15,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888953737] [2025-03-17 19:40:15,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:40:15,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 19:40:15,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:40:15,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 19:40:15,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:40:15,787 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 86 [2025-03-17 19:40:15,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 86 transitions, 244 flow. Second operand has 5 states, 5 states have (on average 45.2) internal successors, (226), 5 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:40:15,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:40:15,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 86 [2025-03-17 19:40:15,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:40:16,061 INFO L124 PetriNetUnfolderBase]: 1184/3044 cut-off events. [2025-03-17 19:40:16,062 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2025-03-17 19:40:16,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4908 conditions, 3044 events. 1184/3044 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 25162 event pairs, 730 based on Foata normal form. 22/2410 useless extension candidates. Maximal degree in co-relation 2480. Up to 907 conditions per place. [2025-03-17 19:40:16,074 INFO L140 encePairwiseOnDemand]: 78/86 looper letters, 70 selfloop transitions, 7 changer transitions 0/117 dead transitions. [2025-03-17 19:40:16,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 117 transitions, 464 flow [2025-03-17 19:40:16,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 19:40:16,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 19:40:16,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 296 transitions. [2025-03-17 19:40:16,076 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6883720930232559 [2025-03-17 19:40:16,076 INFO L175 Difference]: Start difference. First operand has 85 places, 86 transitions, 244 flow. Second operand 5 states and 296 transitions. [2025-03-17 19:40:16,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 117 transitions, 464 flow [2025-03-17 19:40:16,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 117 transitions, 436 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-03-17 19:40:16,078 INFO L231 Difference]: Finished difference. Result has 86 places, 88 transitions, 251 flow [2025-03-17 19:40:16,078 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=251, PETRI_PLACES=86, PETRI_TRANSITIONS=88} [2025-03-17 19:40:16,079 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 7 predicate places. [2025-03-17 19:40:16,079 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 88 transitions, 251 flow [2025-03-17 19:40:16,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.2) internal successors, (226), 5 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:40:16,079 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:40:16,079 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-03-17 19:40:16,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 19:40:16,079 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-17 19:40:16,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:40:16,080 INFO L85 PathProgramCache]: Analyzing trace with hash 594957954, now seen corresponding path program 1 times [2025-03-17 19:40:16,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:40:16,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131675512] [2025-03-17 19:40:16,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:40:16,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:40:16,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:40:16,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:40:16,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:40:16,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:40:16,128 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:40:16,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:40:16,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131675512] [2025-03-17 19:40:16,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131675512] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:40:16,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713657488] [2025-03-17 19:40:16,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:40:16,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:40:16,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:40:16,130 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:40:16,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 19:40:16,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:40:16,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:40:16,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:40:16,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:40:16,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 19:40:16,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:40:16,205 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:40:16,205 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:40:16,235 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:40:16,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713657488] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:40:16,236 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:40:16,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-03-17 19:40:16,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184547734] [2025-03-17 19:40:16,236 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:40:16,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 19:40:16,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:40:16,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 19:40:16,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-17 19:40:16,254 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 86 [2025-03-17 19:40:16,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 88 transitions, 251 flow. Second operand has 12 states, 12 states have (on average 45.083333333333336) internal successors, (541), 12 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:40:16,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:40:16,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 86 [2025-03-17 19:40:16,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:40:16,599 INFO L124 PetriNetUnfolderBase]: 1010/2688 cut-off events. [2025-03-17 19:40:16,599 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2025-03-17 19:40:16,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4359 conditions, 2688 events. 1010/2688 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 21988 event pairs, 616 based on Foata normal form. 6/2138 useless extension candidates. Maximal degree in co-relation 2194. Up to 1496 conditions per place. [2025-03-17 19:40:16,615 INFO L140 encePairwiseOnDemand]: 77/86 looper letters, 37 selfloop transitions, 25 changer transitions 0/106 dead transitions. [2025-03-17 19:40:16,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 106 transitions, 468 flow [2025-03-17 19:40:16,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 19:40:16,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 19:40:16,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 508 transitions. [2025-03-17 19:40:16,618 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5906976744186047 [2025-03-17 19:40:16,618 INFO L175 Difference]: Start difference. First operand has 86 places, 88 transitions, 251 flow. Second operand 10 states and 508 transitions. [2025-03-17 19:40:16,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 106 transitions, 468 flow [2025-03-17 19:40:16,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 106 transitions, 467 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 19:40:16,622 INFO L231 Difference]: Finished difference. Result has 97 places, 106 transitions, 427 flow [2025-03-17 19:40:16,623 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=427, PETRI_PLACES=97, PETRI_TRANSITIONS=106} [2025-03-17 19:40:16,623 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 18 predicate places. [2025-03-17 19:40:16,623 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 106 transitions, 427 flow [2025-03-17 19:40:16,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 45.083333333333336) internal successors, (541), 12 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:40:16,624 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:40:16,624 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:40:16,630 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-17 19:40:16,825 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,SelfDestructingSolverStorable3 [2025-03-17 19:40:16,825 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-17 19:40:16,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:40:16,825 INFO L85 PathProgramCache]: Analyzing trace with hash 642907634, now seen corresponding path program 1 times [2025-03-17 19:40:16,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:40:16,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107233110] [2025-03-17 19:40:16,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:40:16,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:40:16,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:40:16,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:40:16,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:40:16,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:40:16,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:40:16,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:40:16,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107233110] [2025-03-17 19:40:16,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107233110] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:40:16,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:40:16,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:40:16,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162921424] [2025-03-17 19:40:16,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:40:16,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:40:16,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:40:16,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:40:16,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:40:16,943 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 86 [2025-03-17 19:40:16,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 106 transitions, 427 flow. Second operand has 4 states, 4 states have (on average 45.5) internal successors, (182), 4 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:40:16,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:40:16,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 86 [2025-03-17 19:40:16,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:40:17,365 INFO L124 PetriNetUnfolderBase]: 2221/5729 cut-off events. [2025-03-17 19:40:17,365 INFO L125 PetriNetUnfolderBase]: For 530/530 co-relation queries the response was YES. [2025-03-17 19:40:17,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9507 conditions, 5729 events. 2221/5729 cut-off events. For 530/530 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 53389 event pairs, 1343 based on Foata normal form. 84/4687 useless extension candidates. Maximal degree in co-relation 9407. Up to 1670 conditions per place. [2025-03-17 19:40:17,394 INFO L140 encePairwiseOnDemand]: 77/86 looper letters, 105 selfloop transitions, 7 changer transitions 0/152 dead transitions. [2025-03-17 19:40:17,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 152 transitions, 830 flow [2025-03-17 19:40:17,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 19:40:17,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 19:40:17,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 302 transitions. [2025-03-17 19:40:17,395 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7023255813953488 [2025-03-17 19:40:17,395 INFO L175 Difference]: Start difference. First operand has 97 places, 106 transitions, 427 flow. Second operand 5 states and 302 transitions. [2025-03-17 19:40:17,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 152 transitions, 830 flow [2025-03-17 19:40:17,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 152 transitions, 796 flow, removed 9 selfloop flow, removed 2 redundant places. [2025-03-17 19:40:17,403 INFO L231 Difference]: Finished difference. Result has 102 places, 110 transitions, 470 flow [2025-03-17 19:40:17,403 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=470, PETRI_PLACES=102, PETRI_TRANSITIONS=110} [2025-03-17 19:40:17,403 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 23 predicate places. [2025-03-17 19:40:17,403 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 110 transitions, 470 flow [2025-03-17 19:40:17,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.5) internal successors, (182), 4 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:40:17,404 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:40:17,404 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:40:17,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 19:40:17,404 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-17 19:40:17,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:40:17,404 INFO L85 PathProgramCache]: Analyzing trace with hash -328227748, now seen corresponding path program 1 times [2025-03-17 19:40:17,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:40:17,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255388867] [2025-03-17 19:40:17,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:40:17,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:40:17,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 19:40:17,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 19:40:17,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:40:17,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:40:17,503 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-17 19:40:17,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:40:17,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255388867] [2025-03-17 19:40:17,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255388867] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:40:17,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982356558] [2025-03-17 19:40:17,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:40:17,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:40:17,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:40:17,505 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:40:17,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 19:40:17,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 19:40:17,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 19:40:17,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:40:17,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:40:17,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 19:40:17,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:40:17,613 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-17 19:40:17,613 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:40:17,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [982356558] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:40:17,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:40:17,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [5] total 6 [2025-03-17 19:40:17,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415437265] [2025-03-17 19:40:17,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:40:17,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:40:17,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:40:17,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:40:17,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 19:40:17,622 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 86 [2025-03-17 19:40:17,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 110 transitions, 470 flow. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:40:17,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:40:17,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 86 [2025-03-17 19:40:17,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:40:17,913 INFO L124 PetriNetUnfolderBase]: 1999/5298 cut-off events. [2025-03-17 19:40:17,913 INFO L125 PetriNetUnfolderBase]: For 548/552 co-relation queries the response was YES. [2025-03-17 19:40:17,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8587 conditions, 5298 events. 1999/5298 cut-off events. For 548/552 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 49675 event pairs, 1226 based on Foata normal form. 78/4280 useless extension candidates. Maximal degree in co-relation 8488. Up to 3010 conditions per place. [2025-03-17 19:40:17,932 INFO L140 encePairwiseOnDemand]: 83/86 looper letters, 61 selfloop transitions, 1 changer transitions 0/106 dead transitions. [2025-03-17 19:40:17,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 106 transitions, 566 flow [2025-03-17 19:40:17,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:40:17,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 19:40:17,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 176 transitions. [2025-03-17 19:40:17,935 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6821705426356589 [2025-03-17 19:40:17,935 INFO L175 Difference]: Start difference. First operand has 102 places, 110 transitions, 470 flow. Second operand 3 states and 176 transitions. [2025-03-17 19:40:17,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 106 transitions, 566 flow [2025-03-17 19:40:17,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 106 transitions, 546 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-03-17 19:40:17,937 INFO L231 Difference]: Finished difference. Result has 98 places, 106 transitions, 424 flow [2025-03-17 19:40:17,937 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=424, PETRI_PLACES=98, PETRI_TRANSITIONS=106} [2025-03-17 19:40:17,940 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 19 predicate places. [2025-03-17 19:40:17,940 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 106 transitions, 424 flow [2025-03-17 19:40:17,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:40:17,941 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:40:17,941 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:40:17,947 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-17 19:40:18,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:40:18,144 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-17 19:40:18,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:40:18,145 INFO L85 PathProgramCache]: Analyzing trace with hash -889027886, now seen corresponding path program 1 times [2025-03-17 19:40:18,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:40:18,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317728101] [2025-03-17 19:40:18,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:40:18,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:40:18,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 19:40:18,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 19:40:18,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:40:18,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:40:18,245 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-17 19:40:18,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:40:18,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317728101] [2025-03-17 19:40:18,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317728101] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:40:18,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551448316] [2025-03-17 19:40:18,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:40:18,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:40:18,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:40:18,250 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:40:18,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 19:40:18,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 19:40:18,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 19:40:18,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:40:18,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:40:18,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 19:40:18,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:40:18,347 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-17 19:40:18,347 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:40:18,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [551448316] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:40:18,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:40:18,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 6 [2025-03-17 19:40:18,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577604768] [2025-03-17 19:40:18,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:40:18,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:40:18,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:40:18,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:40:18,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 19:40:18,364 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 86 [2025-03-17 19:40:18,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 106 transitions, 424 flow. Second operand has 4 states, 4 states have (on average 48.0) internal successors, (192), 4 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:40:18,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:40:18,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 86 [2025-03-17 19:40:18,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:40:18,690 INFO L124 PetriNetUnfolderBase]: 1988/5276 cut-off events. [2025-03-17 19:40:18,691 INFO L125 PetriNetUnfolderBase]: For 339/339 co-relation queries the response was YES. [2025-03-17 19:40:18,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8504 conditions, 5276 events. 1988/5276 cut-off events. For 339/339 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 49444 event pairs, 1224 based on Foata normal form. 80/4262 useless extension candidates. Maximal degree in co-relation 8487. Up to 2999 conditions per place. [2025-03-17 19:40:18,714 INFO L140 encePairwiseOnDemand]: 82/86 looper letters, 56 selfloop transitions, 6 changer transitions 0/102 dead transitions. [2025-03-17 19:40:18,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 102 transitions, 522 flow [2025-03-17 19:40:18,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:40:18,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 19:40:18,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 222 transitions. [2025-03-17 19:40:18,715 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6453488372093024 [2025-03-17 19:40:18,716 INFO L175 Difference]: Start difference. First operand has 98 places, 106 transitions, 424 flow. Second operand 4 states and 222 transitions. [2025-03-17 19:40:18,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 102 transitions, 522 flow [2025-03-17 19:40:18,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 102 transitions, 503 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 19:40:18,718 INFO L231 Difference]: Finished difference. Result has 95 places, 102 transitions, 391 flow [2025-03-17 19:40:18,718 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=379, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=391, PETRI_PLACES=95, PETRI_TRANSITIONS=102} [2025-03-17 19:40:18,718 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 16 predicate places. [2025-03-17 19:40:18,718 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 102 transitions, 391 flow [2025-03-17 19:40:18,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.0) internal successors, (192), 4 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:40:18,719 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:40:18,719 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:40:18,727 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 19:40:18,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:40:18,921 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-17 19:40:18,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:40:18,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1602818994, now seen corresponding path program 1 times [2025-03-17 19:40:18,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:40:18,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131392171] [2025-03-17 19:40:18,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:40:18,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:40:18,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 19:40:18,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 19:40:18,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:40:18,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:40:18,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:40:18,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:40:18,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131392171] [2025-03-17 19:40:18,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131392171] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:40:18,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:40:18,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:40:18,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184411060] [2025-03-17 19:40:18,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:40:18,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:40:18,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:40:18,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:40:18,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:40:18,974 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 86 [2025-03-17 19:40:18,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 102 transitions, 391 flow. Second operand has 4 states, 4 states have (on average 48.25) internal successors, (193), 4 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:40:18,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:40:18,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 86 [2025-03-17 19:40:18,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:40:19,459 INFO L124 PetriNetUnfolderBase]: 4112/9332 cut-off events. [2025-03-17 19:40:19,459 INFO L125 PetriNetUnfolderBase]: For 123/123 co-relation queries the response was YES. [2025-03-17 19:40:19,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15848 conditions, 9332 events. 4112/9332 cut-off events. For 123/123 co-relation queries the response was YES. Maximal size of possible extension queue 502. Compared 87009 event pairs, 1568 based on Foata normal form. 104/7846 useless extension candidates. Maximal degree in co-relation 15833. Up to 3415 conditions per place. [2025-03-17 19:40:19,497 INFO L140 encePairwiseOnDemand]: 81/86 looper letters, 102 selfloop transitions, 3 changer transitions 0/143 dead transitions. [2025-03-17 19:40:19,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 143 transitions, 688 flow [2025-03-17 19:40:19,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:40:19,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 19:40:19,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 265 transitions. [2025-03-17 19:40:19,499 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7703488372093024 [2025-03-17 19:40:19,499 INFO L175 Difference]: Start difference. First operand has 95 places, 102 transitions, 391 flow. Second operand 4 states and 265 transitions. [2025-03-17 19:40:19,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 143 transitions, 688 flow [2025-03-17 19:40:19,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 143 transitions, 681 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 19:40:19,501 INFO L231 Difference]: Finished difference. Result has 98 places, 104 transitions, 406 flow [2025-03-17 19:40:19,501 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=406, PETRI_PLACES=98, PETRI_TRANSITIONS=104} [2025-03-17 19:40:19,501 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 19 predicate places. [2025-03-17 19:40:19,501 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 104 transitions, 406 flow [2025-03-17 19:40:19,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.25) internal successors, (193), 4 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:40:19,502 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:40:19,502 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:40:19,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 19:40:19,502 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-17 19:40:19,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:40:19,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1852217061, now seen corresponding path program 1 times [2025-03-17 19:40:19,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:40:19,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280699377] [2025-03-17 19:40:19,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:40:19,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:40:19,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 19:40:19,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 19:40:19,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:40:19,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:40:19,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:40:19,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:40:19,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280699377] [2025-03-17 19:40:19,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280699377] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:40:19,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:40:19,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:40:19,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875862172] [2025-03-17 19:40:19,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:40:19,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:40:19,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:40:19,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:40:19,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:40:19,556 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 86 [2025-03-17 19:40:19,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 104 transitions, 406 flow. Second operand has 4 states, 4 states have (on average 44.5) internal successors, (178), 4 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:40:19,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:40:19,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 86 [2025-03-17 19:40:19,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:40:20,173 INFO L124 PetriNetUnfolderBase]: 6536/14640 cut-off events. [2025-03-17 19:40:20,173 INFO L125 PetriNetUnfolderBase]: For 791/823 co-relation queries the response was YES. [2025-03-17 19:40:20,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25805 conditions, 14640 events. 6536/14640 cut-off events. For 791/823 co-relation queries the response was YES. Maximal size of possible extension queue 774. Compared 146438 event pairs, 2212 based on Foata normal form. 416/12501 useless extension candidates. Maximal degree in co-relation 25789. Up to 5343 conditions per place. [2025-03-17 19:40:20,233 INFO L140 encePairwiseOnDemand]: 78/86 looper letters, 98 selfloop transitions, 5 changer transitions 0/137 dead transitions. [2025-03-17 19:40:20,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 137 transitions, 682 flow [2025-03-17 19:40:20,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:40:20,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 19:40:20,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 246 transitions. [2025-03-17 19:40:20,234 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7151162790697675 [2025-03-17 19:40:20,234 INFO L175 Difference]: Start difference. First operand has 98 places, 104 transitions, 406 flow. Second operand 4 states and 246 transitions. [2025-03-17 19:40:20,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 137 transitions, 682 flow [2025-03-17 19:40:20,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 137 transitions, 680 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 19:40:20,238 INFO L231 Difference]: Finished difference. Result has 102 places, 106 transitions, 438 flow [2025-03-17 19:40:20,238 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=438, PETRI_PLACES=102, PETRI_TRANSITIONS=106} [2025-03-17 19:40:20,239 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 23 predicate places. [2025-03-17 19:40:20,239 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 106 transitions, 438 flow [2025-03-17 19:40:20,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.5) internal successors, (178), 4 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:40:20,239 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:40:20,239 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:40:20,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 19:40:20,239 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-17 19:40:20,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:40:20,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1584153417, now seen corresponding path program 1 times [2025-03-17 19:40:20,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:40:20,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111121190] [2025-03-17 19:40:20,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:40:20,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:40:20,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 19:40:20,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 19:40:20,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:40:20,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:40:20,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:40:20,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:40:20,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111121190] [2025-03-17 19:40:20,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111121190] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:40:20,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:40:20,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 19:40:20,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064551080] [2025-03-17 19:40:20,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:40:20,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 19:40:20,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:40:20,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 19:40:20,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:40:20,380 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 86 [2025-03-17 19:40:20,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 106 transitions, 438 flow. Second operand has 5 states, 5 states have (on average 49.6) internal successors, (248), 5 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:40:20,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:40:20,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 86 [2025-03-17 19:40:20,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:40:20,913 INFO L124 PetriNetUnfolderBase]: 2620/6750 cut-off events. [2025-03-17 19:40:20,914 INFO L125 PetriNetUnfolderBase]: For 1425/1513 co-relation queries the response was YES. [2025-03-17 19:40:20,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12499 conditions, 6750 events. 2620/6750 cut-off events. For 1425/1513 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 63694 event pairs, 1528 based on Foata normal form. 100/5863 useless extension candidates. Maximal degree in co-relation 12481. Up to 3445 conditions per place. [2025-03-17 19:40:20,958 INFO L140 encePairwiseOnDemand]: 79/86 looper letters, 105 selfloop transitions, 6 changer transitions 3/154 dead transitions. [2025-03-17 19:40:20,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 154 transitions, 825 flow [2025-03-17 19:40:20,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 19:40:20,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 19:40:20,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 369 transitions. [2025-03-17 19:40:20,961 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7151162790697675 [2025-03-17 19:40:20,961 INFO L175 Difference]: Start difference. First operand has 102 places, 106 transitions, 438 flow. Second operand 6 states and 369 transitions. [2025-03-17 19:40:20,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 154 transitions, 825 flow [2025-03-17 19:40:20,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 154 transitions, 825 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 19:40:20,970 INFO L231 Difference]: Finished difference. Result has 109 places, 107 transitions, 462 flow [2025-03-17 19:40:20,970 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=462, PETRI_PLACES=109, PETRI_TRANSITIONS=107} [2025-03-17 19:40:20,971 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 30 predicate places. [2025-03-17 19:40:20,971 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 107 transitions, 462 flow [2025-03-17 19:40:20,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 49.6) internal successors, (248), 5 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:40:20,971 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:40:20,972 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:40:20,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 19:40:20,972 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-17 19:40:20,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:40:20,972 INFO L85 PathProgramCache]: Analyzing trace with hash 770000191, now seen corresponding path program 1 times [2025-03-17 19:40:20,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:40:20,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244338184] [2025-03-17 19:40:20,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:40:20,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:40:20,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 19:40:20,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 19:40:20,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:40:20,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:40:21,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:40:21,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:40:21,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244338184] [2025-03-17 19:40:21,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244338184] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:40:21,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:40:21,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:40:21,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028485753] [2025-03-17 19:40:21,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:40:21,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:40:21,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:40:21,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:40:21,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:40:21,013 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 86 [2025-03-17 19:40:21,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 107 transitions, 462 flow. Second operand has 4 states, 4 states have (on average 48.75) internal successors, (195), 4 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:40:21,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:40:21,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 86 [2025-03-17 19:40:21,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:40:21,588 INFO L124 PetriNetUnfolderBase]: 4898/11820 cut-off events. [2025-03-17 19:40:21,588 INFO L125 PetriNetUnfolderBase]: For 3336/3624 co-relation queries the response was YES. [2025-03-17 19:40:21,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22259 conditions, 11820 events. 4898/11820 cut-off events. For 3336/3624 co-relation queries the response was YES. Maximal size of possible extension queue 566. Compared 117155 event pairs, 1972 based on Foata normal form. 246/10305 useless extension candidates. Maximal degree in co-relation 22237. Up to 4297 conditions per place. [2025-03-17 19:40:21,644 INFO L140 encePairwiseOnDemand]: 81/86 looper letters, 114 selfloop transitions, 3 changer transitions 0/155 dead transitions. [2025-03-17 19:40:21,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 155 transitions, 874 flow [2025-03-17 19:40:21,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:40:21,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 19:40:21,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 262 transitions. [2025-03-17 19:40:21,645 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7616279069767442 [2025-03-17 19:40:21,645 INFO L175 Difference]: Start difference. First operand has 109 places, 107 transitions, 462 flow. Second operand 4 states and 262 transitions. [2025-03-17 19:40:21,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 155 transitions, 874 flow [2025-03-17 19:40:21,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 155 transitions, 866 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 19:40:21,653 INFO L231 Difference]: Finished difference. Result has 111 places, 109 transitions, 476 flow [2025-03-17 19:40:21,653 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=476, PETRI_PLACES=111, PETRI_TRANSITIONS=109} [2025-03-17 19:40:21,654 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 32 predicate places. [2025-03-17 19:40:21,654 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 109 transitions, 476 flow [2025-03-17 19:40:21,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.75) internal successors, (195), 4 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:40:21,654 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:40:21,654 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:40:21,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 19:40:21,654 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-17 19:40:21,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:40:21,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1899796146, now seen corresponding path program 1 times [2025-03-17 19:40:21,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:40:21,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308851512] [2025-03-17 19:40:21,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:40:21,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:40:21,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 19:40:21,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 19:40:21,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:40:21,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:40:21,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:40:21,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:40:21,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308851512] [2025-03-17 19:40:21,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308851512] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:40:21,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:40:21,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:40:21,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67353379] [2025-03-17 19:40:21,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:40:21,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:40:21,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:40:21,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:40:21,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:40:21,727 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 86 [2025-03-17 19:40:21,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 109 transitions, 476 flow. Second operand has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:40:21,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:40:21,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 86 [2025-03-17 19:40:21,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:40:22,680 INFO L124 PetriNetUnfolderBase]: 8124/17848 cut-off events. [2025-03-17 19:40:22,681 INFO L125 PetriNetUnfolderBase]: For 6606/7014 co-relation queries the response was YES. [2025-03-17 19:40:22,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36704 conditions, 17848 events. 8124/17848 cut-off events. For 6606/7014 co-relation queries the response was YES. Maximal size of possible extension queue 877. Compared 178895 event pairs, 3082 based on Foata normal form. 648/16397 useless extension candidates. Maximal degree in co-relation 36681. Up to 6821 conditions per place. [2025-03-17 19:40:22,794 INFO L140 encePairwiseOnDemand]: 78/86 looper letters, 111 selfloop transitions, 5 changer transitions 0/150 dead transitions. [2025-03-17 19:40:22,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 150 transitions, 872 flow [2025-03-17 19:40:22,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:40:22,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 19:40:22,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 244 transitions. [2025-03-17 19:40:22,795 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7093023255813954 [2025-03-17 19:40:22,795 INFO L175 Difference]: Start difference. First operand has 111 places, 109 transitions, 476 flow. Second operand 4 states and 244 transitions. [2025-03-17 19:40:22,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 150 transitions, 872 flow [2025-03-17 19:40:22,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 150 transitions, 870 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 19:40:22,837 INFO L231 Difference]: Finished difference. Result has 115 places, 111 transitions, 508 flow [2025-03-17 19:40:22,837 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=472, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=508, PETRI_PLACES=115, PETRI_TRANSITIONS=111} [2025-03-17 19:40:22,838 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 36 predicate places. [2025-03-17 19:40:22,838 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 111 transitions, 508 flow [2025-03-17 19:40:22,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:40:22,838 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:40:22,838 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:40:22,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 19:40:22,838 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-17 19:40:22,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:40:22,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1235862276, now seen corresponding path program 1 times [2025-03-17 19:40:22,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:40:22,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407465237] [2025-03-17 19:40:22,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:40:22,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:40:22,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 19:40:22,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 19:40:22,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:40:22,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:40:22,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:40:22,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:40:22,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407465237] [2025-03-17 19:40:22,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407465237] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:40:22,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:40:22,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 19:40:22,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430292491] [2025-03-17 19:40:22,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:40:22,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 19:40:22,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:40:22,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 19:40:22,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:40:22,926 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 86 [2025-03-17 19:40:22,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 111 transitions, 508 flow. Second operand has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:40:22,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:40:22,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 86 [2025-03-17 19:40:22,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:40:23,933 INFO L124 PetriNetUnfolderBase]: 5312/13642 cut-off events. [2025-03-17 19:40:23,933 INFO L125 PetriNetUnfolderBase]: For 6360/6764 co-relation queries the response was YES. [2025-03-17 19:40:23,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28772 conditions, 13642 events. 5312/13642 cut-off events. For 6360/6764 co-relation queries the response was YES. Maximal size of possible extension queue 735. Compared 145683 event pairs, 3558 based on Foata normal form. 226/12531 useless extension candidates. Maximal degree in co-relation 28747. Up to 7647 conditions per place. [2025-03-17 19:40:24,013 INFO L140 encePairwiseOnDemand]: 79/86 looper letters, 74 selfloop transitions, 4 changer transitions 21/139 dead transitions. [2025-03-17 19:40:24,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 139 transitions, 830 flow [2025-03-17 19:40:24,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 19:40:24,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 19:40:24,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 350 transitions. [2025-03-17 19:40:24,015 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6782945736434108 [2025-03-17 19:40:24,015 INFO L175 Difference]: Start difference. First operand has 115 places, 111 transitions, 508 flow. Second operand 6 states and 350 transitions. [2025-03-17 19:40:24,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 139 transitions, 830 flow [2025-03-17 19:40:24,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 139 transitions, 830 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 19:40:24,068 INFO L231 Difference]: Finished difference. Result has 122 places, 109 transitions, 502 flow [2025-03-17 19:40:24,068 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=502, PETRI_PLACES=122, PETRI_TRANSITIONS=109} [2025-03-17 19:40:24,068 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 43 predicate places. [2025-03-17 19:40:24,068 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 109 transitions, 502 flow [2025-03-17 19:40:24,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:40:24,069 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:40:24,069 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:40:24,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 19:40:24,069 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-17 19:40:24,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:40:24,069 INFO L85 PathProgramCache]: Analyzing trace with hash 684934103, now seen corresponding path program 1 times [2025-03-17 19:40:24,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:40:24,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311765804] [2025-03-17 19:40:24,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:40:24,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:40:24,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 19:40:24,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 19:40:24,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:40:24,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:40:24,133 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-17 19:40:24,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:40:24,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311765804] [2025-03-17 19:40:24,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311765804] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:40:24,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:40:24,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 19:40:24,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44197826] [2025-03-17 19:40:24,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:40:24,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 19:40:24,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:40:24,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 19:40:24,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:40:24,164 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 86 [2025-03-17 19:40:24,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 109 transitions, 502 flow. Second operand has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:40:24,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:40:24,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 86 [2025-03-17 19:40:24,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:40:24,666 INFO L124 PetriNetUnfolderBase]: 2950/7465 cut-off events. [2025-03-17 19:40:24,666 INFO L125 PetriNetUnfolderBase]: For 3754/3990 co-relation queries the response was YES. [2025-03-17 19:40:24,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16056 conditions, 7465 events. 2950/7465 cut-off events. For 3754/3990 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 70729 event pairs, 1802 based on Foata normal form. 164/6964 useless extension candidates. Maximal degree in co-relation 16027. Up to 3835 conditions per place. [2025-03-17 19:40:24,695 INFO L140 encePairwiseOnDemand]: 81/86 looper letters, 99 selfloop transitions, 9 changer transitions 4/152 dead transitions. [2025-03-17 19:40:24,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 152 transitions, 890 flow [2025-03-17 19:40:24,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 19:40:24,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 19:40:24,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 315 transitions. [2025-03-17 19:40:24,696 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7325581395348837 [2025-03-17 19:40:24,696 INFO L175 Difference]: Start difference. First operand has 122 places, 109 transitions, 502 flow. Second operand 5 states and 315 transitions. [2025-03-17 19:40:24,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 152 transitions, 890 flow [2025-03-17 19:40:24,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 152 transitions, 875 flow, removed 4 selfloop flow, removed 5 redundant places. [2025-03-17 19:40:24,710 INFO L231 Difference]: Finished difference. Result has 121 places, 110 transitions, 522 flow [2025-03-17 19:40:24,711 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=491, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=522, PETRI_PLACES=121, PETRI_TRANSITIONS=110} [2025-03-17 19:40:24,711 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 42 predicate places. [2025-03-17 19:40:24,711 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 110 transitions, 522 flow [2025-03-17 19:40:24,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:40:24,711 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:40:24,711 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1] [2025-03-17 19:40:24,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 19:40:24,711 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-17 19:40:24,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:40:24,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1116669794, now seen corresponding path program 2 times [2025-03-17 19:40:24,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:40:24,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677761976] [2025-03-17 19:40:24,712 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:40:24,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:40:24,718 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-17 19:40:24,720 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-03-17 19:40:24,720 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:40:24,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:40:24,737 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 19:40:24,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:40:24,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677761976] [2025-03-17 19:40:24,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677761976] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:40:24,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465935471] [2025-03-17 19:40:24,737 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:40:24,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:40:24,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:40:24,739 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:40:24,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 19:40:24,776 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-17 19:40:24,781 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-03-17 19:40:24,782 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:40:24,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:40:24,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 19:40:24,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:40:24,801 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 19:40:24,801 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:40:24,822 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 19:40:24,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1465935471] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:40:24,822 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:40:24,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 2 [2025-03-17 19:40:24,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128056220] [2025-03-17 19:40:24,823 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:40:24,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:40:24,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:40:24,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:40:24,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:40:24,830 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 86 [2025-03-17 19:40:24,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 110 transitions, 522 flow. Second operand has 4 states, 4 states have (on average 45.25) internal successors, (181), 4 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:40:24,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:40:24,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 86 [2025-03-17 19:40:24,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:40:25,207 INFO L124 PetriNetUnfolderBase]: 2933/7498 cut-off events. [2025-03-17 19:40:25,207 INFO L125 PetriNetUnfolderBase]: For 4154/4374 co-relation queries the response was YES. [2025-03-17 19:40:25,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16103 conditions, 7498 events. 2933/7498 cut-off events. For 4154/4374 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 71437 event pairs, 1996 based on Foata normal form. 103/6881 useless extension candidates. Maximal degree in co-relation 16075. Up to 4360 conditions per place. [2025-03-17 19:40:25,250 INFO L140 encePairwiseOnDemand]: 81/86 looper letters, 55 selfloop transitions, 16 changer transitions 0/109 dead transitions. [2025-03-17 19:40:25,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 109 transitions, 654 flow [2025-03-17 19:40:25,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:40:25,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 19:40:25,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 214 transitions. [2025-03-17 19:40:25,252 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.622093023255814 [2025-03-17 19:40:25,252 INFO L175 Difference]: Start difference. First operand has 121 places, 110 transitions, 522 flow. Second operand 4 states and 214 transitions. [2025-03-17 19:40:25,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 109 transitions, 654 flow [2025-03-17 19:40:25,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 109 transitions, 637 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-17 19:40:25,267 INFO L231 Difference]: Finished difference. Result has 121 places, 109 transitions, 527 flow [2025-03-17 19:40:25,267 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=495, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=527, PETRI_PLACES=121, PETRI_TRANSITIONS=109} [2025-03-17 19:40:25,267 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 42 predicate places. [2025-03-17 19:40:25,267 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 109 transitions, 527 flow [2025-03-17 19:40:25,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.25) internal successors, (181), 4 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:40:25,267 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:40:25,267 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:40:25,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 19:40:25,468 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,SelfDestructingSolverStorable14 [2025-03-17 19:40:25,468 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-17 19:40:25,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:40:25,469 INFO L85 PathProgramCache]: Analyzing trace with hash -14417372, now seen corresponding path program 1 times [2025-03-17 19:40:25,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:40:25,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144026953] [2025-03-17 19:40:25,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:40:25,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:40:25,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 19:40:25,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 19:40:25,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:40:25,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:40:25,546 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-17 19:40:25,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:40:25,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144026953] [2025-03-17 19:40:25,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144026953] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:40:25,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:40:25,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 19:40:25,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615536868] [2025-03-17 19:40:25,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:40:25,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 19:40:25,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:40:25,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 19:40:25,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:40:25,568 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 86 [2025-03-17 19:40:25,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 109 transitions, 527 flow. Second operand has 5 states, 5 states have (on average 50.4) internal successors, (252), 5 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:40:25,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:40:25,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 86 [2025-03-17 19:40:25,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:40:25,976 INFO L124 PetriNetUnfolderBase]: 2653/6819 cut-off events. [2025-03-17 19:40:25,976 INFO L125 PetriNetUnfolderBase]: For 3475/3681 co-relation queries the response was YES. [2025-03-17 19:40:25,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14566 conditions, 6819 events. 2653/6819 cut-off events. For 3475/3681 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 64592 event pairs, 1770 based on Foata normal form. 109/6261 useless extension candidates. Maximal degree in co-relation 14537. Up to 3835 conditions per place. [2025-03-17 19:40:26,004 INFO L140 encePairwiseOnDemand]: 81/86 looper letters, 61 selfloop transitions, 7 changer transitions 17/124 dead transitions. [2025-03-17 19:40:26,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 124 transitions, 742 flow [2025-03-17 19:40:26,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 19:40:26,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 19:40:26,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 296 transitions. [2025-03-17 19:40:26,005 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6883720930232559 [2025-03-17 19:40:26,005 INFO L175 Difference]: Start difference. First operand has 121 places, 109 transitions, 527 flow. Second operand 5 states and 296 transitions. [2025-03-17 19:40:26,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 124 transitions, 742 flow [2025-03-17 19:40:26,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 124 transitions, 710 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 19:40:26,017 INFO L231 Difference]: Finished difference. Result has 124 places, 107 transitions, 495 flow [2025-03-17 19:40:26,018 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=495, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=495, PETRI_PLACES=124, PETRI_TRANSITIONS=107} [2025-03-17 19:40:26,018 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 45 predicate places. [2025-03-17 19:40:26,018 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 107 transitions, 495 flow [2025-03-17 19:40:26,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.4) internal successors, (252), 5 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:40:26,018 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:40:26,018 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1] [2025-03-17 19:40:26,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 19:40:26,018 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-17 19:40:26,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:40:26,019 INFO L85 PathProgramCache]: Analyzing trace with hash -328646920, now seen corresponding path program 1 times [2025-03-17 19:40:26,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:40:26,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758939051] [2025-03-17 19:40:26,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:40:26,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:40:26,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 19:40:26,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 19:40:26,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:40:26,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:40:26,121 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:40:26,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:40:26,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758939051] [2025-03-17 19:40:26,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758939051] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:40:26,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574369205] [2025-03-17 19:40:26,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:40:26,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:40:26,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:40:26,123 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:40:26,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 19:40:26,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 19:40:26,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 19:40:26,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:40:26,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:40:26,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 19:40:26,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:40:26,211 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:40:26,211 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:40:26,314 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:40:26,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [574369205] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:40:26,315 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:40:26,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2025-03-17 19:40:26,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792770786] [2025-03-17 19:40:26,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:40:26,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-17 19:40:26,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:40:26,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-17 19:40:26,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2025-03-17 19:40:26,342 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 86 [2025-03-17 19:40:26,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 107 transitions, 495 flow. Second operand has 24 states, 24 states have (on average 45.083333333333336) internal successors, (1082), 24 states have internal predecessors, (1082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:40:26,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:40:26,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 86 [2025-03-17 19:40:26,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:40:26,896 INFO L124 PetriNetUnfolderBase]: 2629/6784 cut-off events. [2025-03-17 19:40:26,896 INFO L125 PetriNetUnfolderBase]: For 3817/4023 co-relation queries the response was YES. [2025-03-17 19:40:26,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14706 conditions, 6784 events. 2629/6784 cut-off events. For 3817/4023 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 64735 event pairs, 1761 based on Foata normal form. 112/6216 useless extension candidates. Maximal degree in co-relation 14676. Up to 3829 conditions per place. [2025-03-17 19:40:26,927 INFO L140 encePairwiseOnDemand]: 78/86 looper letters, 44 selfloop transitions, 61 changer transitions 0/143 dead transitions. [2025-03-17 19:40:26,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 143 transitions, 957 flow [2025-03-17 19:40:26,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-17 19:40:26,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-17 19:40:26,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1070 transitions. [2025-03-17 19:40:26,929 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5655391120507399 [2025-03-17 19:40:26,929 INFO L175 Difference]: Start difference. First operand has 124 places, 107 transitions, 495 flow. Second operand 22 states and 1070 transitions. [2025-03-17 19:40:26,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 143 transitions, 957 flow [2025-03-17 19:40:26,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 143 transitions, 923 flow, removed 4 selfloop flow, removed 6 redundant places. [2025-03-17 19:40:26,945 INFO L231 Difference]: Finished difference. Result has 140 places, 143 transitions, 881 flow [2025-03-17 19:40:26,945 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=473, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=881, PETRI_PLACES=140, PETRI_TRANSITIONS=143} [2025-03-17 19:40:26,945 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 61 predicate places. [2025-03-17 19:40:26,945 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 143 transitions, 881 flow [2025-03-17 19:40:26,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 45.083333333333336) internal successors, (1082), 24 states have internal predecessors, (1082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:40:26,946 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:40:26,946 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:40:26,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-17 19:40:27,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-17 19:40:27,147 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-17 19:40:27,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:40:27,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1265426757, now seen corresponding path program 1 times [2025-03-17 19:40:27,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:40:27,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714990774] [2025-03-17 19:40:27,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:40:27,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:40:27,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 19:40:27,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 19:40:27,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:40:27,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:40:27,407 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 19:40:27,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:40:27,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714990774] [2025-03-17 19:40:27,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714990774] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:40:27,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143890499] [2025-03-17 19:40:27,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:40:27,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:40:27,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:40:27,410 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:40:27,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 19:40:27,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 19:40:27,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 19:40:27,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:40:27,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:40:27,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-17 19:40:27,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:40:27,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 19:40:27,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-17 19:40:27,548 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 19:40:27,549 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:40:27,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2025-03-17 19:40:27,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2025-03-17 19:40:27,596 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 19:40:27,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143890499] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:40:27,597 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:40:27,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-03-17 19:40:27,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114678705] [2025-03-17 19:40:27,597 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:40:27,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 19:40:27,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:40:27,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 19:40:27,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-03-17 19:40:27,663 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 86 [2025-03-17 19:40:27,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 143 transitions, 881 flow. Second operand has 15 states, 15 states have (on average 47.06666666666667) internal successors, (706), 15 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:40:27,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:40:27,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 86 [2025-03-17 19:40:27,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:40:28,305 INFO L124 PetriNetUnfolderBase]: 3052/7568 cut-off events. [2025-03-17 19:40:28,305 INFO L125 PetriNetUnfolderBase]: For 3989/4220 co-relation queries the response was YES. [2025-03-17 19:40:28,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16401 conditions, 7568 events. 3052/7568 cut-off events. For 3989/4220 co-relation queries the response was YES. Maximal size of possible extension queue 436. Compared 71336 event pairs, 918 based on Foata normal form. 100/6925 useless extension candidates. Maximal degree in co-relation 16368. Up to 1638 conditions per place. [2025-03-17 19:40:28,343 INFO L140 encePairwiseOnDemand]: 71/86 looper letters, 161 selfloop transitions, 36 changer transitions 0/234 dead transitions. [2025-03-17 19:40:28,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 234 transitions, 1616 flow [2025-03-17 19:40:28,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 19:40:28,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 19:40:28,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 571 transitions. [2025-03-17 19:40:28,344 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.663953488372093 [2025-03-17 19:40:28,344 INFO L175 Difference]: Start difference. First operand has 140 places, 143 transitions, 881 flow. Second operand 10 states and 571 transitions. [2025-03-17 19:40:28,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 234 transitions, 1616 flow [2025-03-17 19:40:28,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 234 transitions, 1460 flow, removed 47 selfloop flow, removed 9 redundant places. [2025-03-17 19:40:28,361 INFO L231 Difference]: Finished difference. Result has 143 places, 150 transitions, 864 flow [2025-03-17 19:40:28,361 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=725, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=864, PETRI_PLACES=143, PETRI_TRANSITIONS=150} [2025-03-17 19:40:28,361 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 64 predicate places. [2025-03-17 19:40:28,361 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 150 transitions, 864 flow [2025-03-17 19:40:28,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 47.06666666666667) internal successors, (706), 15 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:40:28,361 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:40:28,361 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:40:28,367 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 19:40:28,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:40:28,562 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-17 19:40:28,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:40:28,563 INFO L85 PathProgramCache]: Analyzing trace with hash 573493681, now seen corresponding path program 1 times [2025-03-17 19:40:28,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:40:28,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076923632] [2025-03-17 19:40:28,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:40:28,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:40:28,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 19:40:28,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 19:40:28,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:40:28,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:40:28,743 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 19:40:28,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:40:28,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076923632] [2025-03-17 19:40:28,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076923632] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:40:28,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132095161] [2025-03-17 19:40:28,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:40:28,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:40:28,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:40:28,745 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:40:28,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 19:40:28,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 19:40:28,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 19:40:28,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:40:28,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:40:28,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-17 19:40:28,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:40:28,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 19:40:28,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-17 19:40:28,859 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 19:40:28,860 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:40:28,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2025-03-17 19:40:28,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2025-03-17 19:40:28,921 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 19:40:28,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2132095161] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:40:28,921 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:40:28,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-03-17 19:40:28,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366877520] [2025-03-17 19:40:28,922 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:40:28,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 19:40:28,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:40:28,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 19:40:28,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-03-17 19:40:28,974 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 86 [2025-03-17 19:40:28,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 150 transitions, 864 flow. Second operand has 15 states, 15 states have (on average 45.2) internal successors, (678), 15 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:40:28,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:40:28,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 86 [2025-03-17 19:40:28,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:40:29,607 INFO L124 PetriNetUnfolderBase]: 3580/7801 cut-off events. [2025-03-17 19:40:29,608 INFO L125 PetriNetUnfolderBase]: For 6956/7315 co-relation queries the response was YES. [2025-03-17 19:40:29,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18843 conditions, 7801 events. 3580/7801 cut-off events. For 6956/7315 co-relation queries the response was YES. Maximal size of possible extension queue 429. Compared 68207 event pairs, 977 based on Foata normal form. 192/7381 useless extension candidates. Maximal degree in co-relation 18807. Up to 2078 conditions per place. [2025-03-17 19:40:29,647 INFO L140 encePairwiseOnDemand]: 71/86 looper letters, 165 selfloop transitions, 36 changer transitions 0/235 dead transitions. [2025-03-17 19:40:29,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 235 transitions, 1581 flow [2025-03-17 19:40:29,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 19:40:29,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 19:40:29,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 551 transitions. [2025-03-17 19:40:29,648 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6406976744186047 [2025-03-17 19:40:29,648 INFO L175 Difference]: Start difference. First operand has 143 places, 150 transitions, 864 flow. Second operand 10 states and 551 transitions. [2025-03-17 19:40:29,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 235 transitions, 1581 flow [2025-03-17 19:40:29,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 235 transitions, 1537 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-03-17 19:40:29,670 INFO L231 Difference]: Finished difference. Result has 150 places, 152 transitions, 923 flow [2025-03-17 19:40:29,670 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=814, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=923, PETRI_PLACES=150, PETRI_TRANSITIONS=152} [2025-03-17 19:40:29,671 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 71 predicate places. [2025-03-17 19:40:29,671 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 152 transitions, 923 flow [2025-03-17 19:40:29,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 45.2) internal successors, (678), 15 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:40:29,671 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:40:29,671 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:40:29,677 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-17 19:40:29,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:40:29,875 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-17 19:40:29,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:40:29,875 INFO L85 PathProgramCache]: Analyzing trace with hash -506725358, now seen corresponding path program 1 times [2025-03-17 19:40:29,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:40:29,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472844230] [2025-03-17 19:40:29,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:40:29,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:40:29,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 19:40:29,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 19:40:29,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:40:29,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:40:30,087 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:40:30,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:40:30,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472844230] [2025-03-17 19:40:30,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472844230] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:40:30,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375095376] [2025-03-17 19:40:30,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:40:30,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:40:30,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:40:30,089 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-17 19:40:30,090 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-17 19:40:30,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 19:40:30,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 19:40:30,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:40:30,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:40:30,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-17 19:40:30,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:40:30,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 19:40:30,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 19:40:30,200 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 19:40:30,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 19:40:30,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 19:40:30,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-17 19:40:30,267 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:40:30,267 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:40:30,382 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:40:30,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2025-03-17 19:40:30,389 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:40:30,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 29 [2025-03-17 19:40:30,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2025-03-17 19:40:30,434 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:40:30,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1375095376] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:40:30,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:40:30,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2025-03-17 19:40:30,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035724321] [2025-03-17 19:40:30,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:40:30,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 19:40:30,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:40:30,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 19:40:30,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=277, Unknown=4, NotChecked=0, Total=342 [2025-03-17 19:40:30,497 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 86 [2025-03-17 19:40:30,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 152 transitions, 923 flow. Second operand has 19 states, 19 states have (on average 40.421052631578945) internal successors, (768), 19 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:40:30,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:40:30,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 86 [2025-03-17 19:40:30,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:40:31,492 INFO L124 PetriNetUnfolderBase]: 5509/9815 cut-off events. [2025-03-17 19:40:31,493 INFO L125 PetriNetUnfolderBase]: For 14549/15239 co-relation queries the response was YES. [2025-03-17 19:40:31,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26913 conditions, 9815 events. 5509/9815 cut-off events. For 14549/15239 co-relation queries the response was YES. Maximal size of possible extension queue 467. Compared 74239 event pairs, 1292 based on Foata normal form. 298/9375 useless extension candidates. Maximal degree in co-relation 26875. Up to 2685 conditions per place. [2025-03-17 19:40:31,547 INFO L140 encePairwiseOnDemand]: 71/86 looper letters, 229 selfloop transitions, 37 changer transitions 14/312 dead transitions. [2025-03-17 19:40:31,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 312 transitions, 2423 flow [2025-03-17 19:40:31,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 19:40:31,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-17 19:40:31,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 641 transitions. [2025-03-17 19:40:31,548 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5733452593917711 [2025-03-17 19:40:31,548 INFO L175 Difference]: Start difference. First operand has 150 places, 152 transitions, 923 flow. Second operand 13 states and 641 transitions. [2025-03-17 19:40:31,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 312 transitions, 2423 flow [2025-03-17 19:40:31,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 312 transitions, 2312 flow, removed 1 selfloop flow, removed 7 redundant places. [2025-03-17 19:40:31,578 INFO L231 Difference]: Finished difference. Result has 158 places, 160 transitions, 1014 flow [2025-03-17 19:40:31,579 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=868, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1014, PETRI_PLACES=158, PETRI_TRANSITIONS=160} [2025-03-17 19:40:31,579 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 79 predicate places. [2025-03-17 19:40:31,579 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 160 transitions, 1014 flow [2025-03-17 19:40:31,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 40.421052631578945) internal successors, (768), 19 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:40:31,579 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:40:31,579 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:40:31,585 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-17 19:40:31,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:40:31,780 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-17 19:40:31,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:40:31,780 INFO L85 PathProgramCache]: Analyzing trace with hash 567915609, now seen corresponding path program 1 times [2025-03-17 19:40:31,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:40:31,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804835946] [2025-03-17 19:40:31,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:40:31,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:40:31,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 19:40:31,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 19:40:31,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:40:31,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:40:31,834 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:40:31,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:40:31,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804835946] [2025-03-17 19:40:31,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804835946] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:40:31,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [46901606] [2025-03-17 19:40:31,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:40:31,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:40:31,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:40:31,836 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-17 19:40:31,838 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-17 19:40:31,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 19:40:31,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 19:40:31,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:40:31,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:40:31,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 19:40:31,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:40:31,978 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 19:40:31,978 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:40:32,068 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 19:40:32,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [46901606] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:40:32,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:40:32,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 19 [2025-03-17 19:40:32,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680638783] [2025-03-17 19:40:32,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:40:32,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 19:40:32,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:40:32,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 19:40:32,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2025-03-17 19:40:32,335 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 86 [2025-03-17 19:40:32,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 160 transitions, 1014 flow. Second operand has 19 states, 19 states have (on average 44.21052631578947) internal successors, (840), 19 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:40:32,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:40:32,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 86 [2025-03-17 19:40:32,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:40:33,457 INFO L124 PetriNetUnfolderBase]: 4439/10406 cut-off events. [2025-03-17 19:40:33,458 INFO L125 PetriNetUnfolderBase]: For 15901/16503 co-relation queries the response was YES. [2025-03-17 19:40:33,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27499 conditions, 10406 events. 4439/10406 cut-off events. For 15901/16503 co-relation queries the response was YES. Maximal size of possible extension queue 495. Compared 99347 event pairs, 140 based on Foata normal form. 344/9967 useless extension candidates. Maximal degree in co-relation 27459. Up to 1945 conditions per place. [2025-03-17 19:40:33,520 INFO L140 encePairwiseOnDemand]: 75/86 looper letters, 309 selfloop transitions, 57 changer transitions 12/418 dead transitions. [2025-03-17 19:40:33,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 418 transitions, 3295 flow [2025-03-17 19:40:33,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 19:40:33,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-17 19:40:33,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 915 transitions. [2025-03-17 19:40:33,522 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6258549931600548 [2025-03-17 19:40:33,522 INFO L175 Difference]: Start difference. First operand has 158 places, 160 transitions, 1014 flow. Second operand 17 states and 915 transitions. [2025-03-17 19:40:33,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 418 transitions, 3295 flow [2025-03-17 19:40:33,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 418 transitions, 3209 flow, removed 22 selfloop flow, removed 7 redundant places. [2025-03-17 19:40:33,578 INFO L231 Difference]: Finished difference. Result has 169 places, 185 transitions, 1393 flow [2025-03-17 19:40:33,578 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=964, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1393, PETRI_PLACES=169, PETRI_TRANSITIONS=185} [2025-03-17 19:40:33,578 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 90 predicate places. [2025-03-17 19:40:33,578 INFO L471 AbstractCegarLoop]: Abstraction has has 169 places, 185 transitions, 1393 flow [2025-03-17 19:40:33,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 44.21052631578947) internal successors, (840), 19 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:40:33,579 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:40:33,579 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:40:33,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-17 19:40:33,779 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,SelfDestructingSolverStorable20 [2025-03-17 19:40:33,779 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-17 19:40:33,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:40:33,780 INFO L85 PathProgramCache]: Analyzing trace with hash 598434567, now seen corresponding path program 1 times [2025-03-17 19:40:33,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:40:33,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817228889] [2025-03-17 19:40:33,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:40:33,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:40:33,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 19:40:33,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 19:40:33,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:40:33,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:40:34,005 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:40:34,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:40:34,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817228889] [2025-03-17 19:40:34,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817228889] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:40:34,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968035171] [2025-03-17 19:40:34,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:40:34,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:40:34,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:40:34,008 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-17 19:40:34,009 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-17 19:40:34,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 19:40:34,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 19:40:34,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:40:34,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:40:34,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-17 19:40:34,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:40:34,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 19:40:34,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 19:40:34,118 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 19:40:34,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 19:40:34,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-17 19:40:34,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-17 19:40:34,215 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:40:34,215 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:40:34,277 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_238 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_124| Int)) (or (< 0 (+ 2147483649 (select (select (store |c_#memory_int#1| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_124| v_ArrVal_238) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_124|) 0)))) is different from false [2025-03-17 19:40:34,292 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:40:34,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2025-03-17 19:40:34,298 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:40:34,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2025-03-17 19:40:34,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2025-03-17 19:40:34,334 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2025-03-17 19:40:34,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1968035171] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:40:34,334 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:40:34,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2025-03-17 19:40:34,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481943552] [2025-03-17 19:40:34,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:40:34,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 19:40:34,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:40:34,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 19:40:34,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=4, NotChecked=34, Total=380 [2025-03-17 19:40:34,380 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 86 [2025-03-17 19:40:34,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 185 transitions, 1393 flow. Second operand has 20 states, 20 states have (on average 38.05) internal successors, (761), 20 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:40:34,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:40:34,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 86 [2025-03-17 19:40:34,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:40:35,870 INFO L124 PetriNetUnfolderBase]: 8088/14403 cut-off events. [2025-03-17 19:40:35,870 INFO L125 PetriNetUnfolderBase]: For 21852/22956 co-relation queries the response was YES. [2025-03-17 19:40:35,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41471 conditions, 14403 events. 8088/14403 cut-off events. For 21852/22956 co-relation queries the response was YES. Maximal size of possible extension queue 608. Compared 116259 event pairs, 1672 based on Foata normal form. 532/14279 useless extension candidates. Maximal degree in co-relation 41431. Up to 3378 conditions per place. [2025-03-17 19:40:35,969 INFO L140 encePairwiseOnDemand]: 68/86 looper letters, 349 selfloop transitions, 46 changer transitions 0/422 dead transitions. [2025-03-17 19:40:35,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 422 transitions, 3475 flow [2025-03-17 19:40:35,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 19:40:35,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-17 19:40:35,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 822 transitions. [2025-03-17 19:40:35,971 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5622435020519836 [2025-03-17 19:40:35,971 INFO L175 Difference]: Start difference. First operand has 169 places, 185 transitions, 1393 flow. Second operand 17 states and 822 transitions. [2025-03-17 19:40:35,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 422 transitions, 3475 flow [2025-03-17 19:40:36,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 422 transitions, 3449 flow, removed 1 selfloop flow, removed 7 redundant places. [2025-03-17 19:40:36,036 INFO L231 Difference]: Finished difference. Result has 184 places, 189 transitions, 1518 flow [2025-03-17 19:40:36,036 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=1359, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1518, PETRI_PLACES=184, PETRI_TRANSITIONS=189} [2025-03-17 19:40:36,036 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 105 predicate places. [2025-03-17 19:40:36,036 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 189 transitions, 1518 flow [2025-03-17 19:40:36,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 38.05) internal successors, (761), 20 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:40:36,037 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:40:36,037 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:40:36,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-17 19:40:36,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-17 19:40:36,237 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-17 19:40:36,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:40:36,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1371603028, now seen corresponding path program 1 times [2025-03-17 19:40:36,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:40:36,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815284449] [2025-03-17 19:40:36,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:40:36,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:40:36,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 19:40:36,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 19:40:36,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:40:36,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:40:36,465 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:40:36,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:40:36,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815284449] [2025-03-17 19:40:36,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815284449] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:40:36,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658980112] [2025-03-17 19:40:36,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:40:36,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:40:36,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:40:36,468 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:40:36,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-17 19:40:36,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 19:40:36,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 19:40:36,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:40:36,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:40:36,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-17 19:40:36,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:40:36,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 19:40:36,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 19:40:36,574 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 19:40:36,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 19:40:36,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 19:40:36,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-17 19:40:36,668 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:40:36,668 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:40:36,776 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:40:36,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2025-03-17 19:40:36,783 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:40:36,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 29 [2025-03-17 19:40:36,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2025-03-17 19:40:36,821 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:40:36,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1658980112] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:40:36,821 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:40:36,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2025-03-17 19:40:36,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453697526] [2025-03-17 19:40:36,821 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:40:36,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-17 19:40:36,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:40:36,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-17 19:40:36,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=348, Unknown=8, NotChecked=0, Total=420 [2025-03-17 19:40:36,981 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 86 [2025-03-17 19:40:36,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 189 transitions, 1518 flow. Second operand has 21 states, 21 states have (on average 38.04761904761905) internal successors, (799), 21 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:40:36,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:40:36,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 86 [2025-03-17 19:40:36,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:40:38,724 INFO L124 PetriNetUnfolderBase]: 8664/15917 cut-off events. [2025-03-17 19:40:38,725 INFO L125 PetriNetUnfolderBase]: For 27285/28311 co-relation queries the response was YES. [2025-03-17 19:40:38,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48205 conditions, 15917 events. 8664/15917 cut-off events. For 27285/28311 co-relation queries the response was YES. Maximal size of possible extension queue 711. Compared 134040 event pairs, 2232 based on Foata normal form. 794/15935 useless extension candidates. Maximal degree in co-relation 48160. Up to 3828 conditions per place. [2025-03-17 19:40:38,812 INFO L140 encePairwiseOnDemand]: 67/86 looper letters, 368 selfloop transitions, 48 changer transitions 3/448 dead transitions. [2025-03-17 19:40:38,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 448 transitions, 3788 flow [2025-03-17 19:40:38,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 19:40:38,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-17 19:40:38,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 867 transitions. [2025-03-17 19:40:38,816 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.560077519379845 [2025-03-17 19:40:38,816 INFO L175 Difference]: Start difference. First operand has 184 places, 189 transitions, 1518 flow. Second operand 18 states and 867 transitions. [2025-03-17 19:40:38,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 448 transitions, 3788 flow [2025-03-17 19:40:38,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 448 transitions, 3711 flow, removed 3 selfloop flow, removed 11 redundant places. [2025-03-17 19:40:38,908 INFO L231 Difference]: Finished difference. Result has 195 places, 196 transitions, 1609 flow [2025-03-17 19:40:38,908 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=1443, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1609, PETRI_PLACES=195, PETRI_TRANSITIONS=196} [2025-03-17 19:40:38,909 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 116 predicate places. [2025-03-17 19:40:38,909 INFO L471 AbstractCegarLoop]: Abstraction has has 195 places, 196 transitions, 1609 flow [2025-03-17 19:40:38,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 38.04761904761905) internal successors, (799), 21 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:40:38,909 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:40:38,909 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:40:38,915 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-17 19:40:39,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-17 19:40:39,110 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-17 19:40:39,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:40:39,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1471352996, now seen corresponding path program 1 times [2025-03-17 19:40:39,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:40:39,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599723575] [2025-03-17 19:40:39,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:40:39,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:40:39,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 19:40:39,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 19:40:39,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:40:39,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:40:39,283 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:40:39,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:40:39,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599723575] [2025-03-17 19:40:39,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599723575] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:40:39,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938717191] [2025-03-17 19:40:39,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:40:39,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:40:39,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:40:39,286 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:40:39,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-17 19:40:39,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 19:40:39,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 19:40:39,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:40:39,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:40:39,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-17 19:40:39,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:40:39,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 19:40:39,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 19:40:39,395 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 19:40:39,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 19:40:39,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-17 19:40:39,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-17 19:40:39,463 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:40:39,464 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:40:39,508 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_278 (Array Int Int))) (< 0 (+ 4294967296 (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_278) c_~a1~0.base) c_~a1~0.offset)))) is different from false [2025-03-17 19:40:39,515 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_128| Int) (v_ArrVal_278 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_128|) 0)) (< 0 (+ 4294967296 (select (select (store |c_#memory_int#1| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_128| v_ArrVal_278) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) is different from false [2025-03-17 19:40:39,531 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:40:39,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2025-03-17 19:40:39,536 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:40:39,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2025-03-17 19:40:39,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2025-03-17 19:40:39,565 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-03-17 19:40:39,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938717191] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:40:39,565 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:40:39,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2025-03-17 19:40:39,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011961470] [2025-03-17 19:40:39,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:40:39,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 19:40:39,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:40:39,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 19:40:39,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=221, Unknown=2, NotChecked=62, Total=342 [2025-03-17 19:40:39,566 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 86 [2025-03-17 19:40:39,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 196 transitions, 1609 flow. Second operand has 19 states, 19 states have (on average 40.421052631578945) internal successors, (768), 19 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:40:39,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:40:39,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 86 [2025-03-17 19:40:39,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:40:41,439 INFO L124 PetriNetUnfolderBase]: 8835/16177 cut-off events. [2025-03-17 19:40:41,439 INFO L125 PetriNetUnfolderBase]: For 46175/47097 co-relation queries the response was YES. [2025-03-17 19:40:41,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52507 conditions, 16177 events. 8835/16177 cut-off events. For 46175/47097 co-relation queries the response was YES. Maximal size of possible extension queue 715. Compared 135622 event pairs, 2693 based on Foata normal form. 538/15671 useless extension candidates. Maximal degree in co-relation 52458. Up to 5450 conditions per place. [2025-03-17 19:40:41,580 INFO L140 encePairwiseOnDemand]: 71/86 looper letters, 288 selfloop transitions, 39 changer transitions 0/363 dead transitions. [2025-03-17 19:40:41,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 363 transitions, 3534 flow [2025-03-17 19:40:41,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 19:40:41,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-17 19:40:41,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 627 transitions. [2025-03-17 19:40:41,582 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5608228980322003 [2025-03-17 19:40:41,582 INFO L175 Difference]: Start difference. First operand has 195 places, 196 transitions, 1609 flow. Second operand 13 states and 627 transitions. [2025-03-17 19:40:41,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 363 transitions, 3534 flow [2025-03-17 19:40:41,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 363 transitions, 3346 flow, removed 13 selfloop flow, removed 11 redundant places. [2025-03-17 19:40:41,686 INFO L231 Difference]: Finished difference. Result has 198 places, 198 transitions, 1626 flow [2025-03-17 19:40:41,686 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=1511, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1626, PETRI_PLACES=198, PETRI_TRANSITIONS=198} [2025-03-17 19:40:41,687 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 119 predicate places. [2025-03-17 19:40:41,687 INFO L471 AbstractCegarLoop]: Abstraction has has 198 places, 198 transitions, 1626 flow [2025-03-17 19:40:41,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 40.421052631578945) internal successors, (768), 19 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:40:41,687 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:40:41,687 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:40:41,693 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-17 19:40:41,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-17 19:40:41,888 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-17 19:40:41,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:40:41,888 INFO L85 PathProgramCache]: Analyzing trace with hash 488710478, now seen corresponding path program 1 times [2025-03-17 19:40:41,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:40:41,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610172342] [2025-03-17 19:40:41,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:40:41,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:40:41,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 19:40:41,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 19:40:41,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:40:41,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:40:41,928 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:40:41,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:40:41,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610172342] [2025-03-17 19:40:41,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610172342] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:40:41,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:40:41,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:40:41,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616305110] [2025-03-17 19:40:41,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:40:41,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:40:41,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:40:41,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:40:41,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:40:41,943 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 86 [2025-03-17 19:40:41,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 198 transitions, 1626 flow. Second operand has 4 states, 4 states have (on average 46.0) internal successors, (184), 4 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:40:41,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:40:41,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 86 [2025-03-17 19:40:41,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:40:42,989 INFO L124 PetriNetUnfolderBase]: 6036/13116 cut-off events. [2025-03-17 19:40:42,990 INFO L125 PetriNetUnfolderBase]: For 29073/29491 co-relation queries the response was YES. [2025-03-17 19:40:43,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40731 conditions, 13116 events. 6036/13116 cut-off events. For 29073/29491 co-relation queries the response was YES. Maximal size of possible extension queue 640. Compared 123650 event pairs, 2549 based on Foata normal form. 496/13042 useless extension candidates. Maximal degree in co-relation 40682. Up to 5609 conditions per place. [2025-03-17 19:40:43,067 INFO L140 encePairwiseOnDemand]: 81/86 looper letters, 195 selfloop transitions, 10 changer transitions 0/245 dead transitions. [2025-03-17 19:40:43,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 245 transitions, 2316 flow [2025-03-17 19:40:43,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:40:43,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 19:40:43,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 241 transitions. [2025-03-17 19:40:43,068 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7005813953488372 [2025-03-17 19:40:43,068 INFO L175 Difference]: Start difference. First operand has 198 places, 198 transitions, 1626 flow. Second operand 4 states and 241 transitions. [2025-03-17 19:40:43,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 245 transitions, 2316 flow [2025-03-17 19:40:43,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 245 transitions, 2221 flow, removed 1 selfloop flow, removed 12 redundant places. [2025-03-17 19:40:43,147 INFO L231 Difference]: Finished difference. Result has 188 places, 195 transitions, 1553 flow [2025-03-17 19:40:43,147 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=1533, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1553, PETRI_PLACES=188, PETRI_TRANSITIONS=195} [2025-03-17 19:40:43,148 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 109 predicate places. [2025-03-17 19:40:43,148 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 195 transitions, 1553 flow [2025-03-17 19:40:43,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.0) internal successors, (184), 4 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:40:43,148 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:40:43,148 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:40:43,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-17 19:40:43,148 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-17 19:40:43,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:40:43,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1663216666, now seen corresponding path program 1 times [2025-03-17 19:40:43,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:40:43,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006242003] [2025-03-17 19:40:43,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:40:43,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:40:43,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 19:40:43,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 19:40:43,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:40:43,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:40:43,185 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:40:43,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:40:43,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006242003] [2025-03-17 19:40:43,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006242003] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:40:43,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675696000] [2025-03-17 19:40:43,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:40:43,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:40:43,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:40:43,188 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:40:43,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-17 19:40:43,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 19:40:43,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 19:40:43,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:40:43,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:40:43,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 19:40:43,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:40:43,320 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 19:40:43,320 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:40:43,404 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 19:40:43,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675696000] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:40:43,405 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:40:43,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2025-03-17 19:40:43,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889219766] [2025-03-17 19:40:43,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:40:43,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 19:40:43,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:40:43,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 19:40:43,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2025-03-17 19:40:43,687 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 86 [2025-03-17 19:40:43,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 195 transitions, 1553 flow. Second operand has 19 states, 19 states have (on average 44.26315789473684) internal successors, (841), 19 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:40:43,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:40:43,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 86 [2025-03-17 19:40:43,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:40:45,371 INFO L124 PetriNetUnfolderBase]: 7223/17388 cut-off events. [2025-03-17 19:40:45,371 INFO L125 PetriNetUnfolderBase]: For 39547/40185 co-relation queries the response was YES. [2025-03-17 19:40:45,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50071 conditions, 17388 events. 7223/17388 cut-off events. For 39547/40185 co-relation queries the response was YES. Maximal size of possible extension queue 772. Compared 182072 event pairs, 316 based on Foata normal form. 546/16643 useless extension candidates. Maximal degree in co-relation 50025. Up to 3115 conditions per place. [2025-03-17 19:40:45,476 INFO L140 encePairwiseOnDemand]: 75/86 looper letters, 315 selfloop transitions, 87 changer transitions 36/481 dead transitions. [2025-03-17 19:40:45,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 481 transitions, 4491 flow [2025-03-17 19:40:45,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 19:40:45,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-17 19:40:45,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 771 transitions. [2025-03-17 19:40:45,477 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6403654485049833 [2025-03-17 19:40:45,477 INFO L175 Difference]: Start difference. First operand has 188 places, 195 transitions, 1553 flow. Second operand 14 states and 771 transitions. [2025-03-17 19:40:45,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 481 transitions, 4491 flow [2025-03-17 19:40:45,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 481 transitions, 4399 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 19:40:45,609 INFO L231 Difference]: Finished difference. Result has 199 places, 197 transitions, 1740 flow [2025-03-17 19:40:45,609 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=1537, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1740, PETRI_PLACES=199, PETRI_TRANSITIONS=197} [2025-03-17 19:40:45,610 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 120 predicate places. [2025-03-17 19:40:45,610 INFO L471 AbstractCegarLoop]: Abstraction has has 199 places, 197 transitions, 1740 flow [2025-03-17 19:40:45,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 44.26315789473684) internal successors, (841), 19 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:40:45,610 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:40:45,610 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:40:45,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-17 19:40:45,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:40:45,811 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-17 19:40:45,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:40:45,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1632696715, now seen corresponding path program 1 times [2025-03-17 19:40:45,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:40:45,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93922937] [2025-03-17 19:40:45,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:40:45,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:40:45,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 19:40:45,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 19:40:45,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:40:45,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:40:45,844 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:40:45,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:40:45,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93922937] [2025-03-17 19:40:45,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93922937] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:40:45,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:40:45,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:40:45,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278103995] [2025-03-17 19:40:45,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:40:45,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:40:45,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:40:45,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:40:45,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:40:45,863 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 86 [2025-03-17 19:40:45,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 197 transitions, 1740 flow. Second operand has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:40:45,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:40:45,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 86 [2025-03-17 19:40:45,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:40:47,345 INFO L124 PetriNetUnfolderBase]: 8768/19937 cut-off events. [2025-03-17 19:40:47,345 INFO L125 PetriNetUnfolderBase]: For 46389/46827 co-relation queries the response was YES. [2025-03-17 19:40:47,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59901 conditions, 19937 events. 8768/19937 cut-off events. For 46389/46827 co-relation queries the response was YES. Maximal size of possible extension queue 872. Compared 206000 event pairs, 4165 based on Foata normal form. 580/19293 useless extension candidates. Maximal degree in co-relation 59854. Up to 8836 conditions per place. [2025-03-17 19:40:47,473 INFO L140 encePairwiseOnDemand]: 81/86 looper letters, 217 selfloop transitions, 8 changer transitions 0/262 dead transitions. [2025-03-17 19:40:47,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 262 transitions, 2645 flow [2025-03-17 19:40:47,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:40:47,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 19:40:47,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 241 transitions. [2025-03-17 19:40:47,474 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7005813953488372 [2025-03-17 19:40:47,474 INFO L175 Difference]: Start difference. First operand has 199 places, 197 transitions, 1740 flow. Second operand 4 states and 241 transitions. [2025-03-17 19:40:47,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 262 transitions, 2645 flow [2025-03-17 19:40:47,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 262 transitions, 2606 flow, removed 1 selfloop flow, removed 6 redundant places. [2025-03-17 19:40:47,610 INFO L231 Difference]: Finished difference. Result has 196 places, 195 transitions, 1700 flow [2025-03-17 19:40:47,610 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=1684, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1700, PETRI_PLACES=196, PETRI_TRANSITIONS=195} [2025-03-17 19:40:47,611 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 117 predicate places. [2025-03-17 19:40:47,611 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 195 transitions, 1700 flow [2025-03-17 19:40:47,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:40:47,611 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:40:47,611 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:40:47,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-17 19:40:47,611 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-17 19:40:47,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:40:47,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1632697708, now seen corresponding path program 1 times [2025-03-17 19:40:47,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:40:47,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935162537] [2025-03-17 19:40:47,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:40:47,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:40:47,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 19:40:47,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 19:40:47,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:40:47,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:40:47,743 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 19:40:47,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:40:47,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935162537] [2025-03-17 19:40:47,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935162537] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:40:47,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379522593] [2025-03-17 19:40:47,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:40:47,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:40:47,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:40:47,746 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:40:47,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-17 19:40:47,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 19:40:47,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 19:40:47,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:40:47,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:40:47,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-17 19:40:47,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:40:47,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 19:40:47,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-17 19:40:47,898 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 19:40:47,898 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:40:47,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2025-03-17 19:40:47,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2025-03-17 19:40:47,948 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 19:40:47,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [379522593] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:40:47,948 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:40:47,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-03-17 19:40:47,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030620649] [2025-03-17 19:40:47,948 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:40:47,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 19:40:47,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:40:47,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 19:40:47,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2025-03-17 19:40:47,997 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 86 [2025-03-17 19:40:47,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 195 transitions, 1700 flow. Second operand has 15 states, 15 states have (on average 41.46666666666667) internal successors, (622), 15 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:40:47,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:40:47,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 86 [2025-03-17 19:40:47,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:40:50,256 INFO L124 PetriNetUnfolderBase]: 11117/21106 cut-off events. [2025-03-17 19:40:50,257 INFO L125 PetriNetUnfolderBase]: For 50529/51535 co-relation queries the response was YES. [2025-03-17 19:40:50,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66582 conditions, 21106 events. 11117/21106 cut-off events. For 50529/51535 co-relation queries the response was YES. Maximal size of possible extension queue 838. Compared 190067 event pairs, 2331 based on Foata normal form. 574/20910 useless extension candidates. Maximal degree in co-relation 66536. Up to 4895 conditions per place. [2025-03-17 19:40:50,446 INFO L140 encePairwiseOnDemand]: 69/86 looper letters, 393 selfloop transitions, 46 changer transitions 0/473 dead transitions. [2025-03-17 19:40:50,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 473 transitions, 4499 flow [2025-03-17 19:40:50,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 19:40:50,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-17 19:40:50,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 733 transitions. [2025-03-17 19:40:50,447 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6088039867109635 [2025-03-17 19:40:50,447 INFO L175 Difference]: Start difference. First operand has 196 places, 195 transitions, 1700 flow. Second operand 14 states and 733 transitions. [2025-03-17 19:40:50,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 473 transitions, 4499 flow [2025-03-17 19:40:50,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 473 transitions, 4486 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 19:40:50,605 INFO L231 Difference]: Finished difference. Result has 213 places, 200 transitions, 1847 flow [2025-03-17 19:40:50,605 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=1688, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1847, PETRI_PLACES=213, PETRI_TRANSITIONS=200} [2025-03-17 19:40:50,605 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 134 predicate places. [2025-03-17 19:40:50,605 INFO L471 AbstractCegarLoop]: Abstraction has has 213 places, 200 transitions, 1847 flow [2025-03-17 19:40:50,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 41.46666666666667) internal successors, (622), 15 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:40:50,606 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:40:50,606 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:40:50,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-17 19:40:50,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-17 19:40:50,809 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-17 19:40:50,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:40:50,809 INFO L85 PathProgramCache]: Analyzing trace with hash 925979271, now seen corresponding path program 1 times [2025-03-17 19:40:50,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:40:50,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995745729] [2025-03-17 19:40:50,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:40:50,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:40:50,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 19:40:50,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 19:40:50,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:40:50,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:40:50,987 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 19:40:50,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:40:50,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995745729] [2025-03-17 19:40:50,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995745729] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:40:50,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [300380402] [2025-03-17 19:40:50,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:40:50,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:40:50,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:40:50,990 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:40:50,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-17 19:40:51,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 19:40:51,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 19:40:51,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:40:51,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:40:51,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-17 19:40:51,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:40:51,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 19:40:51,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-17 19:40:51,146 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 19:40:51,146 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:40:51,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2025-03-17 19:40:51,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2025-03-17 19:40:51,201 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 19:40:51,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [300380402] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:40:51,201 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:40:51,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2025-03-17 19:40:51,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968347355] [2025-03-17 19:40:51,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:40:51,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 19:40:51,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:40:51,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 19:40:51,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2025-03-17 19:40:51,288 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 86 [2025-03-17 19:40:51,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 200 transitions, 1847 flow. Second operand has 16 states, 16 states have (on average 42.3125) internal successors, (677), 16 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:40:51,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:40:51,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 86 [2025-03-17 19:40:51,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:40:53,428 INFO L124 PetriNetUnfolderBase]: 10807/20894 cut-off events. [2025-03-17 19:40:53,428 INFO L125 PetriNetUnfolderBase]: For 63547/64517 co-relation queries the response was YES. [2025-03-17 19:40:53,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70869 conditions, 20894 events. 10807/20894 cut-off events. For 63547/64517 co-relation queries the response was YES. Maximal size of possible extension queue 852. Compared 191494 event pairs, 2601 based on Foata normal form. 1216/21518 useless extension candidates. Maximal degree in co-relation 70816. Up to 5393 conditions per place. [2025-03-17 19:40:53,582 INFO L140 encePairwiseOnDemand]: 67/86 looper letters, 417 selfloop transitions, 48 changer transitions 3/506 dead transitions. [2025-03-17 19:40:53,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 506 transitions, 4933 flow [2025-03-17 19:40:53,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 19:40:53,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-17 19:40:53,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 795 transitions. [2025-03-17 19:40:53,583 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6162790697674418 [2025-03-17 19:40:53,583 INFO L175 Difference]: Start difference. First operand has 213 places, 200 transitions, 1847 flow. Second operand 15 states and 795 transitions. [2025-03-17 19:40:53,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 506 transitions, 4933 flow [2025-03-17 19:40:53,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 506 transitions, 4857 flow, removed 3 selfloop flow, removed 8 redundant places. [2025-03-17 19:40:53,779 INFO L231 Difference]: Finished difference. Result has 224 places, 207 transitions, 1940 flow [2025-03-17 19:40:53,779 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=1773, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1940, PETRI_PLACES=224, PETRI_TRANSITIONS=207} [2025-03-17 19:40:53,780 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 145 predicate places. [2025-03-17 19:40:53,780 INFO L471 AbstractCegarLoop]: Abstraction has has 224 places, 207 transitions, 1940 flow [2025-03-17 19:40:53,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 42.3125) internal successors, (677), 16 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:40:53,781 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:40:53,781 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:40:53,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-17 19:40:53,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-17 19:40:53,981 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-17 19:40:53,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:40:53,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1932306926, now seen corresponding path program 1 times [2025-03-17 19:40:53,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:40:53,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352082621] [2025-03-17 19:40:53,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:40:53,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:40:53,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 19:40:53,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 19:40:53,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:40:53,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:40:54,053 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-17 19:40:54,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:40:54,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352082621] [2025-03-17 19:40:54,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352082621] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:40:54,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935847662] [2025-03-17 19:40:54,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:40:54,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:40:54,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:40:54,055 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:40:54,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-17 19:40:54,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 19:40:54,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 19:40:54,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:40:54,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:40:54,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 19:40:54,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:40:54,207 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-17 19:40:54,207 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:40:54,273 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-17 19:40:54,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [935847662] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:40:54,274 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:40:54,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-03-17 19:40:54,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429383920] [2025-03-17 19:40:54,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:40:54,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 19:40:54,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:40:54,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 19:40:54,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2025-03-17 19:40:54,531 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 86 [2025-03-17 19:40:54,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 207 transitions, 1940 flow. Second operand has 20 states, 20 states have (on average 43.75) internal successors, (875), 20 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:40:54,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:40:54,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 86 [2025-03-17 19:40:54,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:40:56,172 INFO L124 PetriNetUnfolderBase]: 7039/16537 cut-off events. [2025-03-17 19:40:56,172 INFO L125 PetriNetUnfolderBase]: For 54167/54515 co-relation queries the response was YES. [2025-03-17 19:40:56,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57995 conditions, 16537 events. 7039/16537 cut-off events. For 54167/54515 co-relation queries the response was YES. Maximal size of possible extension queue 741. Compared 168995 event pairs, 4421 based on Foata normal form. 316/16713 useless extension candidates. Maximal degree in co-relation 57938. Up to 7679 conditions per place. [2025-03-17 19:40:56,272 INFO L140 encePairwiseOnDemand]: 76/86 looper letters, 145 selfloop transitions, 85 changer transitions 26/303 dead transitions. [2025-03-17 19:40:56,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 303 transitions, 3139 flow [2025-03-17 19:40:56,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 19:40:56,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 19:40:56,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 540 transitions. [2025-03-17 19:40:56,273 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.627906976744186 [2025-03-17 19:40:56,274 INFO L175 Difference]: Start difference. First operand has 224 places, 207 transitions, 1940 flow. Second operand 10 states and 540 transitions. [2025-03-17 19:40:56,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 303 transitions, 3139 flow [2025-03-17 19:40:56,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 303 transitions, 2992 flow, removed 13 selfloop flow, removed 8 redundant places. [2025-03-17 19:40:56,522 INFO L231 Difference]: Finished difference. Result has 229 places, 211 transitions, 2092 flow [2025-03-17 19:40:56,523 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=1849, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2092, PETRI_PLACES=229, PETRI_TRANSITIONS=211} [2025-03-17 19:40:56,523 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 150 predicate places. [2025-03-17 19:40:56,523 INFO L471 AbstractCegarLoop]: Abstraction has has 229 places, 211 transitions, 2092 flow [2025-03-17 19:40:56,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 43.75) internal successors, (875), 20 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:40:56,523 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:40:56,523 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:40:56,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-03-17 19:40:56,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:40:56,724 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-17 19:40:56,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:40:56,725 INFO L85 PathProgramCache]: Analyzing trace with hash -440724069, now seen corresponding path program 1 times [2025-03-17 19:40:56,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:40:56,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983990713] [2025-03-17 19:40:56,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:40:56,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:40:56,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 19:40:56,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 19:40:56,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:40:56,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:40:56,758 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:40:56,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:40:56,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983990713] [2025-03-17 19:40:56,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983990713] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:40:56,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:40:56,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:40:56,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703434429] [2025-03-17 19:40:56,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:40:56,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:40:56,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:40:56,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:40:56,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:40:56,772 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 86 [2025-03-17 19:40:56,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 211 transitions, 2092 flow. Second operand has 4 states, 4 states have (on average 46.5) internal successors, (186), 4 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:40:56,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:40:56,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 86 [2025-03-17 19:40:56,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:40:58,201 INFO L124 PetriNetUnfolderBase]: 8633/17680 cut-off events. [2025-03-17 19:40:58,202 INFO L125 PetriNetUnfolderBase]: For 56156/56666 co-relation queries the response was YES. [2025-03-17 19:40:58,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62265 conditions, 17680 events. 8633/17680 cut-off events. For 56156/56666 co-relation queries the response was YES. Maximal size of possible extension queue 751. Compared 164926 event pairs, 3622 based on Foata normal form. 632/18151 useless extension candidates. Maximal degree in co-relation 62207. Up to 7895 conditions per place. [2025-03-17 19:40:58,389 INFO L140 encePairwiseOnDemand]: 81/86 looper letters, 216 selfloop transitions, 10 changer transitions 20/287 dead transitions. [2025-03-17 19:40:58,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 287 transitions, 3249 flow [2025-03-17 19:40:58,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:40:58,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 19:40:58,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 239 transitions. [2025-03-17 19:40:58,390 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6947674418604651 [2025-03-17 19:40:58,390 INFO L175 Difference]: Start difference. First operand has 229 places, 211 transitions, 2092 flow. Second operand 4 states and 239 transitions. [2025-03-17 19:40:58,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 287 transitions, 3249 flow [2025-03-17 19:40:58,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 287 transitions, 3084 flow, removed 1 selfloop flow, removed 7 redundant places. [2025-03-17 19:40:58,643 INFO L231 Difference]: Finished difference. Result has 222 places, 201 transitions, 1807 flow [2025-03-17 19:40:58,643 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=1914, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1807, PETRI_PLACES=222, PETRI_TRANSITIONS=201} [2025-03-17 19:40:58,643 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 143 predicate places. [2025-03-17 19:40:58,643 INFO L471 AbstractCegarLoop]: Abstraction has has 222 places, 201 transitions, 1807 flow [2025-03-17 19:40:58,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.5) internal successors, (186), 4 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:40:58,644 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:40:58,644 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:40:58,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-17 19:40:58,644 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-17 19:40:58,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:40:58,644 INFO L85 PathProgramCache]: Analyzing trace with hash 635534035, now seen corresponding path program 1 times [2025-03-17 19:40:58,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:40:58,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941214238] [2025-03-17 19:40:58,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:40:58,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:40:58,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 19:40:58,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 19:40:58,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:40:58,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:40:58,686 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-17 19:40:58,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:40:58,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941214238] [2025-03-17 19:40:58,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941214238] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:40:58,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1281082272] [2025-03-17 19:40:58,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:40:58,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:40:58,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:40:58,692 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:40:58,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-17 19:40:58,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 19:40:58,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 19:40:58,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:40:58,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:40:58,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 19:40:58,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:40:58,840 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 19:40:58,840 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:40:58,937 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 19:40:58,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1281082272] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:40:58,937 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:40:58,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 19 [2025-03-17 19:40:58,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139108279] [2025-03-17 19:40:58,938 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:40:58,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 19:40:58,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:40:58,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 19:40:58,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2025-03-17 19:40:59,239 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 86 [2025-03-17 19:40:59,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 201 transitions, 1807 flow. Second operand has 19 states, 19 states have (on average 44.421052631578945) internal successors, (844), 19 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:40:59,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:40:59,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 86 [2025-03-17 19:40:59,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:41:00,559 INFO L124 PetriNetUnfolderBase]: 5539/12670 cut-off events. [2025-03-17 19:41:00,559 INFO L125 PetriNetUnfolderBase]: For 38921/39517 co-relation queries the response was YES. [2025-03-17 19:41:00,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44550 conditions, 12670 events. 5539/12670 cut-off events. For 38921/39517 co-relation queries the response was YES. Maximal size of possible extension queue 486. Compared 119546 event pairs, 1301 based on Foata normal form. 412/13071 useless extension candidates. Maximal degree in co-relation 44493. Up to 2639 conditions per place. [2025-03-17 19:41:00,656 INFO L140 encePairwiseOnDemand]: 75/86 looper letters, 237 selfloop transitions, 54 changer transitions 101/437 dead transitions. [2025-03-17 19:41:00,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 437 transitions, 4346 flow [2025-03-17 19:41:00,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 19:41:00,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-17 19:41:00,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 916 transitions. [2025-03-17 19:41:00,657 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6265389876880985 [2025-03-17 19:41:00,658 INFO L175 Difference]: Start difference. First operand has 222 places, 201 transitions, 1807 flow. Second operand 17 states and 916 transitions. [2025-03-17 19:41:00,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 437 transitions, 4346 flow [2025-03-17 19:41:00,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 437 transitions, 4252 flow, removed 36 selfloop flow, removed 6 redundant places. [2025-03-17 19:41:00,880 INFO L231 Difference]: Finished difference. Result has 229 places, 200 transitions, 1878 flow [2025-03-17 19:41:00,880 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=1781, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1878, PETRI_PLACES=229, PETRI_TRANSITIONS=200} [2025-03-17 19:41:00,881 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 150 predicate places. [2025-03-17 19:41:00,881 INFO L471 AbstractCegarLoop]: Abstraction has has 229 places, 200 transitions, 1878 flow [2025-03-17 19:41:00,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 44.421052631578945) internal successors, (844), 19 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:41:00,881 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:41:00,881 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:41:00,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-03-17 19:41:01,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:41:01,082 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-17 19:41:01,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:41:01,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1677196480, now seen corresponding path program 2 times [2025-03-17 19:41:01,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:41:01,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321953053] [2025-03-17 19:41:01,083 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:41:01,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:41:01,088 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-17 19:41:01,094 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 19:41:01,094 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:41:01,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:41:01,124 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-17 19:41:01,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:41:01,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321953053] [2025-03-17 19:41:01,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321953053] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:41:01,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59559585] [2025-03-17 19:41:01,124 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:41:01,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:41:01,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:41:01,126 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:41:01,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-17 19:41:01,178 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-17 19:41:01,194 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 19:41:01,195 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:41:01,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:41:01,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 19:41:01,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:41:01,216 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-17 19:41:01,216 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:41:01,242 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-17 19:41:01,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [59559585] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:41:01,243 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:41:01,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2025-03-17 19:41:01,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798009196] [2025-03-17 19:41:01,243 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:41:01,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 19:41:01,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:41:01,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 19:41:01,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 19:41:01,272 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 86 [2025-03-17 19:41:01,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 200 transitions, 1878 flow. Second operand has 6 states, 6 states have (on average 47.0) internal successors, (282), 6 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:41:01,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:41:01,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 86 [2025-03-17 19:41:01,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:41:02,194 INFO L124 PetriNetUnfolderBase]: 4612/10805 cut-off events. [2025-03-17 19:41:02,194 INFO L125 PetriNetUnfolderBase]: For 31176/31650 co-relation queries the response was YES. [2025-03-17 19:41:02,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37594 conditions, 10805 events. 4612/10805 cut-off events. For 31176/31650 co-relation queries the response was YES. Maximal size of possible extension queue 538. Compared 103128 event pairs, 1232 based on Foata normal form. 345/11094 useless extension candidates. Maximal degree in co-relation 37537. Up to 5874 conditions per place. [2025-03-17 19:41:02,293 INFO L140 encePairwiseOnDemand]: 80/86 looper letters, 215 selfloop transitions, 7 changer transitions 0/268 dead transitions. [2025-03-17 19:41:02,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 268 transitions, 2799 flow [2025-03-17 19:41:02,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 19:41:02,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 19:41:02,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 280 transitions. [2025-03-17 19:41:02,294 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6511627906976745 [2025-03-17 19:41:02,294 INFO L175 Difference]: Start difference. First operand has 229 places, 200 transitions, 1878 flow. Second operand 5 states and 280 transitions. [2025-03-17 19:41:02,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 268 transitions, 2799 flow [2025-03-17 19:41:02,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 268 transitions, 2713 flow, removed 9 selfloop flow, removed 12 redundant places. [2025-03-17 19:41:02,411 INFO L231 Difference]: Finished difference. Result has 215 places, 200 transitions, 1829 flow [2025-03-17 19:41:02,412 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=1806, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1829, PETRI_PLACES=215, PETRI_TRANSITIONS=200} [2025-03-17 19:41:02,412 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 136 predicate places. [2025-03-17 19:41:02,412 INFO L471 AbstractCegarLoop]: Abstraction has has 215 places, 200 transitions, 1829 flow [2025-03-17 19:41:02,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 47.0) internal successors, (282), 6 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:41:02,412 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:41:02,412 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:41:02,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-03-17 19:41:02,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:41:02,613 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-17 19:41:02,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:41:02,613 INFO L85 PathProgramCache]: Analyzing trace with hash -453449904, now seen corresponding path program 1 times [2025-03-17 19:41:02,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:41:02,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233028735] [2025-03-17 19:41:02,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:41:02,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:41:02,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 19:41:02,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 19:41:02,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:41:02,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:41:02,879 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:41:02,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:41:02,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233028735] [2025-03-17 19:41:02,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233028735] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:41:02,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990202584] [2025-03-17 19:41:02,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:41:02,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:41:02,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:41:02,882 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:41:02,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-17 19:41:02,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 19:41:02,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 19:41:02,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:41:02,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:41:02,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-17 19:41:02,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:41:02,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-17 19:41:03,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-03-17 19:41:03,080 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-17 19:41:03,080 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:41:03,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2025-03-17 19:41:03,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2025-03-17 19:41:03,154 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-17 19:41:03,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990202584] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:41:03,154 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:41:03,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2025-03-17 19:41:03,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141546335] [2025-03-17 19:41:03,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:41:03,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-17 19:41:03,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:41:03,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-17 19:41:03,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=567, Unknown=0, NotChecked=0, Total=650 [2025-03-17 19:41:03,324 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 86 [2025-03-17 19:41:03,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 200 transitions, 1829 flow. Second operand has 26 states, 26 states have (on average 40.88461538461539) internal successors, (1063), 26 states have internal predecessors, (1063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:41:03,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:41:03,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 86 [2025-03-17 19:41:03,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:41:05,163 INFO L124 PetriNetUnfolderBase]: 7337/16327 cut-off events. [2025-03-17 19:41:05,163 INFO L125 PetriNetUnfolderBase]: For 48411/49498 co-relation queries the response was YES. [2025-03-17 19:41:05,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56593 conditions, 16327 events. 7337/16327 cut-off events. For 48411/49498 co-relation queries the response was YES. Maximal size of possible extension queue 734. Compared 159658 event pairs, 1791 based on Foata normal form. 659/16902 useless extension candidates. Maximal degree in co-relation 56537. Up to 2839 conditions per place. [2025-03-17 19:41:05,304 INFO L140 encePairwiseOnDemand]: 70/86 looper letters, 387 selfloop transitions, 52 changer transitions 2/484 dead transitions. [2025-03-17 19:41:05,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 484 transitions, 4651 flow [2025-03-17 19:41:05,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 19:41:05,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-17 19:41:05,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 827 transitions. [2025-03-17 19:41:05,305 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6010174418604651 [2025-03-17 19:41:05,305 INFO L175 Difference]: Start difference. First operand has 215 places, 200 transitions, 1829 flow. Second operand 16 states and 827 transitions. [2025-03-17 19:41:05,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 484 transitions, 4651 flow [2025-03-17 19:41:05,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 484 transitions, 4638 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 19:41:05,524 INFO L231 Difference]: Finished difference. Result has 230 places, 208 transitions, 2025 flow [2025-03-17 19:41:05,524 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=1820, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2025, PETRI_PLACES=230, PETRI_TRANSITIONS=208} [2025-03-17 19:41:05,524 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 151 predicate places. [2025-03-17 19:41:05,525 INFO L471 AbstractCegarLoop]: Abstraction has has 230 places, 208 transitions, 2025 flow [2025-03-17 19:41:05,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 40.88461538461539) internal successors, (1063), 26 states have internal predecessors, (1063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:41:05,525 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:41:05,525 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:41:05,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-03-17 19:41:05,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2025-03-17 19:41:05,726 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-17 19:41:05,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:41:05,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1172075258, now seen corresponding path program 1 times [2025-03-17 19:41:05,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:41:05,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214013934] [2025-03-17 19:41:05,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:41:05,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:41:05,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 19:41:05,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 19:41:05,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:41:05,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:41:05,968 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:41:05,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:41:05,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214013934] [2025-03-17 19:41:05,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214013934] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:41:05,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088884836] [2025-03-17 19:41:05,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:41:05,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:41:05,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:41:05,971 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:41:05,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-17 19:41:06,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 19:41:06,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 19:41:06,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:41:06,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:41:06,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-17 19:41:06,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:41:06,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-17 19:41:06,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-03-17 19:41:06,161 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-17 19:41:06,161 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:41:06,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2025-03-17 19:41:06,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-03-17 19:41:06,245 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-17 19:41:06,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1088884836] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:41:06,245 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:41:06,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2025-03-17 19:41:06,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145653931] [2025-03-17 19:41:06,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:41:06,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-17 19:41:06,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:41:06,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-17 19:41:06,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=566, Unknown=0, NotChecked=0, Total=650 [2025-03-17 19:41:06,421 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 86 [2025-03-17 19:41:06,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 208 transitions, 2025 flow. Second operand has 26 states, 26 states have (on average 38.96153846153846) internal successors, (1013), 26 states have internal predecessors, (1013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:41:06,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:41:06,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 86 [2025-03-17 19:41:06,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:41:08,423 INFO L124 PetriNetUnfolderBase]: 8038/17208 cut-off events. [2025-03-17 19:41:08,423 INFO L125 PetriNetUnfolderBase]: For 60339/61458 co-relation queries the response was YES. [2025-03-17 19:41:08,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62181 conditions, 17208 events. 8038/17208 cut-off events. For 60339/61458 co-relation queries the response was YES. Maximal size of possible extension queue 764. Compared 164929 event pairs, 2374 based on Foata normal form. 687/17817 useless extension candidates. Maximal degree in co-relation 62121. Up to 3520 conditions per place. [2025-03-17 19:41:08,564 INFO L140 encePairwiseOnDemand]: 71/86 looper letters, 359 selfloop transitions, 48 changer transitions 1/449 dead transitions. [2025-03-17 19:41:08,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 449 transitions, 4474 flow [2025-03-17 19:41:08,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 19:41:08,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-17 19:41:08,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 739 transitions. [2025-03-17 19:41:08,566 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5728682170542636 [2025-03-17 19:41:08,566 INFO L175 Difference]: Start difference. First operand has 230 places, 208 transitions, 2025 flow. Second operand 15 states and 739 transitions. [2025-03-17 19:41:08,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 449 transitions, 4474 flow [2025-03-17 19:41:08,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 449 transitions, 4425 flow, removed 1 selfloop flow, removed 9 redundant places. [2025-03-17 19:41:08,816 INFO L231 Difference]: Finished difference. Result has 236 places, 208 transitions, 2085 flow [2025-03-17 19:41:08,817 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=1968, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2085, PETRI_PLACES=236, PETRI_TRANSITIONS=208} [2025-03-17 19:41:08,817 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 157 predicate places. [2025-03-17 19:41:08,817 INFO L471 AbstractCegarLoop]: Abstraction has has 236 places, 208 transitions, 2085 flow [2025-03-17 19:41:08,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 38.96153846153846) internal successors, (1013), 26 states have internal predecessors, (1013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:41:08,817 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:41:08,818 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:41:08,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-03-17 19:41:09,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2025-03-17 19:41:09,018 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-17 19:41:09,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:41:09,019 INFO L85 PathProgramCache]: Analyzing trace with hash -412371171, now seen corresponding path program 1 times [2025-03-17 19:41:09,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:41:09,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239626672] [2025-03-17 19:41:09,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:41:09,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:41:09,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 19:41:09,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 19:41:09,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:41:09,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:41:09,418 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 19:41:09,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:41:09,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239626672] [2025-03-17 19:41:09,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239626672] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:41:09,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505520184] [2025-03-17 19:41:09,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:41:09,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:41:09,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:41:09,420 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:41:09,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-17 19:41:09,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 19:41:09,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 19:41:09,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:41:09,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:41:09,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-17 19:41:09,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:41:09,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 19:41:09,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-17 19:41:09,557 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 19:41:09,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 19:41:09,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-17 19:41:09,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-17 19:41:09,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-03-17 19:41:09,678 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 19:41:09,678 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:41:09,834 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:41:09,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2025-03-17 19:41:09,839 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:41:09,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 31 [2025-03-17 19:41:09,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 19:41:09,943 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 19:41:09,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [505520184] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:41:09,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:41:09,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 31 [2025-03-17 19:41:09,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549901198] [2025-03-17 19:41:09,944 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:41:09,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-17 19:41:09,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:41:09,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-17 19:41:09,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=962, Unknown=6, NotChecked=0, Total=1056 [2025-03-17 19:41:10,582 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 86 [2025-03-17 19:41:10,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 208 transitions, 2085 flow. Second operand has 33 states, 33 states have (on average 24.484848484848484) internal successors, (808), 33 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:41:10,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:41:10,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 86 [2025-03-17 19:41:10,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:41:17,479 INFO L124 PetriNetUnfolderBase]: 25546/44568 cut-off events. [2025-03-17 19:41:17,479 INFO L125 PetriNetUnfolderBase]: For 176063/180033 co-relation queries the response was YES. [2025-03-17 19:41:17,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167464 conditions, 44568 events. 25546/44568 cut-off events. For 176063/180033 co-relation queries the response was YES. Maximal size of possible extension queue 1451. Compared 393467 event pairs, 4782 based on Foata normal form. 2488/46404 useless extension candidates. Maximal degree in co-relation 167403. Up to 6901 conditions per place. [2025-03-17 19:41:18,062 INFO L140 encePairwiseOnDemand]: 70/86 looper letters, 867 selfloop transitions, 103 changer transitions 89/1087 dead transitions. [2025-03-17 19:41:18,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 1087 transitions, 11712 flow [2025-03-17 19:41:18,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-17 19:41:18,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2025-03-17 19:41:18,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 1564 transitions. [2025-03-17 19:41:18,064 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37887596899224807 [2025-03-17 19:41:18,064 INFO L175 Difference]: Start difference. First operand has 236 places, 208 transitions, 2085 flow. Second operand 48 states and 1564 transitions. [2025-03-17 19:41:18,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 1087 transitions, 11712 flow [2025-03-17 19:41:19,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 1087 transitions, 11284 flow, removed 1 selfloop flow, removed 11 redundant places. [2025-03-17 19:41:19,350 INFO L231 Difference]: Finished difference. Result has 280 places, 264 transitions, 3031 flow [2025-03-17 19:41:19,350 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=1992, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=48, PETRI_FLOW=3031, PETRI_PLACES=280, PETRI_TRANSITIONS=264} [2025-03-17 19:41:19,351 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 201 predicate places. [2025-03-17 19:41:19,351 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 264 transitions, 3031 flow [2025-03-17 19:41:19,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 24.484848484848484) internal successors, (808), 33 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:41:19,351 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:41:19,351 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:41:19,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-03-17 19:41:19,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:41:19,552 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-17 19:41:19,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:41:19,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1974594990, now seen corresponding path program 1 times [2025-03-17 19:41:19,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:41:19,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408484343] [2025-03-17 19:41:19,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:41:19,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:41:19,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 19:41:19,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 19:41:19,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:41:19,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:41:19,865 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 19:41:19,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:41:19,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408484343] [2025-03-17 19:41:19,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408484343] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:41:19,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172779616] [2025-03-17 19:41:19,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:41:19,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:41:19,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:41:19,867 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:41:19,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-17 19:41:19,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 19:41:19,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 19:41:19,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:41:19,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:41:19,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-17 19:41:19,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:41:19,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 19:41:19,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-17 19:41:20,003 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 19:41:20,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 19:41:20,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-17 19:41:20,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-17 19:41:20,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-03-17 19:41:20,152 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 19:41:20,153 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:41:20,231 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_525 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_525) c_~a1~0.base) (+ c_~a1~0.offset 4))))) is different from false [2025-03-17 19:41:20,242 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_525 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_144| Int)) (or (< 0 (+ 2147483649 (select (select (store |c_#memory_int#1| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_144| v_ArrVal_525) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_144|) 0)))) is different from false [2025-03-17 19:41:20,256 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:41:20,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2025-03-17 19:41:20,261 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:41:20,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 37 [2025-03-17 19:41:20,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-17 19:41:20,362 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 8 not checked. [2025-03-17 19:41:20,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1172779616] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:41:20,362 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:41:20,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 31 [2025-03-17 19:41:20,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999918169] [2025-03-17 19:41:20,362 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:41:20,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-17 19:41:20,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:41:20,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-17 19:41:20,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=856, Unknown=2, NotChecked=118, Total=1056 [2025-03-17 19:41:20,384 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 86 [2025-03-17 19:41:20,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 264 transitions, 3031 flow. Second operand has 33 states, 33 states have (on average 29.21212121212121) internal successors, (964), 33 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:41:20,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:41:20,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 86 [2025-03-17 19:41:20,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:41:27,097 INFO L124 PetriNetUnfolderBase]: 24337/44235 cut-off events. [2025-03-17 19:41:27,098 INFO L125 PetriNetUnfolderBase]: For 195052/199075 co-relation queries the response was YES. [2025-03-17 19:41:27,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171885 conditions, 44235 events. 24337/44235 cut-off events. For 195052/199075 co-relation queries the response was YES. Maximal size of possible extension queue 1573. Compared 418718 event pairs, 6128 based on Foata normal form. 2156/46204 useless extension candidates. Maximal degree in co-relation 171817. Up to 9301 conditions per place. [2025-03-17 19:41:27,747 INFO L140 encePairwiseOnDemand]: 68/86 looper letters, 857 selfloop transitions, 74 changer transitions 2/962 dead transitions. [2025-03-17 19:41:27,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 962 transitions, 11530 flow [2025-03-17 19:41:27,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-17 19:41:27,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-17 19:41:27,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 1116 transitions. [2025-03-17 19:41:27,748 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4325581395348837 [2025-03-17 19:41:27,749 INFO L175 Difference]: Start difference. First operand has 280 places, 264 transitions, 3031 flow. Second operand 30 states and 1116 transitions. [2025-03-17 19:41:27,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 962 transitions, 11530 flow [2025-03-17 19:41:28,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 962 transitions, 11198 flow, removed 49 selfloop flow, removed 18 redundant places. [2025-03-17 19:41:28,860 INFO L231 Difference]: Finished difference. Result has 295 places, 270 transitions, 3078 flow [2025-03-17 19:41:28,860 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=2843, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=3078, PETRI_PLACES=295, PETRI_TRANSITIONS=270} [2025-03-17 19:41:28,861 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 216 predicate places. [2025-03-17 19:41:28,861 INFO L471 AbstractCegarLoop]: Abstraction has has 295 places, 270 transitions, 3078 flow [2025-03-17 19:41:28,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 29.21212121212121) internal successors, (964), 33 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:41:28,861 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:41:28,861 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:41:28,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2025-03-17 19:41:29,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:41:29,062 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-17 19:41:29,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:41:29,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1082901911, now seen corresponding path program 1 times [2025-03-17 19:41:29,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:41:29,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816749331] [2025-03-17 19:41:29,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:41:29,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:41:29,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 19:41:29,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 19:41:29,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:41:29,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:41:29,305 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 19:41:29,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:41:29,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816749331] [2025-03-17 19:41:29,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816749331] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:41:29,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335344160] [2025-03-17 19:41:29,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:41:29,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:41:29,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:41:29,307 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:41:29,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-17 19:41:29,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 19:41:29,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 19:41:29,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:41:29,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:41:29,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-17 19:41:29,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:41:29,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 19:41:29,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-17 19:41:29,433 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 19:41:29,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 19:41:29,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-17 19:41:29,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-17 19:41:29,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-03-17 19:41:29,556 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 19:41:29,556 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:41:29,703 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:41:29,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2025-03-17 19:41:29,709 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:41:29,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 31 [2025-03-17 19:41:29,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 19:41:29,800 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 19:41:29,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1335344160] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:41:29,800 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:41:29,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 31 [2025-03-17 19:41:29,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769638686] [2025-03-17 19:41:29,800 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:41:29,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-17 19:41:29,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:41:29,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-17 19:41:29,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=943, Unknown=10, NotChecked=0, Total=1056 [2025-03-17 19:41:30,249 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 86 [2025-03-17 19:41:30,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 270 transitions, 3078 flow. Second operand has 33 states, 33 states have (on average 29.363636363636363) internal successors, (969), 33 states have internal predecessors, (969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:41:30,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:41:30,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 86 [2025-03-17 19:41:30,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:41:36,799 INFO L124 PetriNetUnfolderBase]: 25685/42961 cut-off events. [2025-03-17 19:41:36,799 INFO L125 PetriNetUnfolderBase]: For 212683/218366 co-relation queries the response was YES. [2025-03-17 19:41:37,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 176542 conditions, 42961 events. 25685/42961 cut-off events. For 212683/218366 co-relation queries the response was YES. Maximal size of possible extension queue 1491. Compared 373568 event pairs, 5777 based on Foata normal form. 2870/45701 useless extension candidates. Maximal degree in co-relation 176469. Up to 11106 conditions per place. [2025-03-17 19:41:37,405 INFO L140 encePairwiseOnDemand]: 67/86 looper letters, 705 selfloop transitions, 70 changer transitions 208/1014 dead transitions. [2025-03-17 19:41:37,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 1014 transitions, 12017 flow [2025-03-17 19:41:37,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-17 19:41:37,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-03-17 19:41:37,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1018 transitions. [2025-03-17 19:41:37,408 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4552772808586762 [2025-03-17 19:41:37,408 INFO L175 Difference]: Start difference. First operand has 295 places, 270 transitions, 3078 flow. Second operand 26 states and 1018 transitions. [2025-03-17 19:41:37,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 1014 transitions, 12017 flow [2025-03-17 19:41:38,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 1014 transitions, 11901 flow, removed 7 selfloop flow, removed 21 redundant places. [2025-03-17 19:41:38,288 INFO L231 Difference]: Finished difference. Result has 303 places, 274 transitions, 3164 flow [2025-03-17 19:41:38,288 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=2964, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=3164, PETRI_PLACES=303, PETRI_TRANSITIONS=274} [2025-03-17 19:41:38,288 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 224 predicate places. [2025-03-17 19:41:38,288 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 274 transitions, 3164 flow [2025-03-17 19:41:38,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 29.363636363636363) internal successors, (969), 33 states have internal predecessors, (969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:41:38,289 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:41:38,289 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:41:38,296 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-03-17 19:41:38,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-03-17 19:41:38,489 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-17 19:41:38,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:41:38,490 INFO L85 PathProgramCache]: Analyzing trace with hash 101365497, now seen corresponding path program 1 times [2025-03-17 19:41:38,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:41:38,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404799699] [2025-03-17 19:41:38,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:41:38,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:41:38,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 19:41:38,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 19:41:38,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:41:38,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:41:38,863 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 19:41:38,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:41:38,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404799699] [2025-03-17 19:41:38,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404799699] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:41:38,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681125002] [2025-03-17 19:41:38,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:41:38,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:41:38,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:41:38,865 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:41:38,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-03-17 19:41:38,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 19:41:38,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 19:41:38,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:41:38,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:41:38,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-17 19:41:38,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:41:38,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 19:41:38,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-17 19:41:39,008 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 19:41:39,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 19:41:39,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-17 19:41:39,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-17 19:41:39,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-03-17 19:41:39,140 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 19:41:39,140 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:41:39,221 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_582 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_582) c_~a1~0.base) (+ c_~a1~0.offset 4)) 4294967296))) is different from false [2025-03-17 19:41:39,276 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:41:39,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2025-03-17 19:41:39,282 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:41:39,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 37 [2025-03-17 19:41:39,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-17 19:41:39,378 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2025-03-17 19:41:39,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1681125002] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:41:39,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:41:39,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 31 [2025-03-17 19:41:39,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629036658] [2025-03-17 19:41:39,378 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:41:39,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-17 19:41:39,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:41:39,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-17 19:41:39,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=902, Unknown=1, NotChecked=60, Total=1056 [2025-03-17 19:41:39,401 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 86 [2025-03-17 19:41:39,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 274 transitions, 3164 flow. Second operand has 33 states, 33 states have (on average 24.575757575757574) internal successors, (811), 33 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:41:39,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:41:39,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 86 [2025-03-17 19:41:39,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand