./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/popl20-more-sum-array-hom.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-more-sum-array-hom.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 37731ec014f4053387ac8b56c0764486866d63670c206743514c9636df9b594a --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:29:44,176 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:29:44,227 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:29:44,232 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:29:44,232 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:29:44,250 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:29:44,252 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:29:44,252 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:29:44,253 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:29:44,253 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:29:44,253 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:29:44,254 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:29:44,254 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:29:44,254 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:29:44,254 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:29:44,255 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:29:44,255 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:29:44,255 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:29:44,255 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:29:44,255 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:29:44,255 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:29:44,255 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:29:44,255 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:29:44,255 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:29:44,255 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:29:44,255 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:29:44,255 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:29:44,256 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:29:44,256 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:29:44,256 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:29:44,256 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:29:44,256 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:29:44,256 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:29:44,256 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:29:44,256 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:29:44,256 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:29:44,257 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:29:44,257 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:29:44,257 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:29:44,257 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:29:44,257 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:29:44,257 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:29:44,257 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:29:44,257 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:29:44,257 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:29:44,257 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 -> 37731ec014f4053387ac8b56c0764486866d63670c206743514c9636df9b594a [2025-03-04 15:29:44,471 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:29:44,480 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:29:44,482 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:29:44,483 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:29:44,484 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:29:44,485 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-sum-array-hom.wvr.c [2025-03-04 15:29:45,664 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ec078c3a/f2aba25040ff49dc8c01e3c1f2b8aff8/FLAGfc7b2c77f [2025-03-04 15:29:45,892 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:29:45,892 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-sum-array-hom.wvr.c [2025-03-04 15:29:45,901 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ec078c3a/f2aba25040ff49dc8c01e3c1f2b8aff8/FLAGfc7b2c77f [2025-03-04 15:29:46,231 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ec078c3a/f2aba25040ff49dc8c01e3c1f2b8aff8 [2025-03-04 15:29:46,233 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:29:46,234 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:29:46,235 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:29:46,235 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:29:46,238 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:29:46,238 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:29:46" (1/1) ... [2025-03-04 15:29:46,239 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c39ebe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:46, skipping insertion in model container [2025-03-04 15:29:46,239 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:29:46" (1/1) ... [2025-03-04 15:29:46,251 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:29:46,379 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:29:46,388 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:29:46,408 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:29:46,422 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:29:46,422 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:46 WrapperNode [2025-03-04 15:29:46,423 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:29:46,423 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:29:46,423 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:29:46,424 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:29:46,428 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:46" (1/1) ... [2025-03-04 15:29:46,438 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:46" (1/1) ... [2025-03-04 15:29:46,453 INFO L138 Inliner]: procedures = 24, calls = 20, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 88 [2025-03-04 15:29:46,455 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:29:46,456 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:29:46,456 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:29:46,456 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:29:46,462 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:46" (1/1) ... [2025-03-04 15:29:46,462 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:46" (1/1) ... [2025-03-04 15:29:46,464 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:46" (1/1) ... [2025-03-04 15:29:46,482 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-03-04 15:29:46,483 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:46" (1/1) ... [2025-03-04 15:29:46,483 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:46" (1/1) ... [2025-03-04 15:29:46,489 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:46" (1/1) ... [2025-03-04 15:29:46,493 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:46" (1/1) ... [2025-03-04 15:29:46,494 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:46" (1/1) ... [2025-03-04 15:29:46,495 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:46" (1/1) ... [2025-03-04 15:29:46,496 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:29:46,498 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:29:46,498 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:29:46,498 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:29:46,499 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:46" (1/1) ... [2025-03-04 15:29:46,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:29:46,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:46,523 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 15:29:46,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 15:29:46,541 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:29:46,541 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 15:29:46,541 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 15:29:46,541 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 15:29:46,541 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 15:29:46,541 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 15:29:46,541 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 15:29:46,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:29:46,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 15:29:46,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:29:46,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:29:46,541 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 15:29:46,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:29:46,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:29:46,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:29:46,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:29:46,542 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 15:29:46,611 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:29:46,612 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:29:46,793 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:29:46,794 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:29:46,930 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:29:46,930 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:29:46,930 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:29:46 BoogieIcfgContainer [2025-03-04 15:29:46,930 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:29:46,934 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:29:46,934 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:29:46,936 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:29:46,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:29:46" (1/3) ... [2025-03-04 15:29:46,937 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1692270f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:29:46, skipping insertion in model container [2025-03-04 15:29:46,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:46" (2/3) ... [2025-03-04 15:29:46,938 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1692270f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:29:46, skipping insertion in model container [2025-03-04 15:29:46,938 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:29:46" (3/3) ... [2025-03-04 15:29:46,938 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-sum-array-hom.wvr.c [2025-03-04 15:29:46,948 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:29:46,949 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-sum-array-hom.wvr.c that has 4 procedures, 38 locations, 1 initial locations, 4 loop locations, and 8 error locations. [2025-03-04 15:29:46,949 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:29:46,990 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 15:29:47,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 41 transitions, 103 flow [2025-03-04 15:29:47,036 INFO L124 PetriNetUnfolderBase]: 4/38 cut-off events. [2025-03-04 15:29:47,038 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 15:29:47,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 38 events. 4/38 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 77 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 30. Up to 2 conditions per place. [2025-03-04 15:29:47,042 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 41 transitions, 103 flow [2025-03-04 15:29:47,045 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 36 transitions, 87 flow [2025-03-04 15:29:47,054 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:29:47,062 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;@6d186a0d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:29:47,062 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-03-04 15:29:47,066 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:29:47,067 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-03-04 15:29:47,067 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:29:47,067 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:47,067 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 15:29:47,068 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-04 15:29:47,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:47,072 INFO L85 PathProgramCache]: Analyzing trace with hash 342695, now seen corresponding path program 1 times [2025-03-04 15:29:47,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:47,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003637657] [2025-03-04 15:29:47,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:47,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:47,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:29:47,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:29:47,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:47,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:47,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:47,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:47,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003637657] [2025-03-04 15:29:47,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003637657] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:29:47,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:29:47,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:29:47,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916707018] [2025-03-04 15:29:47,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:29:47,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:29:47,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:47,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:29:47,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:29:47,285 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 41 [2025-03-04 15:29:47,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 36 transitions, 87 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:47,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:47,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 41 [2025-03-04 15:29:47,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:47,487 INFO L124 PetriNetUnfolderBase]: 431/769 cut-off events. [2025-03-04 15:29:47,487 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2025-03-04 15:29:47,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1462 conditions, 769 events. 431/769 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3508 event pairs, 306 based on Foata normal form. 1/587 useless extension candidates. Maximal degree in co-relation 1301. Up to 625 conditions per place. [2025-03-04 15:29:47,497 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 25 selfloop transitions, 4 changer transitions 0/39 dead transitions. [2025-03-04 15:29:47,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 39 transitions, 151 flow [2025-03-04 15:29:47,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:29:47,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:29:47,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2025-03-04 15:29:47,509 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5060975609756098 [2025-03-04 15:29:47,510 INFO L175 Difference]: Start difference. First operand has 42 places, 36 transitions, 87 flow. Second operand 4 states and 83 transitions. [2025-03-04 15:29:47,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 39 transitions, 151 flow [2025-03-04 15:29:47,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 39 transitions, 142 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 15:29:47,517 INFO L231 Difference]: Finished difference. Result has 42 places, 39 transitions, 107 flow [2025-03-04 15:29:47,518 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=107, PETRI_PLACES=42, PETRI_TRANSITIONS=39} [2025-03-04 15:29:47,521 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2025-03-04 15:29:47,521 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 39 transitions, 107 flow [2025-03-04 15:29:47,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:47,521 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:47,521 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-04 15:29:47,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:29:47,522 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-04 15:29:47,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:47,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1619589681, now seen corresponding path program 1 times [2025-03-04 15:29:47,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:47,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434890393] [2025-03-04 15:29:47,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:47,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:47,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:29:47,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:29:47,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:47,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:47,645 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:47,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:47,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434890393] [2025-03-04 15:29:47,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434890393] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:29:47,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197427980] [2025-03-04 15:29:47,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:47,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:47,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:47,648 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:29:47,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 15:29:47,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:29:47,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:29:47,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:47,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:47,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:29:47,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:29:47,744 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-04 15:29:47,744 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:29:47,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [197427980] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:29:47,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:29:47,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-04 15:29:47,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199448806] [2025-03-04 15:29:47,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:29:47,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:29:47,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:47,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:29:47,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:29:47,754 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 41 [2025-03-04 15:29:47,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 39 transitions, 107 flow. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:47,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:47,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 41 [2025-03-04 15:29:47,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:47,898 INFO L124 PetriNetUnfolderBase]: 431/768 cut-off events. [2025-03-04 15:29:47,899 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-04 15:29:47,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1446 conditions, 768 events. 431/768 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3513 event pairs, 306 based on Foata normal form. 1/587 useless extension candidates. Maximal degree in co-relation 1419. Up to 620 conditions per place. [2025-03-04 15:29:47,903 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 21 selfloop transitions, 7 changer transitions 0/38 dead transitions. [2025-03-04 15:29:47,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 38 transitions, 159 flow [2025-03-04 15:29:47,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:29:47,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:29:47,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions. [2025-03-04 15:29:47,905 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4349593495934959 [2025-03-04 15:29:47,905 INFO L175 Difference]: Start difference. First operand has 42 places, 39 transitions, 107 flow. Second operand 6 states and 107 transitions. [2025-03-04 15:29:47,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 38 transitions, 159 flow [2025-03-04 15:29:47,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 38 transitions, 156 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:29:47,906 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 114 flow [2025-03-04 15:29:47,906 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=114, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2025-03-04 15:29:47,907 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 3 predicate places. [2025-03-04 15:29:47,907 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 114 flow [2025-03-04 15:29:47,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:47,907 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:47,907 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 15:29:47,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 15:29:48,107 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-04 15:29:48,108 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-04 15:29:48,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:48,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1622154099, now seen corresponding path program 1 times [2025-03-04 15:29:48,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:48,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362933389] [2025-03-04 15:29:48,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:48,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:48,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:29:48,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:29:48,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:48,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:48,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:48,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:48,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362933389] [2025-03-04 15:29:48,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362933389] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:29:48,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:29:48,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:29:48,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414100193] [2025-03-04 15:29:48,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:29:48,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:29:48,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:48,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:29:48,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:29:48,171 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 41 [2025-03-04 15:29:48,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 114 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:48,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:48,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 41 [2025-03-04 15:29:48,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:48,345 INFO L124 PetriNetUnfolderBase]: 865/1444 cut-off events. [2025-03-04 15:29:48,345 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-03-04 15:29:48,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2764 conditions, 1444 events. 865/1444 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 7005 event pairs, 466 based on Foata normal form. 42/1143 useless extension candidates. Maximal degree in co-relation 2734. Up to 947 conditions per place. [2025-03-04 15:29:48,353 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 54 selfloop transitions, 4 changer transitions 0/67 dead transitions. [2025-03-04 15:29:48,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 67 transitions, 294 flow [2025-03-04 15:29:48,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:29:48,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:29:48,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2025-03-04 15:29:48,354 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6646341463414634 [2025-03-04 15:29:48,354 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 114 flow. Second operand 4 states and 109 transitions. [2025-03-04 15:29:48,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 67 transitions, 294 flow [2025-03-04 15:29:48,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 67 transitions, 272 flow, removed 2 selfloop flow, removed 5 redundant places. [2025-03-04 15:29:48,356 INFO L231 Difference]: Finished difference. Result has 45 places, 41 transitions, 121 flow [2025-03-04 15:29:48,356 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=121, PETRI_PLACES=45, PETRI_TRANSITIONS=41} [2025-03-04 15:29:48,357 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 3 predicate places. [2025-03-04 15:29:48,357 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 41 transitions, 121 flow [2025-03-04 15:29:48,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:48,357 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:48,357 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-03-04 15:29:48,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 15:29:48,357 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-04 15:29:48,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:48,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1332327143, now seen corresponding path program 1 times [2025-03-04 15:29:48,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:48,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899560899] [2025-03-04 15:29:48,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:48,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:48,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:29:48,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:29:48,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:48,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:48,435 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-04 15:29:48,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:48,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899560899] [2025-03-04 15:29:48,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899560899] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:29:48,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215127322] [2025-03-04 15:29:48,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:48,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:48,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:48,438 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:29:48,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 15:29:48,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:29:48,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:29:48,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:48,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:48,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:29:48,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:29:48,505 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-04 15:29:48,505 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:29:48,537 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-04 15:29:48,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215127322] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:29:48,537 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:29:48,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-03-04 15:29:48,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768088833] [2025-03-04 15:29:48,538 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:29:48,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 15:29:48,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:48,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 15:29:48,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 15:29:48,549 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 41 [2025-03-04 15:29:48,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 41 transitions, 121 flow. Second operand has 12 states, 12 states have (on average 14.083333333333334) internal successors, (169), 12 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:48,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:48,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 41 [2025-03-04 15:29:48,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:48,716 INFO L124 PetriNetUnfolderBase]: 672/1231 cut-off events. [2025-03-04 15:29:48,717 INFO L125 PetriNetUnfolderBase]: For 436/436 co-relation queries the response was YES. [2025-03-04 15:29:48,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2731 conditions, 1231 events. 672/1231 cut-off events. For 436/436 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 6649 event pairs, 466 based on Foata normal form. 3/996 useless extension candidates. Maximal degree in co-relation 2679. Up to 949 conditions per place. [2025-03-04 15:29:48,723 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 27 selfloop transitions, 13 changer transitions 0/50 dead transitions. [2025-03-04 15:29:48,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 50 transitions, 231 flow [2025-03-04 15:29:48,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:29:48,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 15:29:48,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 170 transitions. [2025-03-04 15:29:48,726 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4146341463414634 [2025-03-04 15:29:48,726 INFO L175 Difference]: Start difference. First operand has 45 places, 41 transitions, 121 flow. Second operand 10 states and 170 transitions. [2025-03-04 15:29:48,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 50 transitions, 231 flow [2025-03-04 15:29:48,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 50 transitions, 228 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:29:48,731 INFO L231 Difference]: Finished difference. Result has 56 places, 50 transitions, 192 flow [2025-03-04 15:29:48,731 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=192, PETRI_PLACES=56, PETRI_TRANSITIONS=50} [2025-03-04 15:29:48,733 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 14 predicate places. [2025-03-04 15:29:48,733 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 50 transitions, 192 flow [2025-03-04 15:29:48,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 14.083333333333334) internal successors, (169), 12 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:48,733 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:48,734 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:48,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 15:29:48,938 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-04 15:29:48,938 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-04 15:29:48,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:48,938 INFO L85 PathProgramCache]: Analyzing trace with hash -209062877, now seen corresponding path program 1 times [2025-03-04 15:29:48,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:48,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694525080] [2025-03-04 15:29:48,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:48,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:48,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:29:48,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:29:48,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:48,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:48,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:48,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:48,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694525080] [2025-03-04 15:29:48,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694525080] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:29:48,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:29:48,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:29:48,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322302775] [2025-03-04 15:29:48,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:29:48,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:29:48,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:48,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:29:48,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:29:48,985 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 41 [2025-03-04 15:29:48,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 50 transitions, 192 flow. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:48,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:48,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 41 [2025-03-04 15:29:48,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:49,179 INFO L124 PetriNetUnfolderBase]: 1384/2196 cut-off events. [2025-03-04 15:29:49,180 INFO L125 PetriNetUnfolderBase]: For 711/832 co-relation queries the response was YES. [2025-03-04 15:29:49,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4942 conditions, 2196 events. 1384/2196 cut-off events. For 711/832 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 10996 event pairs, 724 based on Foata normal form. 64/1843 useless extension candidates. Maximal degree in co-relation 4906. Up to 1472 conditions per place. [2025-03-04 15:29:49,191 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 70 selfloop transitions, 4 changer transitions 0/83 dead transitions. [2025-03-04 15:29:49,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 83 transitions, 444 flow [2025-03-04 15:29:49,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:29:49,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:29:49,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2025-03-04 15:29:49,192 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6524390243902439 [2025-03-04 15:29:49,193 INFO L175 Difference]: Start difference. First operand has 56 places, 50 transitions, 192 flow. Second operand 4 states and 107 transitions. [2025-03-04 15:29:49,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 83 transitions, 444 flow [2025-03-04 15:29:49,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 83 transitions, 433 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-04 15:29:49,196 INFO L231 Difference]: Finished difference. Result has 59 places, 53 transitions, 210 flow [2025-03-04 15:29:49,196 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=210, PETRI_PLACES=59, PETRI_TRANSITIONS=53} [2025-03-04 15:29:49,196 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 17 predicate places. [2025-03-04 15:29:49,198 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 53 transitions, 210 flow [2025-03-04 15:29:49,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:49,198 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:49,198 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:49,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:29:49,198 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-04 15:29:49,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:49,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1378945597, now seen corresponding path program 1 times [2025-03-04 15:29:49,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:49,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50982224] [2025-03-04 15:29:49,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:49,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:49,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:29:49,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:29:49,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:49,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:49,287 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:29:49,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:49,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50982224] [2025-03-04 15:29:49,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50982224] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:29:49,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:29:49,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:29:49,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844651424] [2025-03-04 15:29:49,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:29:49,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:29:49,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:49,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:29:49,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:29:49,290 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2025-03-04 15:29:49,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 53 transitions, 210 flow. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:49,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:49,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2025-03-04 15:29:49,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:49,519 INFO L124 PetriNetUnfolderBase]: 1522/2738 cut-off events. [2025-03-04 15:29:49,519 INFO L125 PetriNetUnfolderBase]: For 1572/1643 co-relation queries the response was YES. [2025-03-04 15:29:49,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6859 conditions, 2738 events. 1522/2738 cut-off events. For 1572/1643 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 16567 event pairs, 928 based on Foata normal form. 62/2432 useless extension candidates. Maximal degree in co-relation 6821. Up to 1469 conditions per place. [2025-03-04 15:29:49,535 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 74 selfloop transitions, 5 changer transitions 0/90 dead transitions. [2025-03-04 15:29:49,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 90 transitions, 493 flow [2025-03-04 15:29:49,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:29:49,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:29:49,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 134 transitions. [2025-03-04 15:29:49,537 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6536585365853659 [2025-03-04 15:29:49,537 INFO L175 Difference]: Start difference. First operand has 59 places, 53 transitions, 210 flow. Second operand 5 states and 134 transitions. [2025-03-04 15:29:49,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 90 transitions, 493 flow [2025-03-04 15:29:49,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 90 transitions, 484 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:29:49,548 INFO L231 Difference]: Finished difference. Result has 64 places, 55 transitions, 236 flow [2025-03-04 15:29:49,549 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=236, PETRI_PLACES=64, PETRI_TRANSITIONS=55} [2025-03-04 15:29:49,549 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 22 predicate places. [2025-03-04 15:29:49,549 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 55 transitions, 236 flow [2025-03-04 15:29:49,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:49,549 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:49,549 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:49,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 15:29:49,550 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-04 15:29:49,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:49,550 INFO L85 PathProgramCache]: Analyzing trace with hash 947140593, now seen corresponding path program 1 times [2025-03-04 15:29:49,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:49,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626467746] [2025-03-04 15:29:49,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:49,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:49,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:29:49,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:29:49,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:49,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:49,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:49,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:49,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626467746] [2025-03-04 15:29:49,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626467746] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:29:49,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:29:49,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:29:49,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178906263] [2025-03-04 15:29:49,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:29:49,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:29:49,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:49,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:29:49,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:29:49,608 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 41 [2025-03-04 15:29:49,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 55 transitions, 236 flow. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:49,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:49,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 41 [2025-03-04 15:29:49,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:49,883 INFO L124 PetriNetUnfolderBase]: 1838/3004 cut-off events. [2025-03-04 15:29:49,883 INFO L125 PetriNetUnfolderBase]: For 2890/2994 co-relation queries the response was YES. [2025-03-04 15:29:49,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8128 conditions, 3004 events. 1838/3004 cut-off events. For 2890/2994 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 16344 event pairs, 572 based on Foata normal form. 122/2673 useless extension candidates. Maximal degree in co-relation 8088. Up to 1139 conditions per place. [2025-03-04 15:29:49,905 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 74 selfloop transitions, 9 changer transitions 0/92 dead transitions. [2025-03-04 15:29:49,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 92 transitions, 580 flow [2025-03-04 15:29:49,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:29:49,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:29:49,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 113 transitions. [2025-03-04 15:29:49,907 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.551219512195122 [2025-03-04 15:29:49,907 INFO L175 Difference]: Start difference. First operand has 64 places, 55 transitions, 236 flow. Second operand 5 states and 113 transitions. [2025-03-04 15:29:49,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 92 transitions, 580 flow [2025-03-04 15:29:49,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 92 transitions, 575 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:29:49,913 INFO L231 Difference]: Finished difference. Result has 65 places, 54 transitions, 247 flow [2025-03-04 15:29:49,914 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=247, PETRI_PLACES=65, PETRI_TRANSITIONS=54} [2025-03-04 15:29:49,914 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 23 predicate places. [2025-03-04 15:29:49,915 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 54 transitions, 247 flow [2025-03-04 15:29:49,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:49,916 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:49,916 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:49,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 15:29:49,916 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-04 15:29:49,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:49,917 INFO L85 PathProgramCache]: Analyzing trace with hash -703412369, now seen corresponding path program 1 times [2025-03-04 15:29:49,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:49,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754241603] [2025-03-04 15:29:49,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:49,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:49,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:29:49,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:29:49,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:49,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:49,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:49,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:49,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754241603] [2025-03-04 15:29:49,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754241603] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:29:49,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:29:49,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:29:49,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579801698] [2025-03-04 15:29:49,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:29:49,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:29:49,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:49,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:29:49,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:29:49,997 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 41 [2025-03-04 15:29:49,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 54 transitions, 247 flow. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:49,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:49,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 41 [2025-03-04 15:29:49,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:50,240 INFO L124 PetriNetUnfolderBase]: 1740/2965 cut-off events. [2025-03-04 15:29:50,240 INFO L125 PetriNetUnfolderBase]: For 2982/3027 co-relation queries the response was YES. [2025-03-04 15:29:50,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8395 conditions, 2965 events. 1740/2965 cut-off events. For 2982/3027 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 16771 event pairs, 1160 based on Foata normal form. 43/2693 useless extension candidates. Maximal degree in co-relation 8354. Up to 1766 conditions per place. [2025-03-04 15:29:50,260 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 65 selfloop transitions, 5 changer transitions 6/85 dead transitions. [2025-03-04 15:29:50,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 85 transitions, 521 flow [2025-03-04 15:29:50,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:29:50,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:29:50,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 121 transitions. [2025-03-04 15:29:50,261 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5902439024390244 [2025-03-04 15:29:50,261 INFO L175 Difference]: Start difference. First operand has 65 places, 54 transitions, 247 flow. Second operand 5 states and 121 transitions. [2025-03-04 15:29:50,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 85 transitions, 521 flow [2025-03-04 15:29:50,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 85 transitions, 495 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 15:29:50,265 INFO L231 Difference]: Finished difference. Result has 67 places, 56 transitions, 254 flow [2025-03-04 15:29:50,266 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=254, PETRI_PLACES=67, PETRI_TRANSITIONS=56} [2025-03-04 15:29:50,266 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 25 predicate places. [2025-03-04 15:29:50,266 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 56 transitions, 254 flow [2025-03-04 15:29:50,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:50,266 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:50,266 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:50,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 15:29:50,267 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-04 15:29:50,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:50,267 INFO L85 PathProgramCache]: Analyzing trace with hash -489276870, now seen corresponding path program 1 times [2025-03-04 15:29:50,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:50,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446188535] [2025-03-04 15:29:50,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:50,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:50,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:29:50,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:29:50,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:50,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:50,336 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:29:50,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:50,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446188535] [2025-03-04 15:29:50,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446188535] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:29:50,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:29:50,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:29:50,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519970005] [2025-03-04 15:29:50,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:29:50,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:29:50,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:50,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:29:50,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:29:50,338 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2025-03-04 15:29:50,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 56 transitions, 254 flow. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:50,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:50,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2025-03-04 15:29:50,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:50,489 INFO L124 PetriNetUnfolderBase]: 1244/2200 cut-off events. [2025-03-04 15:29:50,490 INFO L125 PetriNetUnfolderBase]: For 2065/2081 co-relation queries the response was YES. [2025-03-04 15:29:50,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6061 conditions, 2200 events. 1244/2200 cut-off events. For 2065/2081 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 12299 event pairs, 824 based on Foata normal form. 34/2095 useless extension candidates. Maximal degree in co-relation 6019. Up to 1469 conditions per place. [2025-03-04 15:29:50,498 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 39 selfloop transitions, 2 changer transitions 27/78 dead transitions. [2025-03-04 15:29:50,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 78 transitions, 467 flow [2025-03-04 15:29:50,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:29:50,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:29:50,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2025-03-04 15:29:50,499 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6292682926829268 [2025-03-04 15:29:50,500 INFO L175 Difference]: Start difference. First operand has 67 places, 56 transitions, 254 flow. Second operand 5 states and 129 transitions. [2025-03-04 15:29:50,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 78 transitions, 467 flow [2025-03-04 15:29:50,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 78 transitions, 462 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:29:50,503 INFO L231 Difference]: Finished difference. Result has 71 places, 51 transitions, 224 flow [2025-03-04 15:29:50,503 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=224, PETRI_PLACES=71, PETRI_TRANSITIONS=51} [2025-03-04 15:29:50,505 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 29 predicate places. [2025-03-04 15:29:50,505 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 51 transitions, 224 flow [2025-03-04 15:29:50,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:50,505 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:50,505 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:50,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 15:29:50,505 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-04 15:29:50,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:50,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1436326451, now seen corresponding path program 1 times [2025-03-04 15:29:50,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:50,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644823185] [2025-03-04 15:29:50,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:50,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:50,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:29:50,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:29:50,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:50,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:50,565 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:29:50,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:50,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644823185] [2025-03-04 15:29:50,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644823185] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:29:50,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798455097] [2025-03-04 15:29:50,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:50,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:50,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:50,567 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:29:50,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 15:29:50,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:29:50,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:29:50,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:50,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:50,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:29:50,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:29:50,640 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:29:50,640 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:29:50,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1798455097] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:29:50,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:29:50,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-04 15:29:50,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808054161] [2025-03-04 15:29:50,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:29:50,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:29:50,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:50,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:29:50,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:29:50,648 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 41 [2025-03-04 15:29:50,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 51 transitions, 224 flow. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:50,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:50,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 41 [2025-03-04 15:29:50,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:50,868 INFO L124 PetriNetUnfolderBase]: 1215/1924 cut-off events. [2025-03-04 15:29:50,868 INFO L125 PetriNetUnfolderBase]: For 1648/1758 co-relation queries the response was YES. [2025-03-04 15:29:50,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5551 conditions, 1924 events. 1215/1924 cut-off events. For 1648/1758 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 9315 event pairs, 228 based on Foata normal form. 62/1783 useless extension candidates. Maximal degree in co-relation 5521. Up to 537 conditions per place. [2025-03-04 15:29:50,876 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 99 selfloop transitions, 7 changer transitions 0/114 dead transitions. [2025-03-04 15:29:50,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 114 transitions, 676 flow [2025-03-04 15:29:50,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:29:50,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:29:50,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 159 transitions. [2025-03-04 15:29:50,878 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6463414634146342 [2025-03-04 15:29:50,878 INFO L175 Difference]: Start difference. First operand has 71 places, 51 transitions, 224 flow. Second operand 6 states and 159 transitions. [2025-03-04 15:29:50,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 114 transitions, 676 flow [2025-03-04 15:29:50,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 114 transitions, 614 flow, removed 29 selfloop flow, removed 8 redundant places. [2025-03-04 15:29:50,883 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 212 flow [2025-03-04 15:29:50,883 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=212, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2025-03-04 15:29:50,884 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 19 predicate places. [2025-03-04 15:29:50,884 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 212 flow [2025-03-04 15:29:50,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:50,884 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:50,884 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:50,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 15:29:51,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:51,089 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-04 15:29:51,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:51,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1576446715, now seen corresponding path program 1 times [2025-03-04 15:29:51,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:51,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278819732] [2025-03-04 15:29:51,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:51,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:51,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:29:51,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:29:51,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:51,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:51,146 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:29:51,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:51,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278819732] [2025-03-04 15:29:51,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278819732] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:29:51,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455080057] [2025-03-04 15:29:51,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:51,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:51,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:51,148 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:29:51,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 15:29:51,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:29:51,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:29:51,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:51,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:51,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:29:51,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:29:51,223 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:29:51,223 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:29:51,257 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:29:51,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [455080057] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:29:51,257 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:29:51,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-04 15:29:51,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128599931] [2025-03-04 15:29:51,257 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:29:51,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 15:29:51,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:51,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 15:29:51,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 15:29:51,267 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 41 [2025-03-04 15:29:51,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 212 flow. Second operand has 12 states, 12 states have (on average 14.5) internal successors, (174), 12 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:51,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:51,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 41 [2025-03-04 15:29:51,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:51,643 INFO L124 PetriNetUnfolderBase]: 2337/3687 cut-off events. [2025-03-04 15:29:51,643 INFO L125 PetriNetUnfolderBase]: For 2781/2931 co-relation queries the response was YES. [2025-03-04 15:29:51,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10338 conditions, 3687 events. 2337/3687 cut-off events. For 2781/2931 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 18113 event pairs, 536 based on Foata normal form. 186/3321 useless extension candidates. Maximal degree in co-relation 10307. Up to 1439 conditions per place. [2025-03-04 15:29:51,662 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 166 selfloop transitions, 13 changer transitions 0/187 dead transitions. [2025-03-04 15:29:51,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 187 transitions, 1032 flow [2025-03-04 15:29:51,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:29:51,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 15:29:51,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 274 transitions. [2025-03-04 15:29:51,664 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6682926829268293 [2025-03-04 15:29:51,664 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 212 flow. Second operand 10 states and 274 transitions. [2025-03-04 15:29:51,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 187 transitions, 1032 flow [2025-03-04 15:29:51,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 187 transitions, 986 flow, removed 8 selfloop flow, removed 5 redundant places. [2025-03-04 15:29:51,672 INFO L231 Difference]: Finished difference. Result has 68 places, 59 transitions, 264 flow [2025-03-04 15:29:51,672 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=264, PETRI_PLACES=68, PETRI_TRANSITIONS=59} [2025-03-04 15:29:51,673 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 26 predicate places. [2025-03-04 15:29:51,673 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 59 transitions, 264 flow [2025-03-04 15:29:51,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 14.5) internal successors, (174), 12 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:51,673 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:51,673 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:51,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 15:29:51,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:51,878 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-04 15:29:51,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:51,878 INFO L85 PathProgramCache]: Analyzing trace with hash -11838215, now seen corresponding path program 1 times [2025-03-04 15:29:51,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:51,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009600887] [2025-03-04 15:29:51,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:51,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:51,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:29:51,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:29:51,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:51,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:51,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:51,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:51,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009600887] [2025-03-04 15:29:51,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009600887] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:29:51,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391337396] [2025-03-04 15:29:51,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:51,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:51,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:51,984 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:29:51,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 15:29:52,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:29:52,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:29:52,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:52,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:52,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 15:29:52,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:29:52,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:52,119 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:29:52,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:52,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391337396] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:29:52,213 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:29:52,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2025-03-04 15:29:52,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605667746] [2025-03-04 15:29:52,213 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:29:52,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 15:29:52,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:52,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 15:29:52,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2025-03-04 15:29:52,247 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2025-03-04 15:29:52,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 59 transitions, 264 flow. Second operand has 19 states, 19 states have (on average 12.894736842105264) internal successors, (245), 19 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:52,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:52,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2025-03-04 15:29:52,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:53,230 INFO L124 PetriNetUnfolderBase]: 8468/13279 cut-off events. [2025-03-04 15:29:53,231 INFO L125 PetriNetUnfolderBase]: For 14279/14758 co-relation queries the response was YES. [2025-03-04 15:29:53,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36863 conditions, 13279 events. 8468/13279 cut-off events. For 14279/14758 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 82801 event pairs, 4404 based on Foata normal form. 0/11659 useless extension candidates. Maximal degree in co-relation 36829. Up to 3698 conditions per place. [2025-03-04 15:29:53,286 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 207 selfloop transitions, 20 changer transitions 3/237 dead transitions. [2025-03-04 15:29:53,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 237 transitions, 1544 flow [2025-03-04 15:29:53,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 15:29:53,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 15:29:53,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 266 transitions. [2025-03-04 15:29:53,288 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49906191369606 [2025-03-04 15:29:53,288 INFO L175 Difference]: Start difference. First operand has 68 places, 59 transitions, 264 flow. Second operand 13 states and 266 transitions. [2025-03-04 15:29:53,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 237 transitions, 1544 flow [2025-03-04 15:29:53,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 237 transitions, 1467 flow, removed 21 selfloop flow, removed 2 redundant places. [2025-03-04 15:29:53,306 INFO L231 Difference]: Finished difference. Result has 82 places, 67 transitions, 338 flow [2025-03-04 15:29:53,306 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=338, PETRI_PLACES=82, PETRI_TRANSITIONS=67} [2025-03-04 15:29:53,306 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 40 predicate places. [2025-03-04 15:29:53,306 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 67 transitions, 338 flow [2025-03-04 15:29:53,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 12.894736842105264) internal successors, (245), 19 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:53,306 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:53,307 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:53,313 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 15:29:53,507 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,SelfDestructingSolverStorable11 [2025-03-04 15:29:53,507 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-04 15:29:53,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:53,508 INFO L85 PathProgramCache]: Analyzing trace with hash 202297284, now seen corresponding path program 1 times [2025-03-04 15:29:53,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:53,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768794216] [2025-03-04 15:29:53,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:53,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:53,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:29:53,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:29:53,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:53,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:53,562 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:29:53,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:53,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768794216] [2025-03-04 15:29:53,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768794216] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:29:53,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881178971] [2025-03-04 15:29:53,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:53,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:53,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:53,564 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:29:53,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 15:29:53,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:29:53,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:29:53,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:53,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:53,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:29:53,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:29:53,628 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:29:53,628 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:29:53,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881178971] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:29:53,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:29:53,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-04 15:29:53,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997794757] [2025-03-04 15:29:53,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:29:53,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:29:53,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:53,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:29:53,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:29:53,634 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 41 [2025-03-04 15:29:53,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 67 transitions, 338 flow. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:53,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:53,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 41 [2025-03-04 15:29:53,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:54,535 INFO L124 PetriNetUnfolderBase]: 8749/13205 cut-off events. [2025-03-04 15:29:54,536 INFO L125 PetriNetUnfolderBase]: For 14579/14989 co-relation queries the response was YES. [2025-03-04 15:29:54,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40498 conditions, 13205 events. 8749/13205 cut-off events. For 14579/14989 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 78828 event pairs, 1464 based on Foata normal form. 422/12184 useless extension candidates. Maximal degree in co-relation 40456. Up to 3406 conditions per place. [2025-03-04 15:29:54,597 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 180 selfloop transitions, 7 changer transitions 0/194 dead transitions. [2025-03-04 15:29:54,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 194 transitions, 1328 flow [2025-03-04 15:29:54,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:29:54,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:29:54,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 155 transitions. [2025-03-04 15:29:54,599 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6300813008130082 [2025-03-04 15:29:54,599 INFO L175 Difference]: Start difference. First operand has 82 places, 67 transitions, 338 flow. Second operand 6 states and 155 transitions. [2025-03-04 15:29:54,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 194 transitions, 1328 flow [2025-03-04 15:29:54,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 194 transitions, 1319 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 15:29:54,645 INFO L231 Difference]: Finished difference. Result has 82 places, 66 transitions, 339 flow [2025-03-04 15:29:54,645 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=339, PETRI_PLACES=82, PETRI_TRANSITIONS=66} [2025-03-04 15:29:54,646 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 40 predicate places. [2025-03-04 15:29:54,646 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 66 transitions, 339 flow [2025-03-04 15:29:54,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:54,646 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:54,646 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:54,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 15:29:54,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:54,851 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-04 15:29:54,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:54,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1976248821, now seen corresponding path program 1 times [2025-03-04 15:29:54,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:54,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989192049] [2025-03-04 15:29:54,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:54,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:54,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:29:54,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:29:54,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:54,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:54,893 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:29:54,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:54,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989192049] [2025-03-04 15:29:54,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989192049] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:29:54,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743634357] [2025-03-04 15:29:54,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:54,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:54,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:54,896 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:29:54,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 15:29:54,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:29:54,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:29:54,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:54,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:54,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:29:54,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:29:54,960 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:29:54,960 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:29:54,988 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:29:54,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743634357] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:29:54,990 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:29:54,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-04 15:29:54,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931267600] [2025-03-04 15:29:54,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:29:54,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 15:29:54,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:54,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 15:29:54,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 15:29:54,999 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 41 [2025-03-04 15:29:54,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 66 transitions, 339 flow. Second operand has 12 states, 12 states have (on average 14.666666666666666) internal successors, (176), 12 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:54,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:55,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 41 [2025-03-04 15:29:55,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:56,565 INFO L124 PetriNetUnfolderBase]: 17053/25612 cut-off events. [2025-03-04 15:29:56,565 INFO L125 PetriNetUnfolderBase]: For 35744/36702 co-relation queries the response was YES. [2025-03-04 15:29:56,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83944 conditions, 25612 events. 17053/25612 cut-off events. For 35744/36702 co-relation queries the response was YES. Maximal size of possible extension queue 551. Compared 160184 event pairs, 4022 based on Foata normal form. 1266/24087 useless extension candidates. Maximal degree in co-relation 83904. Up to 9879 conditions per place. [2025-03-04 15:29:56,721 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 311 selfloop transitions, 13 changer transitions 0/331 dead transitions. [2025-03-04 15:29:56,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 331 transitions, 2281 flow [2025-03-04 15:29:56,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:29:56,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 15:29:56,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 266 transitions. [2025-03-04 15:29:56,723 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6487804878048781 [2025-03-04 15:29:56,723 INFO L175 Difference]: Start difference. First operand has 82 places, 66 transitions, 339 flow. Second operand 10 states and 266 transitions. [2025-03-04 15:29:56,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 331 transitions, 2281 flow [2025-03-04 15:29:56,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 331 transitions, 2235 flow, removed 8 selfloop flow, removed 5 redundant places. [2025-03-04 15:29:56,814 INFO L231 Difference]: Finished difference. Result has 89 places, 75 transitions, 391 flow [2025-03-04 15:29:56,814 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=391, PETRI_PLACES=89, PETRI_TRANSITIONS=75} [2025-03-04 15:29:56,815 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 47 predicate places. [2025-03-04 15:29:56,815 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 75 transitions, 391 flow [2025-03-04 15:29:56,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 14.666666666666666) internal successors, (176), 12 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:56,815 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:56,815 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1] [2025-03-04 15:29:56,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 15:29:57,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:57,019 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-04 15:29:57,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:57,020 INFO L85 PathProgramCache]: Analyzing trace with hash -165796893, now seen corresponding path program 2 times [2025-03-04 15:29:57,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:57,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847267653] [2025-03-04 15:29:57,020 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:29:57,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:57,027 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 15:29:57,031 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-03-04 15:29:57,032 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:29:57,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:57,066 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-04 15:29:57,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:57,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847267653] [2025-03-04 15:29:57,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847267653] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:29:57,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60337794] [2025-03-04 15:29:57,067 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:29:57,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:57,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:57,070 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:29:57,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 15:29:57,110 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 15:29:57,116 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-03-04 15:29:57,117 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:29:57,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:57,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:29:57,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:29:57,138 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-04 15:29:57,139 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:29:57,161 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-04 15:29:57,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60337794] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:29:57,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:29:57,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 2 [2025-03-04 15:29:57,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340346835] [2025-03-04 15:29:57,162 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:29:57,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:29:57,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:57,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:29:57,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:29:57,168 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 41 [2025-03-04 15:29:57,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 75 transitions, 391 flow. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:57,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:57,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 41 [2025-03-04 15:29:57,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:58,696 INFO L124 PetriNetUnfolderBase]: 15880/24979 cut-off events. [2025-03-04 15:29:58,696 INFO L125 PetriNetUnfolderBase]: For 42059/42267 co-relation queries the response was YES. [2025-03-04 15:29:58,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81319 conditions, 24979 events. 15880/24979 cut-off events. For 42059/42267 co-relation queries the response was YES. Maximal size of possible extension queue 601. Compared 166877 event pairs, 10494 based on Foata normal form. 1/23516 useless extension candidates. Maximal degree in co-relation 81282. Up to 21033 conditions per place. [2025-03-04 15:29:58,863 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 52 selfloop transitions, 15 changer transitions 0/74 dead transitions. [2025-03-04 15:29:58,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 74 transitions, 515 flow [2025-03-04 15:29:58,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:29:58,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:29:58,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2025-03-04 15:29:58,865 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4695121951219512 [2025-03-04 15:29:58,865 INFO L175 Difference]: Start difference. First operand has 89 places, 75 transitions, 391 flow. Second operand 4 states and 77 transitions. [2025-03-04 15:29:58,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 74 transitions, 515 flow [2025-03-04 15:29:58,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 74 transitions, 494 flow, removed 4 selfloop flow, removed 6 redundant places. [2025-03-04 15:29:58,970 INFO L231 Difference]: Finished difference. Result has 85 places, 74 transitions, 390 flow [2025-03-04 15:29:58,970 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=390, PETRI_PLACES=85, PETRI_TRANSITIONS=74} [2025-03-04 15:29:58,971 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 43 predicate places. [2025-03-04 15:29:58,971 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 74 transitions, 390 flow [2025-03-04 15:29:58,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:58,971 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:58,971 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:58,977 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-04 15:29:59,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 15:29:59,172 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-04 15:29:59,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:59,172 INFO L85 PathProgramCache]: Analyzing trace with hash -757192391, now seen corresponding path program 2 times [2025-03-04 15:29:59,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:59,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482585121] [2025-03-04 15:29:59,172 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:29:59,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:59,177 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-04 15:29:59,180 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 20 statements. [2025-03-04 15:29:59,180 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:29:59,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:59,198 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 15:29:59,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:59,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482585121] [2025-03-04 15:29:59,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482585121] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:29:59,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:29:59,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:29:59,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545472234] [2025-03-04 15:29:59,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:29:59,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:29:59,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:59,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:29:59,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:29:59,202 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 41 [2025-03-04 15:29:59,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 74 transitions, 390 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:59,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:59,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 41 [2025-03-04 15:29:59,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:30:00,538 INFO L124 PetriNetUnfolderBase]: 15880/24578 cut-off events. [2025-03-04 15:30:00,538 INFO L125 PetriNetUnfolderBase]: For 35125/35133 co-relation queries the response was YES. [2025-03-04 15:30:00,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77231 conditions, 24578 events. 15880/24578 cut-off events. For 35125/35133 co-relation queries the response was YES. Maximal size of possible extension queue 582. Compared 160402 event pairs, 7710 based on Foata normal form. 0/23113 useless extension candidates. Maximal degree in co-relation 69037. Up to 16075 conditions per place. [2025-03-04 15:30:00,699 INFO L140 encePairwiseOnDemand]: 37/41 looper letters, 93 selfloop transitions, 7 changer transitions 2/108 dead transitions. [2025-03-04 15:30:00,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 108 transitions, 754 flow [2025-03-04 15:30:00,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:30:00,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:30:00,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2025-03-04 15:30:00,700 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5365853658536586 [2025-03-04 15:30:00,700 INFO L175 Difference]: Start difference. First operand has 85 places, 74 transitions, 390 flow. Second operand 4 states and 88 transitions. [2025-03-04 15:30:00,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 108 transitions, 754 flow [2025-03-04 15:30:00,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 108 transitions, 724 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:30:00,806 INFO L231 Difference]: Finished difference. Result has 84 places, 72 transitions, 365 flow [2025-03-04 15:30:00,806 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=365, PETRI_PLACES=84, PETRI_TRANSITIONS=72} [2025-03-04 15:30:00,806 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 42 predicate places. [2025-03-04 15:30:00,806 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 72 transitions, 365 flow [2025-03-04 15:30:00,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:30:00,806 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:30:00,806 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:30:00,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 15:30:00,806 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-04 15:30:00,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:30:00,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1537965143, now seen corresponding path program 2 times [2025-03-04 15:30:00,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:30:00,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725966822] [2025-03-04 15:30:00,807 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:30:00,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:30:00,812 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 15:30:00,815 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 22 statements. [2025-03-04 15:30:00,815 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:30:00,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:00,832 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-04 15:30:00,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:30:00,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725966822] [2025-03-04 15:30:00,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725966822] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:30:00,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125410812] [2025-03-04 15:30:00,833 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:30:00,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:30:00,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:30:00,835 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:30:00,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 15:30:00,874 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 15:30:00,882 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 22 statements. [2025-03-04 15:30:00,882 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:30:00,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:00,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:30:00,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:30:00,904 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-04 15:30:00,904 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:30:00,927 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-04 15:30:00,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2125410812] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:30:00,928 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:30:00,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 2 [2025-03-04 15:30:00,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090132069] [2025-03-04 15:30:00,929 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:30:00,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:30:00,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:30:00,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:30:00,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:30:00,933 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 41 [2025-03-04 15:30:00,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 72 transitions, 365 flow. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:30:00,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:30:00,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 41 [2025-03-04 15:30:00,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:30:02,212 INFO L124 PetriNetUnfolderBase]: 15865/24548 cut-off events. [2025-03-04 15:30:02,212 INFO L125 PetriNetUnfolderBase]: For 45295/45295 co-relation queries the response was YES. [2025-03-04 15:30:02,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78083 conditions, 24548 events. 15865/24548 cut-off events. For 45295/45295 co-relation queries the response was YES. Maximal size of possible extension queue 546. Compared 158301 event pairs, 6063 based on Foata normal form. 414/24109 useless extension candidates. Maximal degree in co-relation 68710. Up to 13194 conditions per place. [2025-03-04 15:30:02,507 INFO L140 encePairwiseOnDemand]: 37/41 looper letters, 78 selfloop transitions, 11 changer transitions 10/104 dead transitions. [2025-03-04 15:30:02,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 104 transitions, 722 flow [2025-03-04 15:30:02,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:30:02,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:30:02,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2025-03-04 15:30:02,508 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5426829268292683 [2025-03-04 15:30:02,508 INFO L175 Difference]: Start difference. First operand has 84 places, 72 transitions, 365 flow. Second operand 4 states and 89 transitions. [2025-03-04 15:30:02,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 104 transitions, 722 flow [2025-03-04 15:30:02,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 104 transitions, 686 flow, removed 1 selfloop flow, removed 7 redundant places. [2025-03-04 15:30:02,651 INFO L231 Difference]: Finished difference. Result has 78 places, 66 transitions, 334 flow [2025-03-04 15:30:02,651 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=331, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=334, PETRI_PLACES=78, PETRI_TRANSITIONS=66} [2025-03-04 15:30:02,652 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 36 predicate places. [2025-03-04 15:30:02,652 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 66 transitions, 334 flow [2025-03-04 15:30:02,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:30:02,652 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:30:02,652 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:30:02,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 15:30:02,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 15:30:02,854 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-04 15:30:02,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:30:02,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1276774080, now seen corresponding path program 2 times [2025-03-04 15:30:02,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:30:02,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926996947] [2025-03-04 15:30:02,855 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:30:02,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:30:02,859 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-04 15:30:02,861 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 24 statements. [2025-03-04 15:30:02,861 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:30:02,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:02,878 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-04 15:30:02,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:30:02,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926996947] [2025-03-04 15:30:02,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926996947] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:30:02,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1715206853] [2025-03-04 15:30:02,878 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:30:02,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:30:02,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:30:02,880 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:30:02,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 15:30:02,921 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-04 15:30:02,929 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 24 statements. [2025-03-04 15:30:02,930 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:30:02,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:02,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:30:02,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:30:02,951 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-04 15:30:02,952 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:30:02,975 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-04 15:30:02,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1715206853] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:30:02,976 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:30:02,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 2 [2025-03-04 15:30:02,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477528394] [2025-03-04 15:30:02,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:30:02,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:30:02,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:30:02,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:30:02,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:30:02,980 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 41 [2025-03-04 15:30:02,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 66 transitions, 334 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:30:02,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:30:02,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 41 [2025-03-04 15:30:02,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:30:03,890 INFO L124 PetriNetUnfolderBase]: 13004/20693 cut-off events. [2025-03-04 15:30:03,890 INFO L125 PetriNetUnfolderBase]: For 38315/38315 co-relation queries the response was YES. [2025-03-04 15:30:03,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65760 conditions, 20693 events. 13004/20693 cut-off events. For 38315/38315 co-relation queries the response was YES. Maximal size of possible extension queue 501. Compared 137798 event pairs, 5065 based on Foata normal form. 422/20558 useless extension candidates. Maximal degree in co-relation 58495. Up to 9756 conditions per place. [2025-03-04 15:30:03,936 INFO L140 encePairwiseOnDemand]: 37/41 looper letters, 0 selfloop transitions, 0 changer transitions 97/97 dead transitions. [2025-03-04 15:30:03,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 97 transitions, 675 flow [2025-03-04 15:30:03,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:30:03,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:30:03,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2025-03-04 15:30:03,936 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5304878048780488 [2025-03-04 15:30:03,936 INFO L175 Difference]: Start difference. First operand has 78 places, 66 transitions, 334 flow. Second operand 4 states and 87 transitions. [2025-03-04 15:30:03,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 97 transitions, 675 flow [2025-03-04 15:30:04,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 97 transitions, 623 flow, removed 1 selfloop flow, removed 7 redundant places. [2025-03-04 15:30:04,016 INFO L231 Difference]: Finished difference. Result has 72 places, 0 transitions, 0 flow [2025-03-04 15:30:04,016 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=72, PETRI_TRANSITIONS=0} [2025-03-04 15:30:04,016 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 30 predicate places. [2025-03-04 15:30:04,016 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 0 transitions, 0 flow [2025-03-04 15:30:04,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:30:04,018 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 17 remaining) [2025-03-04 15:30:04,018 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 17 remaining) [2025-03-04 15:30:04,018 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 17 remaining) [2025-03-04 15:30:04,018 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 17 remaining) [2025-03-04 15:30:04,018 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 17 remaining) [2025-03-04 15:30:04,018 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 17 remaining) [2025-03-04 15:30:04,018 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 17 remaining) [2025-03-04 15:30:04,018 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 17 remaining) [2025-03-04 15:30:04,018 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 17 remaining) [2025-03-04 15:30:04,018 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 17 remaining) [2025-03-04 15:30:04,018 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 17 remaining) [2025-03-04 15:30:04,018 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 17 remaining) [2025-03-04 15:30:04,019 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 17 remaining) [2025-03-04 15:30:04,019 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 17 remaining) [2025-03-04 15:30:04,019 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 17 remaining) [2025-03-04 15:30:04,019 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 17 remaining) [2025-03-04 15:30:04,019 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 17 remaining) [2025-03-04 15:30:04,025 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-04 15:30:04,219 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,SelfDestructingSolverStorable17 [2025-03-04 15:30:04,220 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:30:04,223 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 15:30:04,223 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 15:30:04,227 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 03:30:04 BasicIcfg [2025-03-04 15:30:04,227 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 15:30:04,228 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 15:30:04,228 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 15:30:04,228 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 15:30:04,228 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:29:46" (3/4) ... [2025-03-04 15:30:04,229 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 15:30:04,231 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-04 15:30:04,231 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-04 15:30:04,231 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-03-04 15:30:04,234 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 71 nodes and edges [2025-03-04 15:30:04,234 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 29 nodes and edges [2025-03-04 15:30:04,234 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-03-04 15:30:04,234 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 15:30:04,287 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 15:30:04,288 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 15:30:04,288 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 15:30:04,289 INFO L158 Benchmark]: Toolchain (without parser) took 18054.53ms. Allocated memory was 167.8MB in the beginning and 3.1GB in the end (delta: 2.9GB). Free memory was 123.3MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2025-03-04 15:30:04,289 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 117.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:30:04,290 INFO L158 Benchmark]: CACSL2BoogieTranslator took 188.10ms. Allocated memory is still 167.8MB. Free memory was 123.3MB in the beginning and 111.6MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:30:04,291 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.90ms. Allocated memory is still 167.8MB. Free memory was 111.6MB in the beginning and 110.8MB in the end (delta: 770.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:30:04,291 INFO L158 Benchmark]: Boogie Preprocessor took 41.67ms. Allocated memory is still 167.8MB. Free memory was 110.8MB in the beginning and 108.9MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:30:04,292 INFO L158 Benchmark]: IcfgBuilder took 432.16ms. Allocated memory is still 167.8MB. Free memory was 108.9MB in the beginning and 74.4MB in the end (delta: 34.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-04 15:30:04,292 INFO L158 Benchmark]: TraceAbstraction took 17293.51ms. Allocated memory was 167.8MB in the beginning and 3.1GB in the end (delta: 2.9GB). Free memory was 73.5MB in the beginning and 1.8GB in the end (delta: -1.8GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2025-03-04 15:30:04,292 INFO L158 Benchmark]: Witness Printer took 60.36ms. Allocated memory is still 3.1GB. Free memory was 1.8GB in the beginning and 1.8GB in the end (delta: 4.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:30:04,293 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 117.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 188.10ms. Allocated memory is still 167.8MB. Free memory was 123.3MB in the beginning and 111.6MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.90ms. Allocated memory is still 167.8MB. Free memory was 111.6MB in the beginning and 110.8MB in the end (delta: 770.8kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 41.67ms. Allocated memory is still 167.8MB. Free memory was 110.8MB in the beginning and 108.9MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 432.16ms. Allocated memory is still 167.8MB. Free memory was 108.9MB in the beginning and 74.4MB in the end (delta: 34.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 17293.51ms. Allocated memory was 167.8MB in the beginning and 3.1GB in the end (delta: 2.9GB). Free memory was 73.5MB in the beginning and 1.8GB in the end (delta: -1.8GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. * Witness Printer took 60.36ms. Allocated memory is still 3.1GB. Free memory was 1.8GB in the beginning and 1.8GB in the end (delta: 4.4MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 64]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 64]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 100]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 100]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 62 locations, 17 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 17.2s, OverallIterations: 18, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 12.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 986 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 928 mSDsluCounter, 270 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 230 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3105 IncrementalHoareTripleChecker+Invalid, 3135 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 40 mSDtfsCounter, 3105 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 338 GetRequests, 207 SyntacticMatches, 3 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=391occurred in iteration=14, InterpolantAutomatonStates: 109, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 364 NumberOfCodeBlocks, 271 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 440 ConstructedInterpolants, 0 QuantifiedInterpolants, 1248 SizeOfPredicates, 29 NumberOfNonLiveVariables, 1008 ConjunctsInSsa, 54 ConjunctsInUnsatCore, 35 InterpolantComputations, 11 PerfectInterpolantSequences, 236/344 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 15:30:04,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE