./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/chl-word-symm.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/chl-word-symm.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bf81f7b3bd1ceac2bf46c7c37f69effc0af9de17b18c7565156301fb49a6164e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:26:03,768 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:26:03,820 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:26:03,828 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:26:03,828 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:26:03,849 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:26:03,850 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:26:03,850 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:26:03,850 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:26:03,850 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:26:03,851 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:26:03,851 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:26:03,852 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:26:03,852 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:26:03,852 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:26:03,852 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:26:03,852 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:26:03,852 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:26:03,852 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:26:03,852 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:26:03,852 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:26:03,852 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:26:03,852 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:26:03,853 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:26:03,853 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:26:03,853 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:26:03,853 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:26:03,853 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:26:03,853 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:26:03,853 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:26:03,853 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:26:03,853 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:26:03,853 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:26:03,854 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:26:03,854 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:26:03,854 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:26:03,854 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:26:03,854 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:26:03,854 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:26:03,854 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:26:03,854 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:26:03,854 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:26:03,854 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:26:03,854 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:26:03,854 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:26:03,854 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 -> bf81f7b3bd1ceac2bf46c7c37f69effc0af9de17b18c7565156301fb49a6164e [2025-03-04 15:26:04,080 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:26:04,088 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:26:04,089 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:26:04,090 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:26:04,090 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:26:04,092 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-word-symm.wvr.c [2025-03-04 15:26:05,293 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b2d7c6de/d45c8637c481425cb83f1aec56395455/FLAGb45740c66 [2025-03-04 15:26:05,571 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:26:05,573 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-word-symm.wvr.c [2025-03-04 15:26:05,581 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b2d7c6de/d45c8637c481425cb83f1aec56395455/FLAGb45740c66 [2025-03-04 15:26:05,597 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b2d7c6de/d45c8637c481425cb83f1aec56395455 [2025-03-04 15:26:05,599 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:26:05,600 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:26:05,602 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:26:05,602 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:26:05,606 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:26:05,607 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:26:05" (1/1) ... [2025-03-04 15:26:05,608 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55326951 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:05, skipping insertion in model container [2025-03-04 15:26:05,609 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:26:05" (1/1) ... [2025-03-04 15:26:05,622 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:26:05,771 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:26:05,782 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:26:05,808 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:26:05,822 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:26:05,822 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:05 WrapperNode [2025-03-04 15:26:05,822 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:26:05,824 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:26:05,824 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:26:05,824 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:26:05,828 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:26:05" (1/1) ... [2025-03-04 15:26:05,835 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:26:05" (1/1) ... [2025-03-04 15:26:05,856 INFO L138 Inliner]: procedures = 23, calls = 26, calls flagged for inlining = 10, calls inlined = 12, statements flattened = 123 [2025-03-04 15:26:05,856 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:26:05,857 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:26:05,857 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:26:05,857 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:26:05,867 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:05" (1/1) ... [2025-03-04 15:26:05,867 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:05" (1/1) ... [2025-03-04 15:26:05,870 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:05" (1/1) ... [2025-03-04 15:26:05,890 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-03-04 15:26:05,890 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:05" (1/1) ... [2025-03-04 15:26:05,890 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:05" (1/1) ... [2025-03-04 15:26:05,900 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:05" (1/1) ... [2025-03-04 15:26:05,901 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:05" (1/1) ... [2025-03-04 15:26:05,905 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:05" (1/1) ... [2025-03-04 15:26:05,906 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:05" (1/1) ... [2025-03-04 15:26:05,911 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:26:05,912 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:26:05,912 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:26:05,912 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:26:05,913 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:05" (1/1) ... [2025-03-04 15:26:05,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:26:05,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:26:05,943 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:26:05,946 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:26:05,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:26:05,965 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 15:26:05,965 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 15:26:05,965 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 15:26:05,966 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 15:26:05,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:26:05,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 15:26:05,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:26:05,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:26:05,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 15:26:05,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:26:05,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:26:05,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:26:05,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:26:05,968 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:26:06,052 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:26:06,054 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:26:06,356 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:26:06,356 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:26:06,526 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:26:06,526 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:26:06,526 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:26:06 BoogieIcfgContainer [2025-03-04 15:26:06,526 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:26:06,528 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:26:06,529 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:26:06,532 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:26:06,532 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:26:05" (1/3) ... [2025-03-04 15:26:06,533 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dc7a0d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:26:06, skipping insertion in model container [2025-03-04 15:26:06,533 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:05" (2/3) ... [2025-03-04 15:26:06,533 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dc7a0d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:26:06, skipping insertion in model container [2025-03-04 15:26:06,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:26:06" (3/3) ... [2025-03-04 15:26:06,536 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-word-symm.wvr.c [2025-03-04 15:26:06,547 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:26:06,548 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-word-symm.wvr.c that has 3 procedures, 51 locations, 1 initial locations, 4 loop locations, and 12 error locations. [2025-03-04 15:26:06,548 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:26:06,601 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 15:26:06,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 60 transitions, 134 flow [2025-03-04 15:26:06,670 INFO L124 PetriNetUnfolderBase]: 10/58 cut-off events. [2025-03-04 15:26:06,674 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 15:26:06,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 58 events. 10/58 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 160 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 43. Up to 3 conditions per place. [2025-03-04 15:26:06,679 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 60 transitions, 134 flow [2025-03-04 15:26:06,681 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 56 transitions, 121 flow [2025-03-04 15:26:06,688 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:26:06,700 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;@76353058, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:26:06,701 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-03-04 15:26:06,707 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:26:06,707 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-03-04 15:26:06,707 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:26:06,708 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:06,708 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 15:26:06,709 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 15:26:06,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:06,714 INFO L85 PathProgramCache]: Analyzing trace with hash 500698, now seen corresponding path program 1 times [2025-03-04 15:26:06,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:06,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463008620] [2025-03-04 15:26:06,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:06,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:06,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:26:06,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:26:06,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:06,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:06,943 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:26:06,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:06,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463008620] [2025-03-04 15:26:06,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463008620] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:06,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:26:06,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:26:06,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140111721] [2025-03-04 15:26:06,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:06,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:26:06,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:06,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:26:06,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:26:06,989 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 60 [2025-03-04 15:26:06,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 56 transitions, 121 flow. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 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:26:06,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:06,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 60 [2025-03-04 15:26:06,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:07,180 INFO L124 PetriNetUnfolderBase]: 291/673 cut-off events. [2025-03-04 15:26:07,180 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-03-04 15:26:07,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1114 conditions, 673 events. 291/673 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3756 event pairs, 157 based on Foata normal form. 2/493 useless extension candidates. Maximal degree in co-relation 1021. Up to 410 conditions per place. [2025-03-04 15:26:07,190 INFO L140 encePairwiseOnDemand]: 49/60 looper letters, 33 selfloop transitions, 7 changer transitions 0/62 dead transitions. [2025-03-04 15:26:07,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 62 transitions, 213 flow [2025-03-04 15:26:07,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:26:07,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:26:07,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 140 transitions. [2025-03-04 15:26:07,203 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2025-03-04 15:26:07,204 INFO L175 Difference]: Start difference. First operand has 53 places, 56 transitions, 121 flow. Second operand 4 states and 140 transitions. [2025-03-04 15:26:07,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 62 transitions, 213 flow [2025-03-04 15:26:07,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 62 transitions, 208 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:26:07,209 INFO L231 Difference]: Finished difference. Result has 56 places, 62 transitions, 176 flow [2025-03-04 15:26:07,211 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=56, PETRI_TRANSITIONS=62} [2025-03-04 15:26:07,214 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 3 predicate places. [2025-03-04 15:26:07,214 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 62 transitions, 176 flow [2025-03-04 15:26:07,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 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:26:07,214 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:07,214 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-04 15:26:07,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:26:07,215 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 15:26:07,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:07,215 INFO L85 PathProgramCache]: Analyzing trace with hash 2031821814, now seen corresponding path program 1 times [2025-03-04 15:26:07,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:07,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754156585] [2025-03-04 15:26:07,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:07,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:07,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:26:07,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:26:07,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:07,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:07,318 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:26:07,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:07,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754156585] [2025-03-04 15:26:07,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754156585] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:26:07,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [769743643] [2025-03-04 15:26:07,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:07,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:07,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:26:07,322 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:26:07,323 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:26:07,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:26:07,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:26:07,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:07,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:07,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:26:07,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:26:07,419 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:26:07,420 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:26:07,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [769743643] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:07,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:26:07,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-04 15:26:07,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058812683] [2025-03-04 15:26:07,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:07,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:26:07,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:07,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:26:07,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:26:07,437 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 60 [2025-03-04 15:26:07,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 62 transitions, 176 flow. Second operand has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 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:26:07,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:07,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 60 [2025-03-04 15:26:07,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:07,591 INFO L124 PetriNetUnfolderBase]: 291/671 cut-off events. [2025-03-04 15:26:07,591 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-04 15:26:07,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1125 conditions, 671 events. 291/671 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3736 event pairs, 157 based on Foata normal form. 2/494 useless extension candidates. Maximal degree in co-relation 1075. Up to 400 conditions per place. [2025-03-04 15:26:07,598 INFO L140 encePairwiseOnDemand]: 51/60 looper letters, 26 selfloop transitions, 12 changer transitions 0/60 dead transitions. [2025-03-04 15:26:07,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 60 transitions, 244 flow [2025-03-04 15:26:07,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:26:07,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:26:07,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 184 transitions. [2025-03-04 15:26:07,622 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5111111111111111 [2025-03-04 15:26:07,623 INFO L175 Difference]: Start difference. First operand has 56 places, 62 transitions, 176 flow. Second operand 6 states and 184 transitions. [2025-03-04 15:26:07,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 60 transitions, 244 flow [2025-03-04 15:26:07,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 60 transitions, 244 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:26:07,624 INFO L231 Difference]: Finished difference. Result has 59 places, 60 transitions, 192 flow [2025-03-04 15:26:07,624 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=192, PETRI_PLACES=59, PETRI_TRANSITIONS=60} [2025-03-04 15:26:07,625 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 6 predicate places. [2025-03-04 15:26:07,625 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 60 transitions, 192 flow [2025-03-04 15:26:07,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 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:26:07,625 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:07,625 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-03-04 15:26:07,632 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:26:07,826 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:26:07,826 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 15:26:07,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:07,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1438032776, now seen corresponding path program 1 times [2025-03-04 15:26:07,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:07,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925342951] [2025-03-04 15:26:07,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:07,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:07,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:26:07,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:26:07,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:07,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:07,921 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:26:07,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:07,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925342951] [2025-03-04 15:26:07,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925342951] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:26:07,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898836192] [2025-03-04 15:26:07,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:07,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:07,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:26:07,924 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:26:07,926 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:26:07,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:26:07,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:26:07,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:07,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:07,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:26:07,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:26:07,988 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:26:07,988 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:26:08,019 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:26:08,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [898836192] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:26:08,019 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:26:08,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-03-04 15:26:08,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598943668] [2025-03-04 15:26:08,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:26:08,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 15:26:08,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:08,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 15:26:08,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 15:26:08,038 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 60 [2025-03-04 15:26:08,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 60 transitions, 192 flow. Second operand has 12 states, 12 states have (on average 25.083333333333332) internal successors, (301), 12 states have internal predecessors, (301), 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:26:08,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:08,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 60 [2025-03-04 15:26:08,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:08,201 INFO L124 PetriNetUnfolderBase]: 297/695 cut-off events. [2025-03-04 15:26:08,202 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2025-03-04 15:26:08,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1219 conditions, 695 events. 297/695 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3959 event pairs, 157 based on Foata normal form. 6/521 useless extension candidates. Maximal degree in co-relation 1077. Up to 411 conditions per place. [2025-03-04 15:26:08,205 INFO L140 encePairwiseOnDemand]: 51/60 looper letters, 31 selfloop transitions, 25 changer transitions 0/78 dead transitions. [2025-03-04 15:26:08,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 78 transitions, 418 flow [2025-03-04 15:26:08,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:26:08,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 15:26:08,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 302 transitions. [2025-03-04 15:26:08,207 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5033333333333333 [2025-03-04 15:26:08,207 INFO L175 Difference]: Start difference. First operand has 59 places, 60 transitions, 192 flow. Second operand 10 states and 302 transitions. [2025-03-04 15:26:08,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 78 transitions, 418 flow [2025-03-04 15:26:08,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 78 transitions, 360 flow, removed 12 selfloop flow, removed 5 redundant places. [2025-03-04 15:26:08,210 INFO L231 Difference]: Finished difference. Result has 66 places, 78 transitions, 332 flow [2025-03-04 15:26:08,210 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=332, PETRI_PLACES=66, PETRI_TRANSITIONS=78} [2025-03-04 15:26:08,211 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 13 predicate places. [2025-03-04 15:26:08,212 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 78 transitions, 332 flow [2025-03-04 15:26:08,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 25.083333333333332) internal successors, (301), 12 states have internal predecessors, (301), 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:26:08,212 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:08,212 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:08,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 15:26:08,412 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,SelfDestructingSolverStorable2 [2025-03-04 15:26:08,413 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 15:26:08,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:08,413 INFO L85 PathProgramCache]: Analyzing trace with hash -912270853, now seen corresponding path program 1 times [2025-03-04 15:26:08,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:08,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896661425] [2025-03-04 15:26:08,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:08,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:08,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:26:08,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:26:08,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:08,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:08,491 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:26:08,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:08,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896661425] [2025-03-04 15:26:08,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896661425] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:08,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:26:08,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:26:08,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923974115] [2025-03-04 15:26:08,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:08,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:26:08,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:08,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:26:08,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:26:08,499 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 60 [2025-03-04 15:26:08,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 78 transitions, 332 flow. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 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:26:08,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:08,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 60 [2025-03-04 15:26:08,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:08,664 INFO L124 PetriNetUnfolderBase]: 513/1003 cut-off events. [2025-03-04 15:26:08,665 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2025-03-04 15:26:08,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 1003 events. 513/1003 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 5124 event pairs, 233 based on Foata normal form. 18/806 useless extension candidates. Maximal degree in co-relation 1814. Up to 597 conditions per place. [2025-03-04 15:26:08,670 INFO L140 encePairwiseOnDemand]: 54/60 looper letters, 82 selfloop transitions, 4 changer transitions 0/107 dead transitions. [2025-03-04 15:26:08,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 107 transitions, 566 flow [2025-03-04 15:26:08,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:26:08,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:26:08,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 164 transitions. [2025-03-04 15:26:08,672 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6833333333333333 [2025-03-04 15:26:08,672 INFO L175 Difference]: Start difference. First operand has 66 places, 78 transitions, 332 flow. Second operand 4 states and 164 transitions. [2025-03-04 15:26:08,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 107 transitions, 566 flow [2025-03-04 15:26:08,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 107 transitions, 542 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-03-04 15:26:08,675 INFO L231 Difference]: Finished difference. Result has 69 places, 81 transitions, 337 flow [2025-03-04 15:26:08,675 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=337, PETRI_PLACES=69, PETRI_TRANSITIONS=81} [2025-03-04 15:26:08,676 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 16 predicate places. [2025-03-04 15:26:08,676 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 81 transitions, 337 flow [2025-03-04 15:26:08,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 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:26:08,676 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:08,677 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:08,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 15:26:08,677 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 15:26:08,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:08,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1784343332, now seen corresponding path program 1 times [2025-03-04 15:26:08,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:08,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891832265] [2025-03-04 15:26:08,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:08,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:08,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:26:08,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:26:08,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:08,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:08,776 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:26:08,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:08,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891832265] [2025-03-04 15:26:08,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891832265] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:08,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:26:08,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:26:08,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843725344] [2025-03-04 15:26:08,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:08,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:26:08,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:08,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:26:08,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:26:08,802 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 60 [2025-03-04 15:26:08,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 81 transitions, 337 flow. Second operand has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 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:26:08,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:08,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 60 [2025-03-04 15:26:08,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:09,040 INFO L124 PetriNetUnfolderBase]: 1170/2280 cut-off events. [2025-03-04 15:26:09,040 INFO L125 PetriNetUnfolderBase]: For 341/341 co-relation queries the response was YES. [2025-03-04 15:26:09,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4406 conditions, 2280 events. 1170/2280 cut-off events. For 341/341 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 14186 event pairs, 586 based on Foata normal form. 26/1847 useless extension candidates. Maximal degree in co-relation 4339. Up to 812 conditions per place. [2025-03-04 15:26:09,054 INFO L140 encePairwiseOnDemand]: 52/60 looper letters, 77 selfloop transitions, 10 changer transitions 0/108 dead transitions. [2025-03-04 15:26:09,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 108 transitions, 583 flow [2025-03-04 15:26:09,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:26:09,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:26:09,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 184 transitions. [2025-03-04 15:26:09,055 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6133333333333333 [2025-03-04 15:26:09,055 INFO L175 Difference]: Start difference. First operand has 69 places, 81 transitions, 337 flow. Second operand 5 states and 184 transitions. [2025-03-04 15:26:09,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 108 transitions, 583 flow [2025-03-04 15:26:09,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 108 transitions, 578 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:26:09,059 INFO L231 Difference]: Finished difference. Result has 74 places, 83 transitions, 373 flow [2025-03-04 15:26:09,059 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=373, PETRI_PLACES=74, PETRI_TRANSITIONS=83} [2025-03-04 15:26:09,059 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 21 predicate places. [2025-03-04 15:26:09,059 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 83 transitions, 373 flow [2025-03-04 15:26:09,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 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:26:09,060 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:09,060 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:09,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:26:09,060 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 15:26:09,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:09,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1045678684, now seen corresponding path program 1 times [2025-03-04 15:26:09,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:09,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588820383] [2025-03-04 15:26:09,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:09,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:09,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:26:09,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:26:09,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:09,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:09,107 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:26:09,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:09,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588820383] [2025-03-04 15:26:09,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588820383] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:09,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:26:09,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:26:09,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126705435] [2025-03-04 15:26:09,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:09,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:26:09,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:09,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:26:09,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:26:09,117 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 60 [2025-03-04 15:26:09,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 83 transitions, 373 flow. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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:26:09,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:09,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 60 [2025-03-04 15:26:09,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:09,355 INFO L124 PetriNetUnfolderBase]: 1521/2801 cut-off events. [2025-03-04 15:26:09,355 INFO L125 PetriNetUnfolderBase]: For 471/515 co-relation queries the response was YES. [2025-03-04 15:26:09,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5668 conditions, 2801 events. 1521/2801 cut-off events. For 471/515 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 16511 event pairs, 686 based on Foata normal form. 50/2501 useless extension candidates. Maximal degree in co-relation 5599. Up to 1646 conditions per place. [2025-03-04 15:26:09,370 INFO L140 encePairwiseOnDemand]: 54/60 looper letters, 86 selfloop transitions, 4 changer transitions 0/114 dead transitions. [2025-03-04 15:26:09,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 114 transitions, 641 flow [2025-03-04 15:26:09,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:26:09,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:26:09,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 162 transitions. [2025-03-04 15:26:09,372 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.675 [2025-03-04 15:26:09,372 INFO L175 Difference]: Start difference. First operand has 74 places, 83 transitions, 373 flow. Second operand 4 states and 162 transitions. [2025-03-04 15:26:09,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 114 transitions, 641 flow [2025-03-04 15:26:09,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 114 transitions, 635 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:26:09,376 INFO L231 Difference]: Finished difference. Result has 78 places, 86 transitions, 396 flow [2025-03-04 15:26:09,376 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=396, PETRI_PLACES=78, PETRI_TRANSITIONS=86} [2025-03-04 15:26:09,378 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 25 predicate places. [2025-03-04 15:26:09,378 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 86 transitions, 396 flow [2025-03-04 15:26:09,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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:26:09,378 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:09,378 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:09,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 15:26:09,378 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 15:26:09,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:09,378 INFO L85 PathProgramCache]: Analyzing trace with hash -519931075, now seen corresponding path program 1 times [2025-03-04 15:26:09,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:09,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353534018] [2025-03-04 15:26:09,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:09,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:09,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:26:09,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:26:09,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:09,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:09,467 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:26:09,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:09,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353534018] [2025-03-04 15:26:09,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353534018] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:09,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:26:09,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:26:09,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291855154] [2025-03-04 15:26:09,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:09,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:26:09,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:09,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:26:09,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:26:09,484 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 60 [2025-03-04 15:26:09,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 86 transitions, 396 flow. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 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:26:09,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:09,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 60 [2025-03-04 15:26:09,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:09,949 INFO L124 PetriNetUnfolderBase]: 2916/5586 cut-off events. [2025-03-04 15:26:09,949 INFO L125 PetriNetUnfolderBase]: For 2286/2294 co-relation queries the response was YES. [2025-03-04 15:26:09,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12234 conditions, 5586 events. 2916/5586 cut-off events. For 2286/2294 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 39371 event pairs, 1502 based on Foata normal form. 130/5303 useless extension candidates. Maximal degree in co-relation 12134. Up to 1930 conditions per place. [2025-03-04 15:26:09,979 INFO L140 encePairwiseOnDemand]: 53/60 looper letters, 103 selfloop transitions, 5 changer transitions 0/130 dead transitions. [2025-03-04 15:26:09,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 130 transitions, 803 flow [2025-03-04 15:26:09,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:26:09,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:26:09,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2025-03-04 15:26:09,981 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6791666666666667 [2025-03-04 15:26:09,981 INFO L175 Difference]: Start difference. First operand has 78 places, 86 transitions, 396 flow. Second operand 4 states and 163 transitions. [2025-03-04 15:26:09,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 130 transitions, 803 flow [2025-03-04 15:26:09,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 130 transitions, 798 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:26:09,995 INFO L231 Difference]: Finished difference. Result has 82 places, 88 transitions, 430 flow [2025-03-04 15:26:09,996 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=393, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=430, PETRI_PLACES=82, PETRI_TRANSITIONS=88} [2025-03-04 15:26:09,996 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 29 predicate places. [2025-03-04 15:26:09,996 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 88 transitions, 430 flow [2025-03-04 15:26:09,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 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:26:09,996 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:09,996 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:09,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 15:26:09,996 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 15:26:09,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:09,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1906617430, now seen corresponding path program 1 times [2025-03-04 15:26:09,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:09,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309085945] [2025-03-04 15:26:09,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:09,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:10,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:26:10,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:26:10,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:10,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:10,116 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:26:10,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:10,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309085945] [2025-03-04 15:26:10,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309085945] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:26:10,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022243418] [2025-03-04 15:26:10,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:10,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:10,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:26:10,118 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:26:10,120 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:26:10,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:26:10,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:26:10,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:10,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:10,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:26:10,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:26:10,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:26:10,233 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:26:10,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1022243418] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:10,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:26:10,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [5] total 6 [2025-03-04 15:26:10,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786718462] [2025-03-04 15:26:10,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:10,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:26:10,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:10,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:26:10,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:26:10,243 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 60 [2025-03-04 15:26:10,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 88 transitions, 430 flow. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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:26:10,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:10,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 60 [2025-03-04 15:26:10,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:10,507 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([528] L77-2-->thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (< (+ v_~n2~0_14 2147483648) v_~n1~0_14) InVars {~n2~0=v_~n2~0_14, ~n1~0=v_~n1~0_14} OutVars{~n2~0=v_~n2~0_14, ~n1~0=v_~n1~0_14} AuxVars[] AssignedVars[][72], [Black: 157#(= thread1Thread1of1ForFork1_~i~0 0), Black: 160#(and (= |thread1Thread1of1ForFork1_#t~post5| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 65#(and (= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 14#thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 163#true, 52#thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 167#(<= ~n2~0 ~n1~0), Black: 172#(= thread2Thread1of1ForFork0_~i~1 0), Black: 175#(and (= |thread2Thread1of1ForFork0_#t~post10| 0) (= thread2Thread1of1ForFork0_~i~1 0)), 194#(and (<= 0 ~n1~0) (<= ~n2~0 2147483647)), Black: 181#(<= ~n1~0 ~n2~0), 96#true, Black: 147#(and (<= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)), Black: 149#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 2147483645) (<= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 2147483645)), Black: 151#(and (<= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 2147483646) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 2147483646)), 11#L98-1true, 58#true, 178#true]) [2025-03-04 15:26:10,507 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2025-03-04 15:26:10,507 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-03-04 15:26:10,508 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-03-04 15:26:10,508 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 15:26:10,508 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([512] L57-->thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (< (+ 2147483647 v_~n2~0_3) v_~n1~0_3) InVars {~n2~0=v_~n2~0_3, ~n1~0=v_~n1~0_3} OutVars{~n2~0=v_~n2~0_3, ~n1~0=v_~n1~0_3} AuxVars[] AssignedVars[][66], [Black: 157#(= thread1Thread1of1ForFork1_~i~0 0), Black: 160#(and (= |thread1Thread1of1ForFork1_#t~post5| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 65#(and (= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 14#thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 163#true, 52#thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 167#(<= ~n2~0 ~n1~0), Black: 172#(= thread2Thread1of1ForFork0_~i~1 0), Black: 175#(and (= |thread2Thread1of1ForFork0_#t~post10| 0) (= thread2Thread1of1ForFork0_~i~1 0)), 194#(and (<= 0 ~n1~0) (<= ~n2~0 2147483647)), Black: 181#(<= ~n1~0 ~n2~0), 96#true, Black: 147#(and (<= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)), Black: 149#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 2147483645) (<= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 2147483645)), Black: 151#(and (<= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 2147483646) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 2147483646)), 11#L98-1true, 58#true, 178#true]) [2025-03-04 15:26:10,508 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2025-03-04 15:26:10,508 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-03-04 15:26:10,508 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-03-04 15:26:10,508 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 15:26:10,517 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([528] L77-2-->thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (< (+ v_~n2~0_14 2147483648) v_~n1~0_14) InVars {~n2~0=v_~n2~0_14, ~n1~0=v_~n1~0_14} OutVars{~n2~0=v_~n2~0_14, ~n1~0=v_~n1~0_14} AuxVars[] AssignedVars[][72], [Black: 157#(= thread1Thread1of1ForFork1_~i~0 0), Black: 160#(and (= |thread1Thread1of1ForFork1_#t~post5| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 65#(and (= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 14#thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 163#true, 52#thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 167#(<= ~n2~0 ~n1~0), Black: 172#(= thread2Thread1of1ForFork0_~i~1 0), Black: 175#(and (= |thread2Thread1of1ForFork0_#t~post10| 0) (= thread2Thread1of1ForFork0_~i~1 0)), 34#L99true, 194#(and (<= 0 ~n1~0) (<= ~n2~0 2147483647)), Black: 181#(<= ~n1~0 ~n2~0), 96#true, Black: 147#(and (<= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)), Black: 149#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 2147483645) (<= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 2147483645)), Black: 151#(and (<= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 2147483646) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 2147483646)), 58#true, 178#true]) [2025-03-04 15:26:10,517 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2025-03-04 15:26:10,517 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-03-04 15:26:10,517 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-03-04 15:26:10,517 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-03-04 15:26:10,518 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([512] L57-->thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (< (+ 2147483647 v_~n2~0_3) v_~n1~0_3) InVars {~n2~0=v_~n2~0_3, ~n1~0=v_~n1~0_3} OutVars{~n2~0=v_~n2~0_3, ~n1~0=v_~n1~0_3} AuxVars[] AssignedVars[][66], [Black: 157#(= thread1Thread1of1ForFork1_~i~0 0), Black: 160#(and (= |thread1Thread1of1ForFork1_#t~post5| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 65#(and (= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 14#thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 163#true, 52#thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 167#(<= ~n2~0 ~n1~0), Black: 172#(= thread2Thread1of1ForFork0_~i~1 0), Black: 175#(and (= |thread2Thread1of1ForFork0_#t~post10| 0) (= thread2Thread1of1ForFork0_~i~1 0)), 34#L99true, 194#(and (<= 0 ~n1~0) (<= ~n2~0 2147483647)), Black: 181#(<= ~n1~0 ~n2~0), 96#true, Black: 147#(and (<= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)), Black: 149#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 2147483645) (<= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 2147483645)), Black: 151#(and (<= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 2147483646) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 2147483646)), 58#true, 178#true]) [2025-03-04 15:26:10,518 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2025-03-04 15:26:10,518 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-03-04 15:26:10,518 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-03-04 15:26:10,518 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-03-04 15:26:10,533 INFO L124 PetriNetUnfolderBase]: 2497/5046 cut-off events. [2025-03-04 15:26:10,534 INFO L125 PetriNetUnfolderBase]: For 2121/2135 co-relation queries the response was YES. [2025-03-04 15:26:10,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10605 conditions, 5046 events. 2497/5046 cut-off events. For 2121/2135 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 36546 event pairs, 1374 based on Foata normal form. 134/4858 useless extension candidates. Maximal degree in co-relation 10504. Up to 3298 conditions per place. [2025-03-04 15:26:10,566 INFO L140 encePairwiseOnDemand]: 57/60 looper letters, 57 selfloop transitions, 1 changer transitions 0/84 dead transitions. [2025-03-04 15:26:10,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 84 transitions, 518 flow [2025-03-04 15:26:10,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:26:10,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:26:10,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2025-03-04 15:26:10,567 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2025-03-04 15:26:10,567 INFO L175 Difference]: Start difference. First operand has 82 places, 88 transitions, 430 flow. Second operand 3 states and 110 transitions. [2025-03-04 15:26:10,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 84 transitions, 518 flow [2025-03-04 15:26:10,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 84 transitions, 501 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-03-04 15:26:10,573 INFO L231 Difference]: Finished difference. Result has 78 places, 84 transitions, 387 flow [2025-03-04 15:26:10,574 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=387, PETRI_PLACES=78, PETRI_TRANSITIONS=84} [2025-03-04 15:26:10,575 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 25 predicate places. [2025-03-04 15:26:10,576 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 84 transitions, 387 flow [2025-03-04 15:26:10,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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:26:10,576 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:10,577 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:10,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 15:26:10,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:10,781 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 15:26:10,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:10,781 INFO L85 PathProgramCache]: Analyzing trace with hash -490853773, now seen corresponding path program 1 times [2025-03-04 15:26:10,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:10,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289201769] [2025-03-04 15:26:10,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:10,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:10,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:26:10,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:26:10,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:10,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:10,855 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 15:26:10,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:10,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289201769] [2025-03-04 15:26:10,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289201769] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:10,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:26:10,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:26:10,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911933283] [2025-03-04 15:26:10,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:10,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:26:10,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:10,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:26:10,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:26:10,881 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 60 [2025-03-04 15:26:10,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 84 transitions, 387 flow. Second operand has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 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:26:10,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:10,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 60 [2025-03-04 15:26:10,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:11,138 INFO L124 PetriNetUnfolderBase]: 1898/3774 cut-off events. [2025-03-04 15:26:11,139 INFO L125 PetriNetUnfolderBase]: For 1023/1031 co-relation queries the response was YES. [2025-03-04 15:26:11,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8166 conditions, 3774 events. 1898/3774 cut-off events. For 1023/1031 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 25171 event pairs, 1024 based on Foata normal form. 52/3685 useless extension candidates. Maximal degree in co-relation 8146. Up to 1823 conditions per place. [2025-03-04 15:26:11,155 INFO L140 encePairwiseOnDemand]: 54/60 looper letters, 106 selfloop transitions, 5 changer transitions 0/135 dead transitions. [2025-03-04 15:26:11,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 135 transitions, 811 flow [2025-03-04 15:26:11,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:26:11,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:26:11,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 205 transitions. [2025-03-04 15:26:11,157 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6833333333333333 [2025-03-04 15:26:11,157 INFO L175 Difference]: Start difference. First operand has 78 places, 84 transitions, 387 flow. Second operand 5 states and 205 transitions. [2025-03-04 15:26:11,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 135 transitions, 811 flow [2025-03-04 15:26:11,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 135 transitions, 810 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:26:11,162 INFO L231 Difference]: Finished difference. Result has 83 places, 86 transitions, 415 flow [2025-03-04 15:26:11,162 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=415, PETRI_PLACES=83, PETRI_TRANSITIONS=86} [2025-03-04 15:26:11,163 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 30 predicate places. [2025-03-04 15:26:11,163 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 86 transitions, 415 flow [2025-03-04 15:26:11,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 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:26:11,164 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:11,164 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:11,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 15:26:11,164 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 15:26:11,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:11,164 INFO L85 PathProgramCache]: Analyzing trace with hash 101850969, now seen corresponding path program 1 times [2025-03-04 15:26:11,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:11,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696419279] [2025-03-04 15:26:11,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:11,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:11,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:26:11,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:26:11,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:11,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:11,259 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:26:11,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:11,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696419279] [2025-03-04 15:26:11,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696419279] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:26:11,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863367364] [2025-03-04 15:26:11,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:11,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:11,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:26:11,261 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:26:11,263 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:26:11,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:26:11,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:26:11,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:11,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:11,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:26:11,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:26:11,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:26:11,360 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:26:11,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [863367364] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:11,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:26:11,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 6 [2025-03-04 15:26:11,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312303949] [2025-03-04 15:26:11,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:11,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:26:11,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:11,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:26:11,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:26:11,381 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 60 [2025-03-04 15:26:11,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 86 transitions, 415 flow. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 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:26:11,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:11,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 60 [2025-03-04 15:26:11,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:11,618 INFO L124 PetriNetUnfolderBase]: 1690/3482 cut-off events. [2025-03-04 15:26:11,618 INFO L125 PetriNetUnfolderBase]: For 1679/1727 co-relation queries the response was YES. [2025-03-04 15:26:11,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7457 conditions, 3482 events. 1690/3482 cut-off events. For 1679/1727 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 23189 event pairs, 944 based on Foata normal form. 158/3415 useless extension candidates. Maximal degree in co-relation 7434. Up to 2287 conditions per place. [2025-03-04 15:26:11,637 INFO L140 encePairwiseOnDemand]: 56/60 looper letters, 53 selfloop transitions, 6 changer transitions 0/82 dead transitions. [2025-03-04 15:26:11,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 82 transitions, 507 flow [2025-03-04 15:26:11,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:26:11,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:26:11,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2025-03-04 15:26:11,639 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2025-03-04 15:26:11,639 INFO L175 Difference]: Start difference. First operand has 83 places, 86 transitions, 415 flow. Second operand 4 states and 136 transitions. [2025-03-04 15:26:11,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 82 transitions, 507 flow [2025-03-04 15:26:11,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 82 transitions, 497 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 15:26:11,644 INFO L231 Difference]: Finished difference. Result has 79 places, 82 transitions, 391 flow [2025-03-04 15:26:11,645 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=379, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=391, PETRI_PLACES=79, PETRI_TRANSITIONS=82} [2025-03-04 15:26:11,646 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 26 predicate places. [2025-03-04 15:26:11,646 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 82 transitions, 391 flow [2025-03-04 15:26:11,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 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:26:11,646 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:11,646 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:11,653 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:26:11,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:11,851 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 15:26:11,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:11,851 INFO L85 PathProgramCache]: Analyzing trace with hash 22670163, now seen corresponding path program 1 times [2025-03-04 15:26:11,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:11,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840084517] [2025-03-04 15:26:11,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:11,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:11,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:26:11,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:26:11,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:11,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:11,917 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 15:26:11,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:11,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840084517] [2025-03-04 15:26:11,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840084517] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:11,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:26:11,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:26:11,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446179416] [2025-03-04 15:26:11,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:11,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:26:11,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:11,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:26:11,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:26:11,952 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 60 [2025-03-04 15:26:11,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 82 transitions, 391 flow. Second operand has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 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:26:11,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:11,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 60 [2025-03-04 15:26:11,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:12,169 INFO L124 PetriNetUnfolderBase]: 1536/3030 cut-off events. [2025-03-04 15:26:12,169 INFO L125 PetriNetUnfolderBase]: For 1109/1163 co-relation queries the response was YES. [2025-03-04 15:26:12,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6738 conditions, 3030 events. 1536/3030 cut-off events. For 1109/1163 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 18872 event pairs, 886 based on Foata normal form. 34/2898 useless extension candidates. Maximal degree in co-relation 6718. Up to 1833 conditions per place. [2025-03-04 15:26:12,182 INFO L140 encePairwiseOnDemand]: 54/60 looper letters, 67 selfloop transitions, 3 changer transitions 29/119 dead transitions. [2025-03-04 15:26:12,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 119 transitions, 740 flow [2025-03-04 15:26:12,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:26:12,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:26:12,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 196 transitions. [2025-03-04 15:26:12,183 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6533333333333333 [2025-03-04 15:26:12,183 INFO L175 Difference]: Start difference. First operand has 79 places, 82 transitions, 391 flow. Second operand 5 states and 196 transitions. [2025-03-04 15:26:12,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 119 transitions, 740 flow [2025-03-04 15:26:12,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 119 transitions, 733 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:26:12,187 INFO L231 Difference]: Finished difference. Result has 83 places, 80 transitions, 381 flow [2025-03-04 15:26:12,187 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=381, PETRI_PLACES=83, PETRI_TRANSITIONS=80} [2025-03-04 15:26:12,189 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 30 predicate places. [2025-03-04 15:26:12,189 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 80 transitions, 381 flow [2025-03-04 15:26:12,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 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:26:12,190 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:12,190 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1] [2025-03-04 15:26:12,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 15:26:12,190 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 15:26:12,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:12,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1031529492, now seen corresponding path program 2 times [2025-03-04 15:26:12,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:12,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260410459] [2025-03-04 15:26:12,190 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:26:12,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:12,199 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 15:26:12,208 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-03-04 15:26:12,209 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:26:12,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:12,235 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:26:12,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:12,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260410459] [2025-03-04 15:26:12,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260410459] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:26:12,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456264954] [2025-03-04 15:26:12,236 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:26:12,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:12,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:26:12,238 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:26:12,240 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:26:12,285 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 15:26:12,293 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-03-04 15:26:12,293 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:26:12,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:12,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:26:12,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:26:12,330 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:26:12,330 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:26:12,348 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:26:12,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456264954] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:26:12,349 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:26:12,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 2 [2025-03-04 15:26:12,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549558495] [2025-03-04 15:26:12,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:26:12,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:26:12,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:12,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:26:12,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:26:12,359 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 60 [2025-03-04 15:26:12,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 80 transitions, 381 flow. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 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:26:12,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:12,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 60 [2025-03-04 15:26:12,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:12,548 INFO L124 PetriNetUnfolderBase]: 1298/2671 cut-off events. [2025-03-04 15:26:12,549 INFO L125 PetriNetUnfolderBase]: For 881/917 co-relation queries the response was YES. [2025-03-04 15:26:12,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5925 conditions, 2671 events. 1298/2671 cut-off events. For 881/917 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 16860 event pairs, 750 based on Foata normal form. 1/2529 useless extension candidates. Maximal degree in co-relation 5903. Up to 1802 conditions per place. [2025-03-04 15:26:12,561 INFO L140 encePairwiseOnDemand]: 55/60 looper letters, 43 selfloop transitions, 16 changer transitions 0/79 dead transitions. [2025-03-04 15:26:12,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 79 transitions, 489 flow [2025-03-04 15:26:12,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:26:12,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:26:12,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 128 transitions. [2025-03-04 15:26:12,563 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2025-03-04 15:26:12,563 INFO L175 Difference]: Start difference. First operand has 83 places, 80 transitions, 381 flow. Second operand 4 states and 128 transitions. [2025-03-04 15:26:12,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 79 transitions, 489 flow [2025-03-04 15:26:12,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 79 transitions, 476 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-03-04 15:26:12,568 INFO L231 Difference]: Finished difference. Result has 79 places, 79 transitions, 390 flow [2025-03-04 15:26:12,568 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=390, PETRI_PLACES=79, PETRI_TRANSITIONS=79} [2025-03-04 15:26:12,569 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 26 predicate places. [2025-03-04 15:26:12,569 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 79 transitions, 390 flow [2025-03-04 15:26:12,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 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:26:12,569 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:12,569 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:12,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 15:26:12,769 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:26:12,769 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 15:26:12,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:12,770 INFO L85 PathProgramCache]: Analyzing trace with hash 41236367, now seen corresponding path program 1 times [2025-03-04 15:26:12,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:12,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214892309] [2025-03-04 15:26:12,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:12,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:12,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:26:12,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:26:12,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:12,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:12,839 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:26:12,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:12,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214892309] [2025-03-04 15:26:12,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214892309] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:12,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:26:12,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 15:26:12,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146418217] [2025-03-04 15:26:12,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:12,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:26:12,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:12,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:26:12,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:26:12,876 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 60 [2025-03-04 15:26:12,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 79 transitions, 390 flow. Second operand has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 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:26:12,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:12,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 60 [2025-03-04 15:26:12,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:13,048 INFO L124 PetriNetUnfolderBase]: 1025/2084 cut-off events. [2025-03-04 15:26:13,049 INFO L125 PetriNetUnfolderBase]: For 662/664 co-relation queries the response was YES. [2025-03-04 15:26:13,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4547 conditions, 2084 events. 1025/2084 cut-off events. For 662/664 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 12076 event pairs, 585 based on Foata normal form. 26/2029 useless extension candidates. Maximal degree in co-relation 4527. Up to 1004 conditions per place. [2025-03-04 15:26:13,058 INFO L140 encePairwiseOnDemand]: 54/60 looper letters, 83 selfloop transitions, 9 changer transitions 4/115 dead transitions. [2025-03-04 15:26:13,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 115 transitions, 694 flow [2025-03-04 15:26:13,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:26:13,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:26:13,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 202 transitions. [2025-03-04 15:26:13,061 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6733333333333333 [2025-03-04 15:26:13,062 INFO L175 Difference]: Start difference. First operand has 79 places, 79 transitions, 390 flow. Second operand 5 states and 202 transitions. [2025-03-04 15:26:13,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 115 transitions, 694 flow [2025-03-04 15:26:13,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 115 transitions, 662 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:26:13,066 INFO L231 Difference]: Finished difference. Result has 82 places, 81 transitions, 397 flow [2025-03-04 15:26:13,066 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=397, PETRI_PLACES=82, PETRI_TRANSITIONS=81} [2025-03-04 15:26:13,067 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 29 predicate places. [2025-03-04 15:26:13,067 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 81 transitions, 397 flow [2025-03-04 15:26:13,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 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:26:13,067 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:13,068 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1] [2025-03-04 15:26:13,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 15:26:13,068 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 15:26:13,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:13,069 INFO L85 PathProgramCache]: Analyzing trace with hash -564740933, now seen corresponding path program 1 times [2025-03-04 15:26:13,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:13,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62504299] [2025-03-04 15:26:13,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:13,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:13,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:26:13,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:26:13,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:13,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:13,193 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:26:13,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:13,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62504299] [2025-03-04 15:26:13,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62504299] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:26:13,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239667284] [2025-03-04 15:26:13,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:13,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:13,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:26:13,196 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:26:13,198 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:26:13,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:26:13,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:26:13,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:13,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:13,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 15:26:13,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:26:13,289 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:26:13,289 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:26:13,406 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:26:13,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239667284] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:26:13,406 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:26:13,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2025-03-04 15:26:13,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972411689] [2025-03-04 15:26:13,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:26:13,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 15:26:13,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:13,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 15:26:13,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2025-03-04 15:26:13,434 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 60 [2025-03-04 15:26:13,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 81 transitions, 397 flow. Second operand has 24 states, 24 states have (on average 25.083333333333332) internal successors, (602), 24 states have internal predecessors, (602), 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:26:13,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:13,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 60 [2025-03-04 15:26:13,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:13,810 INFO L124 PetriNetUnfolderBase]: 959/2044 cut-off events. [2025-03-04 15:26:13,810 INFO L125 PetriNetUnfolderBase]: For 1055/1075 co-relation queries the response was YES. [2025-03-04 15:26:13,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4586 conditions, 2044 events. 959/2044 cut-off events. For 1055/1075 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 12007 event pairs, 555 based on Foata normal form. 22/1944 useless extension candidates. Maximal degree in co-relation 4565. Up to 1329 conditions per place. [2025-03-04 15:26:13,818 INFO L140 encePairwiseOnDemand]: 52/60 looper letters, 35 selfloop transitions, 61 changer transitions 0/117 dead transitions. [2025-03-04 15:26:13,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 117 transitions, 841 flow [2025-03-04 15:26:13,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 15:26:13,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-04 15:26:13,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 625 transitions. [2025-03-04 15:26:13,821 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4734848484848485 [2025-03-04 15:26:13,821 INFO L175 Difference]: Start difference. First operand has 82 places, 81 transitions, 397 flow. Second operand 22 states and 625 transitions. [2025-03-04 15:26:13,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 117 transitions, 841 flow [2025-03-04 15:26:13,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 117 transitions, 816 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:26:13,827 INFO L231 Difference]: Finished difference. Result has 107 places, 117 transitions, 792 flow [2025-03-04 15:26:13,827 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=792, PETRI_PLACES=107, PETRI_TRANSITIONS=117} [2025-03-04 15:26:13,828 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 54 predicate places. [2025-03-04 15:26:13,828 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 117 transitions, 792 flow [2025-03-04 15:26:13,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 25.083333333333332) internal successors, (602), 24 states have internal predecessors, (602), 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:26:13,828 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:13,829 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:13,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 15:26:14,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:14,029 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 15:26:14,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:14,030 INFO L85 PathProgramCache]: Analyzing trace with hash 260186479, now seen corresponding path program 1 times [2025-03-04 15:26:14,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:14,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252769697] [2025-03-04 15:26:14,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:14,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:14,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 15:26:14,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 15:26:14,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:14,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:14,100 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:26:14,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:14,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252769697] [2025-03-04 15:26:14,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252769697] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:14,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:26:14,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 15:26:14,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051452463] [2025-03-04 15:26:14,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:14,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:26:14,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:14,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:26:14,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:26:14,123 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 60 [2025-03-04 15:26:14,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 117 transitions, 792 flow. Second operand has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 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:26:14,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:14,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 60 [2025-03-04 15:26:14,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:14,247 INFO L124 PetriNetUnfolderBase]: 876/1825 cut-off events. [2025-03-04 15:26:14,248 INFO L125 PetriNetUnfolderBase]: For 1084/1100 co-relation queries the response was YES. [2025-03-04 15:26:14,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4335 conditions, 1825 events. 876/1825 cut-off events. For 1084/1100 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 10030 event pairs, 516 based on Foata normal form. 13/1759 useless extension candidates. Maximal degree in co-relation 4307. Up to 1052 conditions per place. [2025-03-04 15:26:14,253 INFO L140 encePairwiseOnDemand]: 54/60 looper letters, 83 selfloop transitions, 12 changer transitions 25/139 dead transitions. [2025-03-04 15:26:14,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 139 transitions, 1093 flow [2025-03-04 15:26:14,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:26:14,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:26:14,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 193 transitions. [2025-03-04 15:26:14,255 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6433333333333333 [2025-03-04 15:26:14,255 INFO L175 Difference]: Start difference. First operand has 107 places, 117 transitions, 792 flow. Second operand 5 states and 193 transitions. [2025-03-04 15:26:14,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 139 transitions, 1093 flow [2025-03-04 15:26:14,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 139 transitions, 937 flow, removed 47 selfloop flow, removed 9 redundant places. [2025-03-04 15:26:14,260 INFO L231 Difference]: Finished difference. Result has 104 places, 114 transitions, 640 flow [2025-03-04 15:26:14,260 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=640, PETRI_PLACES=104, PETRI_TRANSITIONS=114} [2025-03-04 15:26:14,260 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 51 predicate places. [2025-03-04 15:26:14,260 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 114 transitions, 640 flow [2025-03-04 15:26:14,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 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:26:14,261 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:14,261 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:14,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 15:26:14,261 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 15:26:14,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:14,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1182396059, now seen corresponding path program 1 times [2025-03-04 15:26:14,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:14,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203090120] [2025-03-04 15:26:14,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:14,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:14,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 15:26:14,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 15:26:14,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:14,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:14,330 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 15:26:14,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:14,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203090120] [2025-03-04 15:26:14,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203090120] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:26:14,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443782133] [2025-03-04 15:26:14,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:14,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:14,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:26:14,333 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:26:14,334 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:26:14,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 15:26:14,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 15:26:14,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:14,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:14,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 15:26:14,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:26:14,474 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:26:14,475 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:26:14,578 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:26:14,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [443782133] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:26:14,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:26:14,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2025-03-04 15:26:14,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169322330] [2025-03-04 15:26:14,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:26:14,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 15:26:14,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:14,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 15:26:14,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2025-03-04 15:26:14,938 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 60 [2025-03-04 15:26:14,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 114 transitions, 640 flow. Second operand has 19 states, 19 states have (on average 23.0) internal successors, (437), 19 states have internal predecessors, (437), 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:26:14,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:14,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 60 [2025-03-04 15:26:14,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:15,436 INFO L124 PetriNetUnfolderBase]: 1222/2377 cut-off events. [2025-03-04 15:26:15,436 INFO L125 PetriNetUnfolderBase]: For 1390/1436 co-relation queries the response was YES. [2025-03-04 15:26:15,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5748 conditions, 2377 events. 1222/2377 cut-off events. For 1390/1436 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 13768 event pairs, 368 based on Foata normal form. 52/2335 useless extension candidates. Maximal degree in co-relation 5719. Up to 496 conditions per place. [2025-03-04 15:26:15,446 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 147 selfloop transitions, 67 changer transitions 10/240 dead transitions. [2025-03-04 15:26:15,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 240 transitions, 1522 flow [2025-03-04 15:26:15,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 15:26:15,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 15:26:15,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 448 transitions. [2025-03-04 15:26:15,448 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2025-03-04 15:26:15,448 INFO L175 Difference]: Start difference. First operand has 104 places, 114 transitions, 640 flow. Second operand 14 states and 448 transitions. [2025-03-04 15:26:15,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 240 transitions, 1522 flow [2025-03-04 15:26:15,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 240 transitions, 1446 flow, removed 26 selfloop flow, removed 6 redundant places. [2025-03-04 15:26:15,457 INFO L231 Difference]: Finished difference. Result has 106 places, 118 transitions, 762 flow [2025-03-04 15:26:15,457 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=600, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=762, PETRI_PLACES=106, PETRI_TRANSITIONS=118} [2025-03-04 15:26:15,457 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 53 predicate places. [2025-03-04 15:26:15,457 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 118 transitions, 762 flow [2025-03-04 15:26:15,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 23.0) internal successors, (437), 19 states have internal predecessors, (437), 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:26:15,458 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:15,458 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:15,464 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:26:15,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:15,658 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 15:26:15,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:15,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1170464197, now seen corresponding path program 1 times [2025-03-04 15:26:15,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:15,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239765638] [2025-03-04 15:26:15,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:15,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:15,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 15:26:15,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 15:26:15,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:15,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:15,712 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 15:26:15,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:15,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239765638] [2025-03-04 15:26:15,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239765638] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:26:15,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328981961] [2025-03-04 15:26:15,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:15,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:15,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:26:15,715 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:26:15,716 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:26:15,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 15:26:15,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 15:26:15,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:15,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:15,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 15:26:15,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:26:15,855 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:26:15,855 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:26:15,946 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:26:15,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328981961] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:26:15,946 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:26:15,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2025-03-04 15:26:15,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494232325] [2025-03-04 15:26:15,947 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:26:15,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 15:26:15,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:15,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 15:26:15,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2025-03-04 15:26:16,231 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 60 [2025-03-04 15:26:16,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 118 transitions, 762 flow. Second operand has 19 states, 19 states have (on average 23.210526315789473) internal successors, (441), 19 states have internal predecessors, (441), 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:26:16,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:16,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 60 [2025-03-04 15:26:16,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:16,704 INFO L124 PetriNetUnfolderBase]: 1122/2189 cut-off events. [2025-03-04 15:26:16,705 INFO L125 PetriNetUnfolderBase]: For 1575/1587 co-relation queries the response was YES. [2025-03-04 15:26:16,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5337 conditions, 2189 events. 1122/2189 cut-off events. For 1575/1587 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 12346 event pairs, 350 based on Foata normal form. 44/2125 useless extension candidates. Maximal degree in co-relation 5311. Up to 515 conditions per place. [2025-03-04 15:26:16,712 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 89 selfloop transitions, 61 changer transitions 61/226 dead transitions. [2025-03-04 15:26:16,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 226 transitions, 1582 flow [2025-03-04 15:26:16,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 15:26:16,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 15:26:16,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 441 transitions. [2025-03-04 15:26:16,713 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.525 [2025-03-04 15:26:16,713 INFO L175 Difference]: Start difference. First operand has 106 places, 118 transitions, 762 flow. Second operand 14 states and 441 transitions. [2025-03-04 15:26:16,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 226 transitions, 1582 flow [2025-03-04 15:26:16,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 226 transitions, 1498 flow, removed 7 selfloop flow, removed 4 redundant places. [2025-03-04 15:26:16,719 INFO L231 Difference]: Finished difference. Result has 115 places, 111 transitions, 815 flow [2025-03-04 15:26:16,719 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=724, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=815, PETRI_PLACES=115, PETRI_TRANSITIONS=111} [2025-03-04 15:26:16,719 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 62 predicate places. [2025-03-04 15:26:16,719 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 111 transitions, 815 flow [2025-03-04 15:26:16,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 23.210526315789473) internal successors, (441), 19 states have internal predecessors, (441), 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:26:16,719 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:16,719 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:16,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 15:26:16,920 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,SelfDestructingSolverStorable16 [2025-03-04 15:26:16,920 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 15:26:16,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:16,920 INFO L85 PathProgramCache]: Analyzing trace with hash 603986928, now seen corresponding path program 1 times [2025-03-04 15:26:16,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:16,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990553954] [2025-03-04 15:26:16,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:16,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:16,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 15:26:16,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 15:26:16,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:16,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:16,975 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 15:26:16,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:16,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990553954] [2025-03-04 15:26:16,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990553954] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:26:16,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1208533134] [2025-03-04 15:26:16,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:16,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:16,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:26:16,978 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:26:16,979 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:26:17,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 15:26:17,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 15:26:17,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:17,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:17,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 15:26:17,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:26:17,108 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 15:26:17,109 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:26:17,194 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 15:26:17,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1208533134] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:26:17,194 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:26:17,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 19 [2025-03-04 15:26:17,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829971019] [2025-03-04 15:26:17,194 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:26:17,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 15:26:17,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:17,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 15:26:17,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2025-03-04 15:26:17,514 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 60 [2025-03-04 15:26:17,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 111 transitions, 815 flow. Second operand has 19 states, 19 states have (on average 23.157894736842106) internal successors, (440), 19 states have internal predecessors, (440), 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:26:17,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:17,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 60 [2025-03-04 15:26:17,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:17,976 INFO L124 PetriNetUnfolderBase]: 1398/2657 cut-off events. [2025-03-04 15:26:17,976 INFO L125 PetriNetUnfolderBase]: For 2330/2348 co-relation queries the response was YES. [2025-03-04 15:26:17,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6892 conditions, 2657 events. 1398/2657 cut-off events. For 2330/2348 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 14784 event pairs, 492 based on Foata normal form. 52/2633 useless extension candidates. Maximal degree in co-relation 6865. Up to 798 conditions per place. [2025-03-04 15:26:17,984 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 193 selfloop transitions, 61 changer transitions 10/279 dead transitions. [2025-03-04 15:26:17,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 279 transitions, 2200 flow [2025-03-04 15:26:17,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 15:26:17,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-04 15:26:17,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 525 transitions. [2025-03-04 15:26:17,985 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5147058823529411 [2025-03-04 15:26:17,985 INFO L175 Difference]: Start difference. First operand has 115 places, 111 transitions, 815 flow. Second operand 17 states and 525 transitions. [2025-03-04 15:26:17,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 279 transitions, 2200 flow [2025-03-04 15:26:17,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 279 transitions, 2014 flow, removed 23 selfloop flow, removed 9 redundant places. [2025-03-04 15:26:17,993 INFO L231 Difference]: Finished difference. Result has 119 places, 144 transitions, 1287 flow [2025-03-04 15:26:17,993 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=743, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1287, PETRI_PLACES=119, PETRI_TRANSITIONS=144} [2025-03-04 15:26:17,993 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 66 predicate places. [2025-03-04 15:26:17,993 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 144 transitions, 1287 flow [2025-03-04 15:26:17,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 23.157894736842106) internal successors, (440), 19 states have internal predecessors, (440), 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:26:17,993 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:17,994 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:18,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 15:26:18,194 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,SelfDestructingSolverStorable17 [2025-03-04 15:26:18,194 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 15:26:18,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:18,195 INFO L85 PathProgramCache]: Analyzing trace with hash -25723357, now seen corresponding path program 1 times [2025-03-04 15:26:18,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:18,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561695942] [2025-03-04 15:26:18,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:18,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:18,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 15:26:18,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 15:26:18,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:18,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:18,254 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 15:26:18,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:18,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561695942] [2025-03-04 15:26:18,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561695942] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:26:18,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865534701] [2025-03-04 15:26:18,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:18,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:18,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:26:18,257 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:26:18,258 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:26:18,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 15:26:18,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 15:26:18,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:18,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:18,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 15:26:18,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:26:18,422 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 15:26:18,422 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:26:18,510 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 15:26:18,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1865534701] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:26:18,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:26:18,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 19 [2025-03-04 15:26:18,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631532918] [2025-03-04 15:26:18,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:26:18,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 15:26:18,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:18,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 15:26:18,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2025-03-04 15:26:18,769 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 60 [2025-03-04 15:26:18,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 144 transitions, 1287 flow. Second operand has 19 states, 19 states have (on average 23.36842105263158) internal successors, (444), 19 states have internal predecessors, (444), 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:26:18,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:18,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 60 [2025-03-04 15:26:18,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:19,196 INFO L124 PetriNetUnfolderBase]: 1566/2953 cut-off events. [2025-03-04 15:26:19,196 INFO L125 PetriNetUnfolderBase]: For 3329/3361 co-relation queries the response was YES. [2025-03-04 15:26:19,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7745 conditions, 2953 events. 1566/2953 cut-off events. For 3329/3361 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 16066 event pairs, 567 based on Foata normal form. 52/2903 useless extension candidates. Maximal degree in co-relation 7714. Up to 1034 conditions per place. [2025-03-04 15:26:19,205 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 136 selfloop transitions, 56 changer transitions 69/277 dead transitions. [2025-03-04 15:26:19,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 277 transitions, 2393 flow [2025-03-04 15:26:19,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 15:26:19,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-04 15:26:19,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 518 transitions. [2025-03-04 15:26:19,206 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5078431372549019 [2025-03-04 15:26:19,206 INFO L175 Difference]: Start difference. First operand has 119 places, 144 transitions, 1287 flow. Second operand 17 states and 518 transitions. [2025-03-04 15:26:19,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 277 transitions, 2393 flow [2025-03-04 15:26:19,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 277 transitions, 2309 flow, removed 10 selfloop flow, removed 5 redundant places. [2025-03-04 15:26:19,214 INFO L231 Difference]: Finished difference. Result has 133 places, 142 transitions, 1359 flow [2025-03-04 15:26:19,215 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1247, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1359, PETRI_PLACES=133, PETRI_TRANSITIONS=142} [2025-03-04 15:26:19,215 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 80 predicate places. [2025-03-04 15:26:19,215 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 142 transitions, 1359 flow [2025-03-04 15:26:19,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 23.36842105263158) internal successors, (444), 19 states have internal predecessors, (444), 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:26:19,215 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:19,215 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:19,221 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 15:26:19,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:19,416 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 15:26:19,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:19,416 INFO L85 PathProgramCache]: Analyzing trace with hash 2055573652, now seen corresponding path program 2 times [2025-03-04 15:26:19,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:19,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319116979] [2025-03-04 15:26:19,417 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:26:19,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:19,422 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-04 15:26:19,425 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 30 statements. [2025-03-04 15:26:19,425 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:26:19,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:19,450 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 15:26:19,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:19,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319116979] [2025-03-04 15:26:19,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319116979] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:26:19,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572892235] [2025-03-04 15:26:19,450 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:26:19,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:19,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:26:19,454 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:26:19,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 15:26:19,503 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-04 15:26:19,515 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 30 statements. [2025-03-04 15:26:19,515 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:26:19,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:19,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:26:19,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:26:19,550 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 15:26:19,550 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:26:19,588 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 15:26:19,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1572892235] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:26:19,588 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:26:19,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2025-03-04 15:26:19,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795235993] [2025-03-04 15:26:19,588 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:26:19,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:26:19,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:19,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:26:19,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:26:19,620 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 60 [2025-03-04 15:26:19,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 142 transitions, 1359 flow. Second operand has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 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:26:19,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:19,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 60 [2025-03-04 15:26:19,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:19,789 INFO L124 PetriNetUnfolderBase]: 1261/2372 cut-off events. [2025-03-04 15:26:19,789 INFO L125 PetriNetUnfolderBase]: For 3690/3702 co-relation queries the response was YES. [2025-03-04 15:26:19,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6977 conditions, 2372 events. 1261/2372 cut-off events. For 3690/3702 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 12131 event pairs, 358 based on Foata normal form. 34/2357 useless extension candidates. Maximal degree in co-relation 6943. Up to 1059 conditions per place. [2025-03-04 15:26:19,798 INFO L140 encePairwiseOnDemand]: 53/60 looper letters, 140 selfloop transitions, 12 changer transitions 7/176 dead transitions. [2025-03-04 15:26:19,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 176 transitions, 1841 flow [2025-03-04 15:26:19,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:26:19,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:26:19,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 163 transitions. [2025-03-04 15:26:19,799 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5433333333333333 [2025-03-04 15:26:19,799 INFO L175 Difference]: Start difference. First operand has 133 places, 142 transitions, 1359 flow. Second operand 5 states and 163 transitions. [2025-03-04 15:26:19,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 176 transitions, 1841 flow [2025-03-04 15:26:19,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 176 transitions, 1744 flow, removed 13 selfloop flow, removed 14 redundant places. [2025-03-04 15:26:19,808 INFO L231 Difference]: Finished difference. Result has 118 places, 143 transitions, 1339 flow [2025-03-04 15:26:19,808 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1278, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1339, PETRI_PLACES=118, PETRI_TRANSITIONS=143} [2025-03-04 15:26:19,808 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 65 predicate places. [2025-03-04 15:26:19,808 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 143 transitions, 1339 flow [2025-03-04 15:26:19,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 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:26:19,808 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:19,809 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:19,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-04 15:26:20,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:20,009 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 15:26:20,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:20,010 INFO L85 PathProgramCache]: Analyzing trace with hash 570983080, now seen corresponding path program 2 times [2025-03-04 15:26:20,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:20,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383657870] [2025-03-04 15:26:20,010 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:26:20,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:20,015 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-04 15:26:20,018 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 32 statements. [2025-03-04 15:26:20,018 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:26:20,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:20,062 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 15:26:20,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:20,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383657870] [2025-03-04 15:26:20,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383657870] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:26:20,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919089188] [2025-03-04 15:26:20,064 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:26:20,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:20,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:26:20,066 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:26:20,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 15:26:20,117 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-04 15:26:20,128 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 32 statements. [2025-03-04 15:26:20,128 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:26:20,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:20,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:26:20,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:26:20,161 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 15:26:20,162 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:26:20,223 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 15:26:20,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [919089188] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:26:20,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:26:20,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2025-03-04 15:26:20,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074529581] [2025-03-04 15:26:20,223 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:26:20,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:26:20,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:20,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:26:20,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:26:20,254 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 60 [2025-03-04 15:26:20,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 143 transitions, 1339 flow. Second operand has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 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:26:20,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:20,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 60 [2025-03-04 15:26:20,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:20,431 INFO L124 PetriNetUnfolderBase]: 1197/2244 cut-off events. [2025-03-04 15:26:20,431 INFO L125 PetriNetUnfolderBase]: For 4184/4206 co-relation queries the response was YES. [2025-03-04 15:26:20,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6871 conditions, 2244 events. 1197/2244 cut-off events. For 4184/4206 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 11318 event pairs, 331 based on Foata normal form. 55/2254 useless extension candidates. Maximal degree in co-relation 6839. Up to 994 conditions per place. [2025-03-04 15:26:20,438 INFO L140 encePairwiseOnDemand]: 53/60 looper letters, 80 selfloop transitions, 1 changer transitions 93/177 dead transitions. [2025-03-04 15:26:20,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 177 transitions, 1848 flow [2025-03-04 15:26:20,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:26:20,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:26:20,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 160 transitions. [2025-03-04 15:26:20,445 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2025-03-04 15:26:20,445 INFO L175 Difference]: Start difference. First operand has 118 places, 143 transitions, 1339 flow. Second operand 5 states and 160 transitions. [2025-03-04 15:26:20,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 177 transitions, 1848 flow [2025-03-04 15:26:20,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 177 transitions, 1825 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-03-04 15:26:20,454 INFO L231 Difference]: Finished difference. Result has 117 places, 84 transitions, 1045 flow [2025-03-04 15:26:20,454 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1322, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1045, PETRI_PLACES=117, PETRI_TRANSITIONS=84} [2025-03-04 15:26:20,455 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 64 predicate places. [2025-03-04 15:26:20,455 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 84 transitions, 1045 flow [2025-03-04 15:26:20,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 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:26:20,455 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:20,455 INFO L206 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1] [2025-03-04 15:26:20,461 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 15:26:20,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-04 15:26:20,656 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 15:26:20,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:20,656 INFO L85 PathProgramCache]: Analyzing trace with hash 918934651, now seen corresponding path program 2 times [2025-03-04 15:26:20,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:20,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316440512] [2025-03-04 15:26:20,656 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:26:20,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:20,665 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-03-04 15:26:20,668 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 35 statements. [2025-03-04 15:26:20,668 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:26:20,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:20,699 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 15:26:20,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:20,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316440512] [2025-03-04 15:26:20,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316440512] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:26:20,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299963751] [2025-03-04 15:26:20,699 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:26:20,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:20,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:26:20,701 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:26:20,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 15:26:20,761 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-03-04 15:26:20,771 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 35 statements. [2025-03-04 15:26:20,771 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:26:20,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:20,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:26:20,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:26:20,806 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 15:26:20,806 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:26:20,843 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 15:26:20,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [299963751] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:26:20,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:26:20,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-03-04 15:26:20,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505120763] [2025-03-04 15:26:20,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:26:20,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:26:20,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:20,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:26:20,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:26:20,875 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 60 [2025-03-04 15:26:20,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 84 transitions, 1045 flow. Second operand has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 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:26:20,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:20,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 60 [2025-03-04 15:26:20,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:20,899 INFO L124 PetriNetUnfolderBase]: 12/144 cut-off events. [2025-03-04 15:26:20,899 INFO L125 PetriNetUnfolderBase]: For 731/731 co-relation queries the response was YES. [2025-03-04 15:26:20,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 789 conditions, 144 events. 12/144 cut-off events. For 731/731 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 357 event pairs, 0 based on Foata normal form. 3/147 useless extension candidates. Maximal degree in co-relation 764. Up to 56 conditions per place. [2025-03-04 15:26:20,900 INFO L140 encePairwiseOnDemand]: 54/60 looper letters, 0 selfloop transitions, 0 changer transitions 83/83 dead transitions. [2025-03-04 15:26:20,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 83 transitions, 1185 flow [2025-03-04 15:26:20,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:26:20,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:26:20,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2025-03-04 15:26:20,901 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42916666666666664 [2025-03-04 15:26:20,901 INFO L175 Difference]: Start difference. First operand has 117 places, 84 transitions, 1045 flow. Second operand 4 states and 103 transitions. [2025-03-04 15:26:20,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 83 transitions, 1185 flow [2025-03-04 15:26:20,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 83 transitions, 1000 flow, removed 3 selfloop flow, removed 14 redundant places. [2025-03-04 15:26:20,904 INFO L231 Difference]: Finished difference. Result has 60 places, 0 transitions, 0 flow [2025-03-04 15:26:20,904 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=838, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=60, PETRI_TRANSITIONS=0} [2025-03-04 15:26:20,904 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 7 predicate places. [2025-03-04 15:26:20,905 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 0 transitions, 0 flow [2025-03-04 15:26:20,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 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:26:20,907 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 22 remaining) [2025-03-04 15:26:20,907 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 22 remaining) [2025-03-04 15:26:20,907 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 22 remaining) [2025-03-04 15:26:20,907 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 22 remaining) [2025-03-04 15:26:20,907 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 22 remaining) [2025-03-04 15:26:20,907 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 22 remaining) [2025-03-04 15:26:20,907 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 22 remaining) [2025-03-04 15:26:20,907 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 22 remaining) [2025-03-04 15:26:20,907 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 22 remaining) [2025-03-04 15:26:20,907 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 22 remaining) [2025-03-04 15:26:20,907 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 22 remaining) [2025-03-04 15:26:20,908 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 22 remaining) [2025-03-04 15:26:20,908 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 22 remaining) [2025-03-04 15:26:20,908 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 22 remaining) [2025-03-04 15:26:20,908 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 22 remaining) [2025-03-04 15:26:20,908 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 22 remaining) [2025-03-04 15:26:20,908 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 22 remaining) [2025-03-04 15:26:20,908 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 22 remaining) [2025-03-04 15:26:20,908 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 22 remaining) [2025-03-04 15:26:20,908 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 22 remaining) [2025-03-04 15:26:20,908 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 22 remaining) [2025-03-04 15:26:20,908 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 22 remaining) [2025-03-04 15:26:20,914 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-04 15:26:21,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-04 15:26:21,109 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:21,113 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 15:26:21,113 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 15:26:21,118 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 03:26:21 BasicIcfg [2025-03-04 15:26:21,121 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 15:26:21,121 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 15:26:21,121 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 15:26:21,121 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 15:26:21,122 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:26:06" (3/4) ... [2025-03-04 15:26:21,123 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 15:26:21,124 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-04 15:26:21,124 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-04 15:26:21,132 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 103 nodes and edges [2025-03-04 15:26:21,132 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 42 nodes and edges [2025-03-04 15:26:21,133 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2025-03-04 15:26:21,133 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-04 15:26:21,196 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 15:26:21,197 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 15:26:21,197 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 15:26:21,197 INFO L158 Benchmark]: Toolchain (without parser) took 15597.02ms. Allocated memory was 167.8MB in the beginning and 436.2MB in the end (delta: 268.4MB). Free memory was 123.5MB in the beginning and 264.2MB in the end (delta: -140.7MB). Peak memory consumption was 127.7MB. Max. memory is 16.1GB. [2025-03-04 15:26:21,198 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 116.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:26:21,198 INFO L158 Benchmark]: CACSL2BoogieTranslator took 221.52ms. Allocated memory is still 167.8MB. Free memory was 123.5MB in the beginning and 111.1MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:26:21,199 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.81ms. Allocated memory is still 167.8MB. Free memory was 111.1MB in the beginning and 109.5MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:26:21,199 INFO L158 Benchmark]: Boogie Preprocessor took 54.47ms. Allocated memory is still 167.8MB. Free memory was 109.5MB in the beginning and 108.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:26:21,199 INFO L158 Benchmark]: IcfgBuilder took 614.33ms. Allocated memory is still 167.8MB. Free memory was 108.0MB in the beginning and 58.4MB in the end (delta: 49.6MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-03-04 15:26:21,199 INFO L158 Benchmark]: TraceAbstraction took 14592.59ms. Allocated memory was 167.8MB in the beginning and 436.2MB in the end (delta: 268.4MB). Free memory was 58.4MB in the beginning and 272.6MB in the end (delta: -214.2MB). Peak memory consumption was 52.2MB. Max. memory is 16.1GB. [2025-03-04 15:26:21,200 INFO L158 Benchmark]: Witness Printer took 75.43ms. Allocated memory is still 436.2MB. Free memory was 272.6MB in the beginning and 264.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:26:21,201 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.16ms. Allocated memory is still 201.3MB. Free memory is still 116.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 221.52ms. Allocated memory is still 167.8MB. Free memory was 123.5MB in the beginning and 111.1MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.81ms. Allocated memory is still 167.8MB. Free memory was 111.1MB in the beginning and 109.5MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.47ms. Allocated memory is still 167.8MB. Free memory was 109.5MB in the beginning and 108.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 614.33ms. Allocated memory is still 167.8MB. Free memory was 108.0MB in the beginning and 58.4MB in the end (delta: 49.6MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 14592.59ms. Allocated memory was 167.8MB in the beginning and 436.2MB in the end (delta: 268.4MB). Free memory was 58.4MB in the beginning and 272.6MB in the end (delta: -214.2MB). Peak memory consumption was 52.2MB. Max. memory is 16.1GB. * Witness Printer took 75.43ms. Allocated memory is still 436.2MB. Free memory was 272.6MB in the beginning and 264.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 69]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 77]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 69]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 77]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 115]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 115]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 115]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 115]: 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 5 procedures, 85 locations, 22 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: 14.5s, OverallIterations: 22, TraceHistogramMax: 11, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2840 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2520 mSDsluCounter, 1893 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1769 mSDsCounter, 171 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9781 IncrementalHoareTripleChecker+Invalid, 9952 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 171 mSolverCounterUnsat, 124 mSDtfsCounter, 9781 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 610 GetRequests, 389 SyntacticMatches, 11 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 670 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1359occurred in iteration=19, InterpolantAutomatonStates: 166, 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.3s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 622 NumberOfCodeBlocks, 458 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 802 ConstructedInterpolants, 0 QuantifiedInterpolants, 2601 SizeOfPredicates, 49 NumberOfNonLiveVariables, 1728 ConjunctsInSsa, 91 ConjunctsInUnsatCore, 45 InterpolantComputations, 12 PerfectInterpolantSequences, 683/928 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 12 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 15:26:21,216 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