./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/popl20-more-vector-add.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-more-vector-add.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 63e73d2abe89b782ca9e5c579baa72b5461ffc3c60c322f6f03d18cdd5548702 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:29:44,741 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:29:44,792 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:29:44,798 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:29:44,798 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:29:44,813 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:29:44,815 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:29:44,815 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:29:44,816 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:29:44,816 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:29:44,816 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:29:44,817 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:29:44,817 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:29:44,817 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:29:44,817 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:29:44,818 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:29:44,818 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:29:44,818 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:29:44,818 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:29:44,818 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:29:44,818 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:29:44,818 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:29:44,818 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:29:44,819 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:29:44,819 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:29:44,819 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:29:44,819 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:29:44,819 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:29:44,819 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:29:44,819 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:29:44,819 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:29:44,819 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:29:44,819 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:29:44,819 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:29:44,819 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:29:44,820 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:29:44,820 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:29:44,820 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:29:44,820 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:29:44,820 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:29:44,820 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:29:44,820 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:29:44,820 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:29:44,820 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:29:44,820 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:29:44,820 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 -> 63e73d2abe89b782ca9e5c579baa72b5461ffc3c60c322f6f03d18cdd5548702 [2025-03-04 15:29:45,049 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:29:45,055 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:29:45,056 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:29:45,058 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:29:45,058 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:29:45,060 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-vector-add.wvr.c [2025-03-04 15:29:46,191 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b50536f7c/3a9ec9fbc01a4e118b469a1e4e02517b/FLAG606432a75 [2025-03-04 15:29:46,452 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:29:46,454 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-vector-add.wvr.c [2025-03-04 15:29:46,462 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b50536f7c/3a9ec9fbc01a4e118b469a1e4e02517b/FLAG606432a75 [2025-03-04 15:29:46,765 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b50536f7c/3a9ec9fbc01a4e118b469a1e4e02517b [2025-03-04 15:29:46,766 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:29:46,768 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:29:46,769 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:29:46,769 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:29:46,773 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:29:46,774 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:29:46" (1/1) ... [2025-03-04 15:29:46,774 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79273220 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:46, skipping insertion in model container [2025-03-04 15:29:46,775 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:29:46" (1/1) ... [2025-03-04 15:29:46,787 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:29:46,927 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:29:46,935 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:29:46,959 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:29:46,971 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:29:46,972 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:46 WrapperNode [2025-03-04 15:29:46,972 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:29:46,973 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:29:46,973 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:29:46,974 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:29:46,978 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:46" (1/1) ... [2025-03-04 15:29:46,984 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:46" (1/1) ... [2025-03-04 15:29:47,003 INFO L138 Inliner]: procedures = 24, calls = 32, calls flagged for inlining = 12, calls inlined = 18, statements flattened = 183 [2025-03-04 15:29:47,006 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:29:47,006 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:29:47,006 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:29:47,006 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:29:47,012 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:46" (1/1) ... [2025-03-04 15:29:47,012 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:46" (1/1) ... [2025-03-04 15:29:47,014 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:46" (1/1) ... [2025-03-04 15:29:47,035 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [2, 15]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 7 writes are split as follows [0, 7]. [2025-03-04 15:29:47,035 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:46" (1/1) ... [2025-03-04 15:29:47,035 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:46" (1/1) ... [2025-03-04 15:29:47,043 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:46" (1/1) ... [2025-03-04 15:29:47,044 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:46" (1/1) ... [2025-03-04 15:29:47,045 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:46" (1/1) ... [2025-03-04 15:29:47,046 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:46" (1/1) ... [2025-03-04 15:29:47,047 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:29:47,048 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:29:47,048 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:29:47,048 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:29:47,049 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:46" (1/1) ... [2025-03-04 15:29:47,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:29:47,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:47,071 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 15:29:47,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 15:29:47,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:29:47,091 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 15:29:47,091 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 15:29:47,091 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 15:29:47,091 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 15:29:47,091 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 15:29:47,091 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 15:29:47,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:29:47,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 15:29:47,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:29:47,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:29:47,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 15:29:47,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:29:47,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:29:47,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:29:47,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:29:47,092 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 15:29:47,166 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:29:47,168 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:29:47,471 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:29:47,471 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:29:47,716 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:29:47,717 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:29:47,717 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:29:47 BoogieIcfgContainer [2025-03-04 15:29:47,717 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:29:47,719 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:29:47,719 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:29:47,722 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:29:47,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:29:46" (1/3) ... [2025-03-04 15:29:47,723 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ad7a141 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:29:47, skipping insertion in model container [2025-03-04 15:29:47,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:46" (2/3) ... [2025-03-04 15:29:47,724 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ad7a141 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:29:47, skipping insertion in model container [2025-03-04 15:29:47,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:29:47" (3/3) ... [2025-03-04 15:29:47,725 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-vector-add.wvr.c [2025-03-04 15:29:47,739 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:29:47,741 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-vector-add.wvr.c that has 4 procedures, 53 locations, 1 initial locations, 7 loop locations, and 14 error locations. [2025-03-04 15:29:47,741 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:29:47,787 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 15:29:47,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 59 transitions, 139 flow [2025-03-04 15:29:47,836 INFO L124 PetriNetUnfolderBase]: 7/56 cut-off events. [2025-03-04 15:29:47,840 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 15:29:47,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 56 events. 7/56 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 135 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2025-03-04 15:29:47,845 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 59 transitions, 139 flow [2025-03-04 15:29:47,847 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 54 transitions, 123 flow [2025-03-04 15:29:47,853 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:29:47,863 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;@f4cbc02, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:29:47,864 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-03-04 15:29:47,867 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:29:47,868 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-03-04 15:29:47,868 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:29:47,868 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:47,869 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 15:29:47,869 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-04 15:29:47,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:47,874 INFO L85 PathProgramCache]: Analyzing trace with hash 646736, now seen corresponding path program 1 times [2025-03-04 15:29:47,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:47,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547514205] [2025-03-04 15:29:47,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:47,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:47,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:29:47,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:29:47,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:47,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:48,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:48,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:48,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547514205] [2025-03-04 15:29:48,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547514205] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:29:48,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:29:48,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:29:48,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750894310] [2025-03-04 15:29:48,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:29:48,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:29:48,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:48,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:29:48,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:29:48,104 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 59 [2025-03-04 15:29:48,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 54 transitions, 123 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:48,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:48,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 59 [2025-03-04 15:29:48,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:48,323 INFO L124 PetriNetUnfolderBase]: 437/799 cut-off events. [2025-03-04 15:29:48,323 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2025-03-04 15:29:48,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1516 conditions, 799 events. 437/799 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3641 event pairs, 306 based on Foata normal form. 4/611 useless extension candidates. Maximal degree in co-relation 1301. Up to 640 conditions per place. [2025-03-04 15:29:48,330 INFO L140 encePairwiseOnDemand]: 38/59 looper letters, 40 selfloop transitions, 13 changer transitions 0/66 dead transitions. [2025-03-04 15:29:48,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 66 transitions, 253 flow [2025-03-04 15:29:48,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:29:48,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:29:48,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 125 transitions. [2025-03-04 15:29:48,341 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5296610169491526 [2025-03-04 15:29:48,342 INFO L175 Difference]: Start difference. First operand has 57 places, 54 transitions, 123 flow. Second operand 4 states and 125 transitions. [2025-03-04 15:29:48,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 66 transitions, 253 flow [2025-03-04 15:29:48,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 66 transitions, 244 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 15:29:48,349 INFO L231 Difference]: Finished difference. Result has 58 places, 66 transitions, 230 flow [2025-03-04 15:29:48,352 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=230, PETRI_PLACES=58, PETRI_TRANSITIONS=66} [2025-03-04 15:29:48,355 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 1 predicate places. [2025-03-04 15:29:48,356 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 66 transitions, 230 flow [2025-03-04 15:29:48,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:48,356 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:48,356 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-04 15:29:48,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:29:48,357 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-04 15:29:48,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:48,357 INFO L85 PathProgramCache]: Analyzing trace with hash 2087638795, now seen corresponding path program 1 times [2025-03-04 15:29:48,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:48,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122798256] [2025-03-04 15:29:48,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:48,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:48,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:29:48,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:29:48,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:48,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:48,480 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:48,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:48,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122798256] [2025-03-04 15:29:48,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122798256] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:29:48,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557321066] [2025-03-04 15:29:48,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:48,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:48,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:48,484 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:29:48,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 15:29:48,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:29:48,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:29:48,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:48,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:48,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:29:48,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:29:48,578 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:48,578 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:29:48,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557321066] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:29:48,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:29:48,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-04 15:29:48,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739140833] [2025-03-04 15:29:48,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:29:48,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:29:48,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:48,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:29:48,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:29:48,622 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 59 [2025-03-04 15:29:48,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 66 transitions, 230 flow. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 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:29:48,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:48,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 59 [2025-03-04 15:29:48,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:48,825 INFO L124 PetriNetUnfolderBase]: 437/795 cut-off events. [2025-03-04 15:29:48,826 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-03-04 15:29:48,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1525 conditions, 795 events. 437/795 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3618 event pairs, 306 based on Foata normal form. 4/614 useless extension candidates. Maximal degree in co-relation 1429. Up to 620 conditions per place. [2025-03-04 15:29:48,831 INFO L140 encePairwiseOnDemand]: 42/59 looper letters, 27 selfloop transitions, 22 changer transitions 0/62 dead transitions. [2025-03-04 15:29:48,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 62 transitions, 312 flow [2025-03-04 15:29:48,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:29:48,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:29:48,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions. [2025-03-04 15:29:48,833 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4209039548022599 [2025-03-04 15:29:48,833 INFO L175 Difference]: Start difference. First operand has 58 places, 66 transitions, 230 flow. Second operand 6 states and 149 transitions. [2025-03-04 15:29:48,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 62 transitions, 312 flow [2025-03-04 15:29:48,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 62 transitions, 312 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:29:48,835 INFO L231 Difference]: Finished difference. Result has 59 places, 62 transitions, 258 flow [2025-03-04 15:29:48,836 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=258, PETRI_PLACES=59, PETRI_TRANSITIONS=62} [2025-03-04 15:29:48,836 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 2 predicate places. [2025-03-04 15:29:48,836 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 62 transitions, 258 flow [2025-03-04 15:29:48,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 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:29:48,837 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:48,837 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-03-04 15:29:48,845 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 15:29:49,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:49,041 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-04 15:29:49,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:49,042 INFO L85 PathProgramCache]: Analyzing trace with hash 292293803, now seen corresponding path program 1 times [2025-03-04 15:29:49,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:49,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855673849] [2025-03-04 15:29:49,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:49,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:49,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:29:49,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:29:49,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:49,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:49,137 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:49,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:49,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855673849] [2025-03-04 15:29:49,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855673849] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:29:49,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1052715257] [2025-03-04 15:29:49,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:49,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:49,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:49,139 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:29:49,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 15:29:49,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:29:49,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:29:49,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:49,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:49,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:29:49,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:29:49,211 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:49,211 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:29:49,242 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:49,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1052715257] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:29:49,242 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:29:49,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-03-04 15:29:49,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309458853] [2025-03-04 15:29:49,243 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:29:49,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 15:29:49,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:49,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 15:29:49,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 15:29:49,280 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 59 [2025-03-04 15:29:49,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 62 transitions, 258 flow. Second operand has 12 states, 12 states have (on average 17.083333333333332) internal successors, (205), 12 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:49,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:49,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 59 [2025-03-04 15:29:49,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:49,522 INFO L124 PetriNetUnfolderBase]: 449/843 cut-off events. [2025-03-04 15:29:49,523 INFO L125 PetriNetUnfolderBase]: For 119/119 co-relation queries the response was YES. [2025-03-04 15:29:49,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1713 conditions, 843 events. 449/843 cut-off events. For 119/119 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4037 event pairs, 306 based on Foata normal form. 12/671 useless extension candidates. Maximal degree in co-relation 1431. Up to 639 conditions per place. [2025-03-04 15:29:49,536 INFO L140 encePairwiseOnDemand]: 42/59 looper letters, 36 selfloop transitions, 49 changer transitions 0/98 dead transitions. [2025-03-04 15:29:49,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 98 transitions, 662 flow [2025-03-04 15:29:49,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:29:49,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 15:29:49,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 257 transitions. [2025-03-04 15:29:49,538 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43559322033898307 [2025-03-04 15:29:49,538 INFO L175 Difference]: Start difference. First operand has 59 places, 62 transitions, 258 flow. Second operand 10 states and 257 transitions. [2025-03-04 15:29:49,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 98 transitions, 662 flow [2025-03-04 15:29:49,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 98 transitions, 554 flow, removed 20 selfloop flow, removed 5 redundant places. [2025-03-04 15:29:49,542 INFO L231 Difference]: Finished difference. Result has 66 places, 98 transitions, 548 flow [2025-03-04 15:29:49,543 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=548, PETRI_PLACES=66, PETRI_TRANSITIONS=98} [2025-03-04 15:29:49,544 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 9 predicate places. [2025-03-04 15:29:49,544 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 98 transitions, 548 flow [2025-03-04 15:29:49,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 17.083333333333332) internal successors, (205), 12 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:49,545 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:49,545 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:49,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 15:29:49,749 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:29:49,750 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-04 15:29:49,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:49,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1626743133, now seen corresponding path program 1 times [2025-03-04 15:29:49,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:49,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287066896] [2025-03-04 15:29:49,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:49,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:49,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:29:49,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:29:49,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:49,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:49,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:49,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:49,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287066896] [2025-03-04 15:29:49,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287066896] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:29:49,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:29:49,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:29:49,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778316937] [2025-03-04 15:29:49,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:29:49,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:29:49,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:49,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:29:49,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:29:49,840 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2025-03-04 15:29:49,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 98 transitions, 548 flow. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:49,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:49,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2025-03-04 15:29:49,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:50,028 INFO L124 PetriNetUnfolderBase]: 883/1519 cut-off events. [2025-03-04 15:29:50,029 INFO L125 PetriNetUnfolderBase]: For 166/166 co-relation queries the response was YES. [2025-03-04 15:29:50,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3054 conditions, 1519 events. 883/1519 cut-off events. For 166/166 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7519 event pairs, 466 based on Foata normal form. 42/1215 useless extension candidates. Maximal degree in co-relation 2925. Up to 1001 conditions per place. [2025-03-04 15:29:50,037 INFO L140 encePairwiseOnDemand]: 53/59 looper letters, 108 selfloop transitions, 4 changer transitions 0/127 dead transitions. [2025-03-04 15:29:50,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 127 transitions, 836 flow [2025-03-04 15:29:50,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:29:50,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:29:50,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 154 transitions. [2025-03-04 15:29:50,038 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.652542372881356 [2025-03-04 15:29:50,038 INFO L175 Difference]: Start difference. First operand has 66 places, 98 transitions, 548 flow. Second operand 4 states and 154 transitions. [2025-03-04 15:29:50,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 127 transitions, 836 flow [2025-03-04 15:29:50,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 127 transitions, 786 flow, removed 12 selfloop flow, removed 2 redundant places. [2025-03-04 15:29:50,042 INFO L231 Difference]: Finished difference. Result has 69 places, 101 transitions, 527 flow [2025-03-04 15:29:50,042 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=498, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=527, PETRI_PLACES=69, PETRI_TRANSITIONS=101} [2025-03-04 15:29:50,043 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 12 predicate places. [2025-03-04 15:29:50,043 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 101 transitions, 527 flow [2025-03-04 15:29:50,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:50,043 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:50,043 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:50,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 15:29:50,044 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-04 15:29:50,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:50,045 INFO L85 PathProgramCache]: Analyzing trace with hash -112548387, now seen corresponding path program 1 times [2025-03-04 15:29:50,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:50,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637470396] [2025-03-04 15:29:50,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:50,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:50,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:29:50,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:29:50,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:50,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:50,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:50,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:50,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637470396] [2025-03-04 15:29:50,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637470396] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:29:50,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:29:50,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:29:50,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894362348] [2025-03-04 15:29:50,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:29:50,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:29:50,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:50,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:29:50,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:29:50,143 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2025-03-04 15:29:50,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 101 transitions, 527 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:29:50,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:50,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2025-03-04 15:29:50,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:50,382 INFO L124 PetriNetUnfolderBase]: 1399/2287 cut-off events. [2025-03-04 15:29:50,382 INFO L125 PetriNetUnfolderBase]: For 935/1007 co-relation queries the response was YES. [2025-03-04 15:29:50,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5374 conditions, 2287 events. 1399/2287 cut-off events. For 935/1007 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 11815 event pairs, 724 based on Foata normal form. 64/1931 useless extension candidates. Maximal degree in co-relation 5249. Up to 1517 conditions per place. [2025-03-04 15:29:50,396 INFO L140 encePairwiseOnDemand]: 53/59 looper letters, 115 selfloop transitions, 4 changer transitions 0/134 dead transitions. [2025-03-04 15:29:50,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 134 transitions, 875 flow [2025-03-04 15:29:50,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:29:50,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:29:50,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 152 transitions. [2025-03-04 15:29:50,397 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6440677966101694 [2025-03-04 15:29:50,397 INFO L175 Difference]: Start difference. First operand has 69 places, 101 transitions, 527 flow. Second operand 4 states and 152 transitions. [2025-03-04 15:29:50,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 134 transitions, 875 flow [2025-03-04 15:29:50,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 134 transitions, 866 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:29:50,402 INFO L231 Difference]: Finished difference. Result has 73 places, 104 transitions, 553 flow [2025-03-04 15:29:50,402 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=524, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=553, PETRI_PLACES=73, PETRI_TRANSITIONS=104} [2025-03-04 15:29:50,403 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 16 predicate places. [2025-03-04 15:29:50,403 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 104 transitions, 553 flow [2025-03-04 15:29:50,403 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:29:50,403 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:50,403 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:50,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:29:50,403 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-04 15:29:50,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:50,404 INFO L85 PathProgramCache]: Analyzing trace with hash -2105686296, now seen corresponding path program 1 times [2025-03-04 15:29:50,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:50,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780711006] [2025-03-04 15:29:50,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:50,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:50,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:29:50,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:29:50,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:50,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:50,526 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:29:50,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:50,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780711006] [2025-03-04 15:29:50,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780711006] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:29:50,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:29:50,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:29:50,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405823731] [2025-03-04 15:29:50,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:29:50,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:29:50,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:50,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:29:50,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:29:50,528 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 59 [2025-03-04 15:29:50,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 104 transitions, 553 flow. Second operand has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:50,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:50,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 59 [2025-03-04 15:29:50,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:50,893 INFO L124 PetriNetUnfolderBase]: 1552/2880 cut-off events. [2025-03-04 15:29:50,894 INFO L125 PetriNetUnfolderBase]: For 1649/1667 co-relation queries the response was YES. [2025-03-04 15:29:50,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7326 conditions, 2880 events. 1552/2880 cut-off events. For 1649/1667 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 16208 event pairs, 952 based on Foata normal form. 62/2567 useless extension candidates. Maximal degree in co-relation 7113. Up to 1496 conditions per place. [2025-03-04 15:29:50,909 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 134 selfloop transitions, 35 changer transitions 0/186 dead transitions. [2025-03-04 15:29:50,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 186 transitions, 1301 flow [2025-03-04 15:29:50,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:29:50,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:29:50,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 239 transitions. [2025-03-04 15:29:50,911 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6751412429378532 [2025-03-04 15:29:50,911 INFO L175 Difference]: Start difference. First operand has 73 places, 104 transitions, 553 flow. Second operand 6 states and 239 transitions. [2025-03-04 15:29:50,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 186 transitions, 1301 flow [2025-03-04 15:29:50,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 186 transitions, 1292 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:29:50,917 INFO L231 Difference]: Finished difference. Result has 80 places, 120 transitions, 758 flow [2025-03-04 15:29:50,917 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=550, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=758, PETRI_PLACES=80, PETRI_TRANSITIONS=120} [2025-03-04 15:29:50,918 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 23 predicate places. [2025-03-04 15:29:50,918 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 120 transitions, 758 flow [2025-03-04 15:29:50,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:50,918 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:50,918 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:50,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 15:29:50,918 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-04 15:29:50,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:50,920 INFO L85 PathProgramCache]: Analyzing trace with hash -807345577, now seen corresponding path program 1 times [2025-03-04 15:29:50,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:50,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431614347] [2025-03-04 15:29:50,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:50,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:50,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:29:50,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:29:50,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:50,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:50,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:50,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:50,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431614347] [2025-03-04 15:29:50,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431614347] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:29:50,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:29:50,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:29:50,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839188363] [2025-03-04 15:29:50,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:29:50,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:29:50,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:50,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:29:50,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:29:50,997 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2025-03-04 15:29:50,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 120 transitions, 758 flow. Second operand has 5 states, 5 states have (on average 24.6) internal successors, (123), 5 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:50,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:50,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2025-03-04 15:29:50,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:51,283 INFO L124 PetriNetUnfolderBase]: 1868/3076 cut-off events. [2025-03-04 15:29:51,284 INFO L125 PetriNetUnfolderBase]: For 2806/2993 co-relation queries the response was YES. [2025-03-04 15:29:51,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8516 conditions, 3076 events. 1868/3076 cut-off events. For 2806/2993 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 15268 event pairs, 572 based on Foata normal form. 122/2756 useless extension candidates. Maximal degree in co-relation 8293. Up to 1144 conditions per place. [2025-03-04 15:29:51,301 INFO L140 encePairwiseOnDemand]: 53/59 looper letters, 132 selfloop transitions, 10 changer transitions 0/157 dead transitions. [2025-03-04 15:29:51,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 157 transitions, 1220 flow [2025-03-04 15:29:51,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:29:51,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:29:51,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 167 transitions. [2025-03-04 15:29:51,303 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5661016949152542 [2025-03-04 15:29:51,303 INFO L175 Difference]: Start difference. First operand has 80 places, 120 transitions, 758 flow. Second operand 5 states and 167 transitions. [2025-03-04 15:29:51,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 157 transitions, 1220 flow [2025-03-04 15:29:51,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 157 transitions, 1214 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-03-04 15:29:51,309 INFO L231 Difference]: Finished difference. Result has 83 places, 119 transitions, 770 flow [2025-03-04 15:29:51,309 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=770, PETRI_PLACES=83, PETRI_TRANSITIONS=119} [2025-03-04 15:29:51,310 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 26 predicate places. [2025-03-04 15:29:51,310 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 119 transitions, 770 flow [2025-03-04 15:29:51,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.6) internal successors, (123), 5 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:51,310 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:51,310 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:51,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 15:29:51,311 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-04 15:29:51,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:51,312 INFO L85 PathProgramCache]: Analyzing trace with hash 742091512, now seen corresponding path program 1 times [2025-03-04 15:29:51,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:51,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577682238] [2025-03-04 15:29:51,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:51,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:51,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:29:51,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:29:51,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:51,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:51,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:51,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:51,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577682238] [2025-03-04 15:29:51,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577682238] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:29:51,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:29:51,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:29:51,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830665110] [2025-03-04 15:29:51,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:29:51,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:29:51,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:51,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:29:51,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:29:51,405 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2025-03-04 15:29:51,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 119 transitions, 770 flow. Second operand has 5 states, 5 states have (on average 24.6) internal successors, (123), 5 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:51,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:51,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2025-03-04 15:29:51,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:51,696 INFO L124 PetriNetUnfolderBase]: 1770/3091 cut-off events. [2025-03-04 15:29:51,697 INFO L125 PetriNetUnfolderBase]: For 3154/3199 co-relation queries the response was YES. [2025-03-04 15:29:51,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8890 conditions, 3091 events. 1770/3091 cut-off events. For 3154/3199 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 16241 event pairs, 1160 based on Foata normal form. 43/2819 useless extension candidates. Maximal degree in co-relation 8664. Up to 1793 conditions per place. [2025-03-04 15:29:51,715 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 125 selfloop transitions, 35 changer transitions 6/181 dead transitions. [2025-03-04 15:29:51,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 181 transitions, 1435 flow [2025-03-04 15:29:51,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:29:51,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:29:51,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 224 transitions. [2025-03-04 15:29:51,716 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.632768361581921 [2025-03-04 15:29:51,716 INFO L175 Difference]: Start difference. First operand has 83 places, 119 transitions, 770 flow. Second operand 6 states and 224 transitions. [2025-03-04 15:29:51,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 181 transitions, 1435 flow [2025-03-04 15:29:51,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 181 transitions, 1399 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 15:29:51,724 INFO L231 Difference]: Finished difference. Result has 86 places, 121 transitions, 847 flow [2025-03-04 15:29:51,724 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=847, PETRI_PLACES=86, PETRI_TRANSITIONS=121} [2025-03-04 15:29:51,725 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 29 predicate places. [2025-03-04 15:29:51,725 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 121 transitions, 847 flow [2025-03-04 15:29:51,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.6) internal successors, (123), 5 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:51,725 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:51,725 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:51,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 15:29:51,725 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-04 15:29:51,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:51,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1441074575, now seen corresponding path program 1 times [2025-03-04 15:29:51,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:51,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228993725] [2025-03-04 15:29:51,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:51,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:51,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:29:51,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:29:51,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:51,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:51,820 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:29:51,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:51,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228993725] [2025-03-04 15:29:51,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228993725] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:29:51,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:29:51,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 15:29:51,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387737208] [2025-03-04 15:29:51,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:29:51,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:29:51,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:51,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:29:51,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:29:51,821 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 59 [2025-03-04 15:29:51,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 121 transitions, 847 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:29:51,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:51,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 59 [2025-03-04 15:29:51,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:52,121 INFO L124 PetriNetUnfolderBase]: 1274/2326 cut-off events. [2025-03-04 15:29:52,122 INFO L125 PetriNetUnfolderBase]: For 2312/2328 co-relation queries the response was YES. [2025-03-04 15:29:52,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6589 conditions, 2326 events. 1274/2326 cut-off events. For 2312/2328 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 12459 event pairs, 824 based on Foata normal form. 34/2220 useless extension candidates. Maximal degree in co-relation 6356. Up to 1496 conditions per place. [2025-03-04 15:29:52,137 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 95 selfloop transitions, 31 changer transitions 32/174 dead transitions. [2025-03-04 15:29:52,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 174 transitions, 1443 flow [2025-03-04 15:29:52,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:29:52,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 15:29:52,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 258 transitions. [2025-03-04 15:29:52,138 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6246973365617433 [2025-03-04 15:29:52,138 INFO L175 Difference]: Start difference. First operand has 86 places, 121 transitions, 847 flow. Second operand 7 states and 258 transitions. [2025-03-04 15:29:52,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 174 transitions, 1443 flow [2025-03-04 15:29:52,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 174 transitions, 1390 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:29:52,146 INFO L231 Difference]: Finished difference. Result has 92 places, 115 transitions, 832 flow [2025-03-04 15:29:52,146 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=794, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=832, PETRI_PLACES=92, PETRI_TRANSITIONS=115} [2025-03-04 15:29:52,147 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 35 predicate places. [2025-03-04 15:29:52,147 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 115 transitions, 832 flow [2025-03-04 15:29:52,147 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:29:52,147 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:52,147 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1] [2025-03-04 15:29:52,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 15:29:52,147 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-04 15:29:52,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:52,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1668445754, now seen corresponding path program 2 times [2025-03-04 15:29:52,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:52,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84657385] [2025-03-04 15:29:52,148 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:29:52,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:52,154 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 15:29:52,157 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-03-04 15:29:52,157 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:29:52,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:52,182 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 15:29:52,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:52,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84657385] [2025-03-04 15:29:52,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84657385] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:29:52,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612494326] [2025-03-04 15:29:52,182 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:29:52,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:52,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:52,186 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:29:52,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 15:29:52,232 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 15:29:52,239 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-03-04 15:29:52,239 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:29:52,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:52,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:29:52,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:29:52,264 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 15:29:52,265 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:29:52,298 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 15:29:52,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612494326] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:29:52,299 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:29:52,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 2 [2025-03-04 15:29:52,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223818880] [2025-03-04 15:29:52,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:29:52,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:29:52,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:52,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:29:52,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:29:52,316 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 59 [2025-03-04 15:29:52,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 115 transitions, 832 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:52,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:52,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 59 [2025-03-04 15:29:52,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:52,536 INFO L124 PetriNetUnfolderBase]: 1084/2010 cut-off events. [2025-03-04 15:29:52,537 INFO L125 PetriNetUnfolderBase]: For 2244/2260 co-relation queries the response was YES. [2025-03-04 15:29:52,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5801 conditions, 2010 events. 1084/2010 cut-off events. For 2244/2260 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 11120 event pairs, 724 based on Foata normal form. 1/1873 useless extension candidates. Maximal degree in co-relation 5564. Up to 1551 conditions per place. [2025-03-04 15:29:52,550 INFO L140 encePairwiseOnDemand]: 54/59 looper letters, 86 selfloop transitions, 16 changer transitions 0/114 dead transitions. [2025-03-04 15:29:52,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 114 transitions, 1026 flow [2025-03-04 15:29:52,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:29:52,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:29:52,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 101 transitions. [2025-03-04 15:29:52,552 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4279661016949153 [2025-03-04 15:29:52,552 INFO L175 Difference]: Start difference. First operand has 92 places, 115 transitions, 832 flow. Second operand 4 states and 101 transitions. [2025-03-04 15:29:52,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 114 transitions, 1026 flow [2025-03-04 15:29:52,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 114 transitions, 913 flow, removed 9 selfloop flow, removed 11 redundant places. [2025-03-04 15:29:52,560 INFO L231 Difference]: Finished difference. Result has 79 places, 114 transitions, 741 flow [2025-03-04 15:29:52,561 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=709, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=741, PETRI_PLACES=79, PETRI_TRANSITIONS=114} [2025-03-04 15:29:52,561 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 22 predicate places. [2025-03-04 15:29:52,561 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 114 transitions, 741 flow [2025-03-04 15:29:52,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:52,562 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:52,562 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1] [2025-03-04 15:29:52,568 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:29:52,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:52,762 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-04 15:29:52,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:52,763 INFO L85 PathProgramCache]: Analyzing trace with hash 693111004, now seen corresponding path program 1 times [2025-03-04 15:29:52,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:52,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934659279] [2025-03-04 15:29:52,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:52,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:52,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:29:52,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:29:52,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:52,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:52,842 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-04 15:29:52,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:52,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934659279] [2025-03-04 15:29:52,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934659279] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:29:52,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:29:52,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:29:52,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134798616] [2025-03-04 15:29:52,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:29:52,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:29:52,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:52,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:29:52,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:29:52,843 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 59 [2025-03-04 15:29:52,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 114 transitions, 741 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:29:52,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:52,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 59 [2025-03-04 15:29:52,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:53,018 INFO L124 PetriNetUnfolderBase]: 1073/1954 cut-off events. [2025-03-04 15:29:53,019 INFO L125 PetriNetUnfolderBase]: For 1089/1103 co-relation queries the response was YES. [2025-03-04 15:29:53,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4946 conditions, 1954 events. 1073/1954 cut-off events. For 1089/1103 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 10853 event pairs, 724 based on Foata normal form. 3/1740 useless extension candidates. Maximal degree in co-relation 4827. Up to 1496 conditions per place. [2025-03-04 15:29:53,027 INFO L140 encePairwiseOnDemand]: 48/59 looper letters, 66 selfloop transitions, 17 changer transitions 5/103 dead transitions. [2025-03-04 15:29:53,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 103 transitions, 815 flow [2025-03-04 15:29:53,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:29:53,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:29:53,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 145 transitions. [2025-03-04 15:29:53,029 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.614406779661017 [2025-03-04 15:29:53,029 INFO L175 Difference]: Start difference. First operand has 79 places, 114 transitions, 741 flow. Second operand 4 states and 145 transitions. [2025-03-04 15:29:53,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 103 transitions, 815 flow [2025-03-04 15:29:53,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 103 transitions, 758 flow, removed 4 selfloop flow, removed 5 redundant places. [2025-03-04 15:29:53,033 INFO L231 Difference]: Finished difference. Result has 77 places, 98 transitions, 595 flow [2025-03-04 15:29:53,033 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=582, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=595, PETRI_PLACES=77, PETRI_TRANSITIONS=98} [2025-03-04 15:29:53,034 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 20 predicate places. [2025-03-04 15:29:53,034 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 98 transitions, 595 flow [2025-03-04 15:29:53,034 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:29:53,034 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:53,034 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:53,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 15:29:53,034 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-04 15:29:53,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:53,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1491705431, now seen corresponding path program 1 times [2025-03-04 15:29:53,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:53,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525705396] [2025-03-04 15:29:53,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:53,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:53,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 15:29:53,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:29:53,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:53,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:53,169 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 15:29:53,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:53,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525705396] [2025-03-04 15:29:53,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525705396] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:29:53,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657002827] [2025-03-04 15:29:53,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:53,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:53,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:53,171 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:29:53,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 15:29:53,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 15:29:53,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:29:53,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:53,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:53,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 15:29:53,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:29:53,320 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 15:29:53,320 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:29:53,400 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 15:29:53,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657002827] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:29:53,401 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:29:53,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2025-03-04 15:29:53,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60082937] [2025-03-04 15:29:53,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:29:53,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 15:29:53,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:53,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 15:29:53,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2025-03-04 15:29:53,505 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 59 [2025-03-04 15:29:53,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 98 transitions, 595 flow. Second operand has 19 states, 19 states have (on average 17.210526315789473) internal successors, (327), 19 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:53,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:53,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 59 [2025-03-04 15:29:53,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:53,971 INFO L124 PetriNetUnfolderBase]: 2125/3785 cut-off events. [2025-03-04 15:29:53,971 INFO L125 PetriNetUnfolderBase]: For 2091/2186 co-relation queries the response was YES. [2025-03-04 15:29:53,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9495 conditions, 3785 events. 2125/3785 cut-off events. For 2091/2186 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 21210 event pairs, 1448 based on Foata normal form. 3/3365 useless extension candidates. Maximal degree in co-relation 9362. Up to 1475 conditions per place. [2025-03-04 15:29:53,990 INFO L140 encePairwiseOnDemand]: 46/59 looper letters, 62 selfloop transitions, 59 changer transitions 0/133 dead transitions. [2025-03-04 15:29:53,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 133 transitions, 1006 flow [2025-03-04 15:29:53,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:29:53,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 15:29:53,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 248 transitions. [2025-03-04 15:29:53,991 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42033898305084744 [2025-03-04 15:29:53,991 INFO L175 Difference]: Start difference. First operand has 77 places, 98 transitions, 595 flow. Second operand 10 states and 248 transitions. [2025-03-04 15:29:53,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 133 transitions, 1006 flow [2025-03-04 15:29:53,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 133 transitions, 884 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-03-04 15:29:53,996 INFO L231 Difference]: Finished difference. Result has 79 places, 107 transitions, 682 flow [2025-03-04 15:29:53,996 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=682, PETRI_PLACES=79, PETRI_TRANSITIONS=107} [2025-03-04 15:29:53,996 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 22 predicate places. [2025-03-04 15:29:53,997 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 107 transitions, 682 flow [2025-03-04 15:29:53,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 17.210526315789473) internal successors, (327), 19 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:53,997 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:53,997 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 2, 2, 2, 1, 1, 1] [2025-03-04 15:29:54,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 15:29:54,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:54,198 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-04 15:29:54,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:54,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1700539652, now seen corresponding path program 2 times [2025-03-04 15:29:54,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:54,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394488657] [2025-03-04 15:29:54,198 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:29:54,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:54,206 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-04 15:29:54,210 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 23 statements. [2025-03-04 15:29:54,210 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:29:54,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:54,236 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 15:29:54,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:54,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394488657] [2025-03-04 15:29:54,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394488657] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:29:54,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762762974] [2025-03-04 15:29:54,236 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:29:54,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:54,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:54,239 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:29:54,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:29:54,284 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-04 15:29:54,293 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 23 statements. [2025-03-04 15:29:54,293 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:29:54,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:54,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:29:54,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:29:54,322 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 15:29:54,322 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:29:54,358 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 15:29:54,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762762974] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:29:54,358 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:29:54,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-03-04 15:29:54,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127753633] [2025-03-04 15:29:54,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:29:54,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:29:54,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:54,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:29:54,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:29:54,378 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 59 [2025-03-04 15:29:54,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 107 transitions, 682 flow. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:54,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:54,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 59 [2025-03-04 15:29:54,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:54,629 INFO L124 PetriNetUnfolderBase]: 2125/3827 cut-off events. [2025-03-04 15:29:54,629 INFO L125 PetriNetUnfolderBase]: For 2091/2119 co-relation queries the response was YES. [2025-03-04 15:29:54,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9551 conditions, 3827 events. 2125/3827 cut-off events. For 2091/2119 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 22031 event pairs, 1448 based on Foata normal form. 3/3393 useless extension candidates. Maximal degree in co-relation 9427. Up to 2915 conditions per place. [2025-03-04 15:29:54,648 INFO L140 encePairwiseOnDemand]: 46/59 looper letters, 40 selfloop transitions, 52 changer transitions 0/104 dead transitions. [2025-03-04 15:29:54,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 104 transitions, 836 flow [2025-03-04 15:29:54,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:29:54,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:29:54,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 116 transitions. [2025-03-04 15:29:54,649 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39322033898305087 [2025-03-04 15:29:54,650 INFO L175 Difference]: Start difference. First operand has 79 places, 107 transitions, 682 flow. Second operand 5 states and 116 transitions. [2025-03-04 15:29:54,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 104 transitions, 836 flow [2025-03-04 15:29:54,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 104 transitions, 722 flow, removed 4 selfloop flow, removed 7 redundant places. [2025-03-04 15:29:54,654 INFO L231 Difference]: Finished difference. Result has 73 places, 104 transitions, 642 flow [2025-03-04 15:29:54,654 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=642, PETRI_PLACES=73, PETRI_TRANSITIONS=104} [2025-03-04 15:29:54,655 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 16 predicate places. [2025-03-04 15:29:54,655 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 104 transitions, 642 flow [2025-03-04 15:29:54,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:54,655 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:54,655 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:54,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 15:29:54,859 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,SelfDestructingSolverStorable12 [2025-03-04 15:29:54,859 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-04 15:29:54,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:54,859 INFO L85 PathProgramCache]: Analyzing trace with hash -740473383, now seen corresponding path program 1 times [2025-03-04 15:29:54,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:54,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874092194] [2025-03-04 15:29:54,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:54,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:54,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 15:29:54,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 15:29:54,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:54,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:54,949 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 15:29:54,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:54,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874092194] [2025-03-04 15:29:54,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874092194] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:29:54,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941044352] [2025-03-04 15:29:54,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:54,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:54,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:54,953 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:29:54,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 15:29:55,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 15:29:55,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 15:29:55,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:55,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:55,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 15:29:55,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:29:55,114 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:29:55,114 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:29:55,209 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:29:55,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1941044352] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:29:55,210 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:29:55,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 19 [2025-03-04 15:29:55,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164161844] [2025-03-04 15:29:55,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:29:55,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 15:29:55,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:55,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 15:29:55,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2025-03-04 15:29:55,327 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 59 [2025-03-04 15:29:55,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 104 transitions, 642 flow. Second operand has 19 states, 19 states have (on average 16.42105263157895) internal successors, (312), 19 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:55,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:55,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 59 [2025-03-04 15:29:55,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:56,057 INFO L124 PetriNetUnfolderBase]: 2213/3658 cut-off events. [2025-03-04 15:29:56,057 INFO L125 PetriNetUnfolderBase]: For 1640/1754 co-relation queries the response was YES. [2025-03-04 15:29:56,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9363 conditions, 3658 events. 2213/3658 cut-off events. For 1640/1754 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 18800 event pairs, 536 based on Foata normal form. 62/3271 useless extension candidates. Maximal degree in co-relation 5591. Up to 825 conditions per place. [2025-03-04 15:29:56,074 INFO L140 encePairwiseOnDemand]: 41/59 looper letters, 158 selfloop transitions, 71 changer transitions 0/239 dead transitions. [2025-03-04 15:29:56,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 239 transitions, 1535 flow [2025-03-04 15:29:56,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 15:29:56,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-04 15:29:56,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 418 transitions. [2025-03-04 15:29:56,076 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4167497507477567 [2025-03-04 15:29:56,076 INFO L175 Difference]: Start difference. First operand has 73 places, 104 transitions, 642 flow. Second operand 17 states and 418 transitions. [2025-03-04 15:29:56,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 239 transitions, 1535 flow [2025-03-04 15:29:56,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 239 transitions, 1436 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:29:56,084 INFO L231 Difference]: Finished difference. Result has 85 places, 108 transitions, 703 flow [2025-03-04 15:29:56,085 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=539, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=703, PETRI_PLACES=85, PETRI_TRANSITIONS=108} [2025-03-04 15:29:56,085 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 28 predicate places. [2025-03-04 15:29:56,085 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 108 transitions, 703 flow [2025-03-04 15:29:56,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 16.42105263157895) internal successors, (312), 19 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:56,085 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:56,086 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:56,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 15:29:56,290 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:29:56,290 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-04 15:29:56,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:56,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1548291671, now seen corresponding path program 1 times [2025-03-04 15:29:56,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:56,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876089787] [2025-03-04 15:29:56,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:56,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:56,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 15:29:56,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 15:29:56,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:56,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:56,406 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:29:56,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:56,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876089787] [2025-03-04 15:29:56,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876089787] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:29:56,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144485479] [2025-03-04 15:29:56,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:56,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:56,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:56,408 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:29:56,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 15:29:56,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 15:29:56,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 15:29:56,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:56,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:56,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 15:29:56,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:29:56,573 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:29:56,573 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:29:56,677 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:29:56,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [144485479] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:29:56,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:29:56,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 18 [2025-03-04 15:29:56,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601321288] [2025-03-04 15:29:56,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:29:56,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 15:29:56,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:56,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 15:29:56,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2025-03-04 15:29:56,791 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 59 [2025-03-04 15:29:56,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 108 transitions, 703 flow. Second operand has 20 states, 20 states have (on average 16.75) internal successors, (335), 20 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:56,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:56,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 59 [2025-03-04 15:29:56,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:57,393 INFO L124 PetriNetUnfolderBase]: 2407/3899 cut-off events. [2025-03-04 15:29:57,393 INFO L125 PetriNetUnfolderBase]: For 3892/4005 co-relation queries the response was YES. [2025-03-04 15:29:57,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10812 conditions, 3899 events. 2407/3899 cut-off events. For 3892/4005 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 19295 event pairs, 1001 based on Foata normal form. 0/3398 useless extension candidates. Maximal degree in co-relation 6741. Up to 1348 conditions per place. [2025-03-04 15:29:57,407 INFO L140 encePairwiseOnDemand]: 41/59 looper letters, 123 selfloop transitions, 47 changer transitions 12/192 dead transitions. [2025-03-04 15:29:57,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 192 transitions, 1433 flow [2025-03-04 15:29:57,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 15:29:57,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 15:29:57,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 340 transitions. [2025-03-04 15:29:57,409 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.384180790960452 [2025-03-04 15:29:57,409 INFO L175 Difference]: Start difference. First operand has 85 places, 108 transitions, 703 flow. Second operand 15 states and 340 transitions. [2025-03-04 15:29:57,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 192 transitions, 1433 flow [2025-03-04 15:29:57,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 192 transitions, 1215 flow, removed 9 selfloop flow, removed 12 redundant places. [2025-03-04 15:29:57,414 INFO L231 Difference]: Finished difference. Result has 86 places, 112 transitions, 656 flow [2025-03-04 15:29:57,414 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=551, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=656, PETRI_PLACES=86, PETRI_TRANSITIONS=112} [2025-03-04 15:29:57,414 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 29 predicate places. [2025-03-04 15:29:57,414 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 112 transitions, 656 flow [2025-03-04 15:29:57,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 16.75) internal successors, (335), 20 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:57,415 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:57,415 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:57,421 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 15:29:57,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:57,616 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-04 15:29:57,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:57,617 INFO L85 PathProgramCache]: Analyzing trace with hash -849308608, now seen corresponding path program 1 times [2025-03-04 15:29:57,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:57,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468278469] [2025-03-04 15:29:57,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:57,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:57,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 15:29:57,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 15:29:57,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:57,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:57,739 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 15:29:57,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:57,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468278469] [2025-03-04 15:29:57,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468278469] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:29:57,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215573025] [2025-03-04 15:29:57,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:57,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:57,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:57,742 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:29:57,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 15:29:57,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 15:29:57,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 15:29:57,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:57,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:57,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:29:57,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:29:57,850 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 15:29:57,850 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:29:57,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215573025] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:29:57,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:29:57,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-04 15:29:57,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645173416] [2025-03-04 15:29:57,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:29:57,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:29:57,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:57,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:29:57,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:29:57,856 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2025-03-04 15:29:57,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 112 transitions, 656 flow. Second operand has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:57,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:57,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2025-03-04 15:29:57,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:58,189 INFO L124 PetriNetUnfolderBase]: 2758/4281 cut-off events. [2025-03-04 15:29:58,189 INFO L125 PetriNetUnfolderBase]: For 1996/2044 co-relation queries the response was YES. [2025-03-04 15:29:58,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11648 conditions, 4281 events. 2758/4281 cut-off events. For 1996/2044 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 20912 event pairs, 462 based on Foata normal form. 148/3745 useless extension candidates. Maximal degree in co-relation 7372. Up to 1147 conditions per place. [2025-03-04 15:29:58,207 INFO L140 encePairwiseOnDemand]: 54/59 looper letters, 200 selfloop transitions, 7 changer transitions 0/215 dead transitions. [2025-03-04 15:29:58,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 215 transitions, 1438 flow [2025-03-04 15:29:58,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:29:58,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:29:58,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 217 transitions. [2025-03-04 15:29:58,208 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6129943502824858 [2025-03-04 15:29:58,208 INFO L175 Difference]: Start difference. First operand has 86 places, 112 transitions, 656 flow. Second operand 6 states and 217 transitions. [2025-03-04 15:29:58,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 215 transitions, 1438 flow [2025-03-04 15:29:58,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 215 transitions, 1383 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-03-04 15:29:58,216 INFO L231 Difference]: Finished difference. Result has 82 places, 111 transitions, 611 flow [2025-03-04 15:29:58,216 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=597, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=611, PETRI_PLACES=82, PETRI_TRANSITIONS=111} [2025-03-04 15:29:58,216 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 25 predicate places. [2025-03-04 15:29:58,216 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 111 transitions, 611 flow [2025-03-04 15:29:58,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:58,217 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:58,217 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:58,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 15:29:58,417 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,SelfDestructingSolverStorable15 [2025-03-04 15:29:58,417 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-04 15:29:58,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:58,418 INFO L85 PathProgramCache]: Analyzing trace with hash -558762456, now seen corresponding path program 1 times [2025-03-04 15:29:58,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:58,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82435107] [2025-03-04 15:29:58,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:58,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:58,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 15:29:58,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 15:29:58,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:58,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:58,492 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 15:29:58,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:58,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82435107] [2025-03-04 15:29:58,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82435107] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:29:58,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773995469] [2025-03-04 15:29:58,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:58,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:58,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:58,495 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:29:58,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 15:29:58,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 15:29:58,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 15:29:58,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:58,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:58,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:29:58,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:29:58,594 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 15:29:58,594 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:29:58,617 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 15:29:58,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773995469] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:29:58,618 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:29:58,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-04 15:29:58,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554022028] [2025-03-04 15:29:58,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:29:58,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 15:29:58,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:58,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 15:29:58,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 15:29:58,628 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2025-03-04 15:29:58,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 111 transitions, 611 flow. Second operand has 12 states, 12 states have (on average 24.416666666666668) internal successors, (293), 12 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:58,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:58,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2025-03-04 15:29:58,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:59,202 INFO L124 PetriNetUnfolderBase]: 5404/8284 cut-off events. [2025-03-04 15:29:59,203 INFO L125 PetriNetUnfolderBase]: For 6289/6379 co-relation queries the response was YES. [2025-03-04 15:29:59,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24530 conditions, 8284 events. 5404/8284 cut-off events. For 6289/6379 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 42825 event pairs, 1384 based on Foata normal form. 444/7418 useless extension candidates. Maximal degree in co-relation 15689. Up to 3284 conditions per place. [2025-03-04 15:29:59,230 INFO L140 encePairwiseOnDemand]: 54/59 looper letters, 307 selfloop transitions, 13 changer transitions 0/328 dead transitions. [2025-03-04 15:29:59,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 328 transitions, 2049 flow [2025-03-04 15:29:59,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:29:59,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 15:29:59,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 364 transitions. [2025-03-04 15:29:59,231 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6169491525423729 [2025-03-04 15:29:59,231 INFO L175 Difference]: Start difference. First operand has 82 places, 111 transitions, 611 flow. Second operand 10 states and 364 transitions. [2025-03-04 15:29:59,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 328 transitions, 2049 flow [2025-03-04 15:29:59,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 328 transitions, 2003 flow, removed 8 selfloop flow, removed 5 redundant places. [2025-03-04 15:29:59,242 INFO L231 Difference]: Finished difference. Result has 89 places, 120 transitions, 663 flow [2025-03-04 15:29:59,242 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=589, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=663, PETRI_PLACES=89, PETRI_TRANSITIONS=120} [2025-03-04 15:29:59,242 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 32 predicate places. [2025-03-04 15:29:59,242 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 120 transitions, 663 flow [2025-03-04 15:29:59,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 24.416666666666668) internal successors, (293), 12 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:59,242 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:59,243 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:59,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 15:29:59,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 15:29:59,446 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-04 15:29:59,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:59,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1104306204, now seen corresponding path program 2 times [2025-03-04 15:29:59,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:59,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411958586] [2025-03-04 15:29:59,447 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:29:59,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:59,454 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-04 15:29:59,460 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 36 statements. [2025-03-04 15:29:59,460 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:29:59,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:59,502 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-04 15:29:59,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:59,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411958586] [2025-03-04 15:29:59,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411958586] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:29:59,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841225348] [2025-03-04 15:29:59,503 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:29:59,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:59,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:59,505 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:29:59,507 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:29:59,566 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-04 15:29:59,586 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 36 statements. [2025-03-04 15:29:59,586 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:29:59,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:59,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:29:59,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:29:59,619 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-04 15:29:59,620 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:29:59,657 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-04 15:29:59,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1841225348] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:29:59,657 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:29:59,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 2, 2] total 3 [2025-03-04 15:29:59,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583492596] [2025-03-04 15:29:59,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:29:59,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:29:59,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:59,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:29:59,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:29:59,661 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2025-03-04 15:29:59,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 120 transitions, 663 flow. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:59,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:59,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2025-03-04 15:29:59,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:30:00,064 INFO L124 PetriNetUnfolderBase]: 5037/7924 cut-off events. [2025-03-04 15:30:00,064 INFO L125 PetriNetUnfolderBase]: For 9846/9890 co-relation queries the response was YES. [2025-03-04 15:30:00,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22653 conditions, 7924 events. 5037/7924 cut-off events. For 9846/9890 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 41463 event pairs, 1988 based on Foata normal form. 148/7260 useless extension candidates. Maximal degree in co-relation 16318. Up to 4313 conditions per place. [2025-03-04 15:30:00,087 INFO L140 encePairwiseOnDemand]: 55/59 looper letters, 89 selfloop transitions, 11 changer transitions 37/145 dead transitions. [2025-03-04 15:30:00,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 145 transitions, 1020 flow [2025-03-04 15:30:00,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:30:00,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:30:00,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2025-03-04 15:30:00,088 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5635593220338984 [2025-03-04 15:30:00,088 INFO L175 Difference]: Start difference. First operand has 89 places, 120 transitions, 663 flow. Second operand 4 states and 133 transitions. [2025-03-04 15:30:00,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 145 transitions, 1020 flow [2025-03-04 15:30:00,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 145 transitions, 999 flow, removed 4 selfloop flow, removed 6 redundant places. [2025-03-04 15:30:00,101 INFO L231 Difference]: Finished difference. Result has 85 places, 94 transitions, 526 flow [2025-03-04 15:30:00,101 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=632, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=526, PETRI_PLACES=85, PETRI_TRANSITIONS=94} [2025-03-04 15:30:00,101 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 28 predicate places. [2025-03-04 15:30:00,101 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 94 transitions, 526 flow [2025-03-04 15:30:00,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:30:00,102 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:30:00,102 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:30:00,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 15:30:00,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 15:30:00,302 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-04 15:30:00,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:30:00,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1428727847, now seen corresponding path program 1 times [2025-03-04 15:30:00,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:30:00,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285917143] [2025-03-04 15:30:00,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:00,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:30:00,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 15:30:00,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 15:30:00,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:00,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:00,385 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-04 15:30:00,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:30:00,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285917143] [2025-03-04 15:30:00,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285917143] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:30:00,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309006446] [2025-03-04 15:30:00,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:00,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:30:00,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:30:00,387 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:30:00,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 15:30:00,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 15:30:00,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 15:30:00,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:00,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:00,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:30:00,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:30:00,503 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-04 15:30:00,503 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:30:00,528 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-04 15:30:00,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309006446] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:30:00,529 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:30:00,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-04 15:30:00,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441417777] [2025-03-04 15:30:00,529 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:30:00,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 15:30:00,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:30:00,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 15:30:00,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 15:30:00,540 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2025-03-04 15:30:00,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 94 transitions, 526 flow. Second operand has 12 states, 12 states have (on average 24.25) internal successors, (291), 12 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:30:00,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:30:00,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2025-03-04 15:30:00,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:30:01,176 INFO L124 PetriNetUnfolderBase]: 5077/7754 cut-off events. [2025-03-04 15:30:01,176 INFO L125 PetriNetUnfolderBase]: For 9959/9959 co-relation queries the response was YES. [2025-03-04 15:30:01,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22562 conditions, 7754 events. 5077/7754 cut-off events. For 9959/9959 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 41429 event pairs, 1111 based on Foata normal form. 438/7612 useless extension candidates. Maximal degree in co-relation 22361. Up to 2327 conditions per place. [2025-03-04 15:30:01,203 INFO L140 encePairwiseOnDemand]: 55/59 looper letters, 300 selfloop transitions, 9 changer transitions 0/316 dead transitions. [2025-03-04 15:30:01,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 316 transitions, 2176 flow [2025-03-04 15:30:01,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:30:01,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 15:30:01,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 366 transitions. [2025-03-04 15:30:01,205 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6203389830508474 [2025-03-04 15:30:01,205 INFO L175 Difference]: Start difference. First operand has 85 places, 94 transitions, 526 flow. Second operand 10 states and 366 transitions. [2025-03-04 15:30:01,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 316 transitions, 2176 flow [2025-03-04 15:30:01,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 316 transitions, 1953 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-03-04 15:30:01,214 INFO L231 Difference]: Finished difference. Result has 78 places, 100 transitions, 545 flow [2025-03-04 15:30:01,214 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=487, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=545, PETRI_PLACES=78, PETRI_TRANSITIONS=100} [2025-03-04 15:30:01,214 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 21 predicate places. [2025-03-04 15:30:01,214 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 100 transitions, 545 flow [2025-03-04 15:30:01,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 24.25) internal successors, (291), 12 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:30:01,214 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:30:01,215 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:30:01,221 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:30:01,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:30:01,419 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-04 15:30:01,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:30:01,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1505322748, now seen corresponding path program 2 times [2025-03-04 15:30:01,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:30:01,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307903618] [2025-03-04 15:30:01,420 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:30:01,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:30:01,431 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-03-04 15:30:01,438 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 46 statements. [2025-03-04 15:30:01,438 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:30:01,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:01,466 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-04 15:30:01,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:30:01,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307903618] [2025-03-04 15:30:01,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307903618] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:30:01,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835630866] [2025-03-04 15:30:01,466 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:30:01,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:30:01,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:30:01,468 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:30:01,470 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:30:01,536 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-03-04 15:30:01,549 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 46 statements. [2025-03-04 15:30:01,549 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:30:01,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:01,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:30:01,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:30:01,588 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-04 15:30:01,588 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:30:01,629 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-04 15:30:01,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [835630866] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:30:01,629 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:30:01,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 2 [2025-03-04 15:30:01,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752104680] [2025-03-04 15:30:01,629 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:30:01,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:30:01,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:30:01,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:30:01,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:30:01,633 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2025-03-04 15:30:01,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 100 transitions, 545 flow. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:30:01,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:30:01,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2025-03-04 15:30:01,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:30:02,004 INFO L124 PetriNetUnfolderBase]: 4655/7353 cut-off events. [2025-03-04 15:30:02,004 INFO L125 PetriNetUnfolderBase]: For 10217/10217 co-relation queries the response was YES. [2025-03-04 15:30:02,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21120 conditions, 7353 events. 4655/7353 cut-off events. For 10217/10217 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 40111 event pairs, 1739 based on Foata normal form. 146/6305 useless extension candidates. Maximal degree in co-relation 20873. Up to 3462 conditions per place. [2025-03-04 15:30:02,020 INFO L140 encePairwiseOnDemand]: 55/59 looper letters, 0 selfloop transitions, 0 changer transitions 126/126 dead transitions. [2025-03-04 15:30:02,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 126 transitions, 876 flow [2025-03-04 15:30:02,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:30:02,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:30:02,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 132 transitions. [2025-03-04 15:30:02,021 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.559322033898305 [2025-03-04 15:30:02,021 INFO L175 Difference]: Start difference. First operand has 78 places, 100 transitions, 545 flow. Second operand 4 states and 132 transitions. [2025-03-04 15:30:02,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 126 transitions, 876 flow [2025-03-04 15:30:02,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 126 transitions, 856 flow, removed 4 selfloop flow, removed 6 redundant places. [2025-03-04 15:30:02,035 INFO L231 Difference]: Finished difference. Result has 74 places, 0 transitions, 0 flow [2025-03-04 15:30:02,035 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=515, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=74, PETRI_TRANSITIONS=0} [2025-03-04 15:30:02,036 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 17 predicate places. [2025-03-04 15:30:02,036 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 0 transitions, 0 flow [2025-03-04 15:30:02,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:30:02,038 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 23 remaining) [2025-03-04 15:30:02,038 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 23 remaining) [2025-03-04 15:30:02,038 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 23 remaining) [2025-03-04 15:30:02,038 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 23 remaining) [2025-03-04 15:30:02,038 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 23 remaining) [2025-03-04 15:30:02,038 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 23 remaining) [2025-03-04 15:30:02,038 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 23 remaining) [2025-03-04 15:30:02,038 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 23 remaining) [2025-03-04 15:30:02,038 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 23 remaining) [2025-03-04 15:30:02,038 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 23 remaining) [2025-03-04 15:30:02,038 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 23 remaining) [2025-03-04 15:30:02,038 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 23 remaining) [2025-03-04 15:30:02,038 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 23 remaining) [2025-03-04 15:30:02,038 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 23 remaining) [2025-03-04 15:30:02,038 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 23 remaining) [2025-03-04 15:30:02,038 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 23 remaining) [2025-03-04 15:30:02,038 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 23 remaining) [2025-03-04 15:30:02,038 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 23 remaining) [2025-03-04 15:30:02,038 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 23 remaining) [2025-03-04 15:30:02,038 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 23 remaining) [2025-03-04 15:30:02,038 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 23 remaining) [2025-03-04 15:30:02,038 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 23 remaining) [2025-03-04 15:30:02,038 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 23 remaining) [2025-03-04 15:30:02,045 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:30:02,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:30:02,239 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:30:02,243 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 15:30:02,243 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 15:30:02,247 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 03:30:02 BasicIcfg [2025-03-04 15:30:02,247 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 15:30:02,248 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 15:30:02,248 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 15:30:02,248 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 15:30:02,248 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:29:47" (3/4) ... [2025-03-04 15:30:02,249 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 15:30:02,251 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-04 15:30:02,251 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-04 15:30:02,251 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-03-04 15:30:02,256 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 150 nodes and edges [2025-03-04 15:30:02,256 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 65 nodes and edges [2025-03-04 15:30:02,257 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2025-03-04 15:30:02,257 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 15:30:02,319 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 15:30:02,320 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 15:30:02,320 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 15:30:02,320 INFO L158 Benchmark]: Toolchain (without parser) took 15552.69ms. Allocated memory was 142.6MB in the beginning and 453.0MB in the end (delta: 310.4MB). Free memory was 110.9MB in the beginning and 176.6MB in the end (delta: -65.7MB). Peak memory consumption was 240.5MB. Max. memory is 16.1GB. [2025-03-04 15:30:02,321 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 125.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:30:02,321 INFO L158 Benchmark]: CACSL2BoogieTranslator took 203.48ms. Allocated memory is still 142.6MB. Free memory was 110.9MB in the beginning and 99.4MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:30:02,322 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.63ms. Allocated memory is still 142.6MB. Free memory was 99.4MB in the beginning and 97.3MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:30:02,322 INFO L158 Benchmark]: Boogie Preprocessor took 41.53ms. Allocated memory is still 142.6MB. Free memory was 97.3MB in the beginning and 95.2MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:30:02,323 INFO L158 Benchmark]: IcfgBuilder took 669.36ms. Allocated memory is still 142.6MB. Free memory was 95.2MB in the beginning and 103.3MB in the end (delta: -8.1MB). Peak memory consumption was 64.8MB. Max. memory is 16.1GB. [2025-03-04 15:30:02,323 INFO L158 Benchmark]: TraceAbstraction took 14528.03ms. Allocated memory was 142.6MB in the beginning and 453.0MB in the end (delta: 310.4MB). Free memory was 103.3MB in the beginning and 183.4MB in the end (delta: -80.1MB). Peak memory consumption was 267.9MB. Max. memory is 16.1GB. [2025-03-04 15:30:02,323 INFO L158 Benchmark]: Witness Printer took 72.02ms. Allocated memory is still 453.0MB. Free memory was 183.4MB in the beginning and 176.6MB in the end (delta: 6.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:30:02,324 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 125.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 203.48ms. Allocated memory is still 142.6MB. Free memory was 110.9MB in the beginning and 99.4MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.63ms. Allocated memory is still 142.6MB. Free memory was 99.4MB in the beginning and 97.3MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.53ms. Allocated memory is still 142.6MB. Free memory was 97.3MB in the beginning and 95.2MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 669.36ms. Allocated memory is still 142.6MB. Free memory was 95.2MB in the beginning and 103.3MB in the end (delta: -8.1MB). Peak memory consumption was 64.8MB. Max. memory is 16.1GB. * TraceAbstraction took 14528.03ms. Allocated memory was 142.6MB in the beginning and 453.0MB in the end (delta: 310.4MB). Free memory was 103.3MB in the beginning and 183.4MB in the end (delta: -80.1MB). Peak memory consumption was 267.9MB. Max. memory is 16.1GB. * Witness Printer took 72.02ms. Allocated memory is still 453.0MB. Free memory was 183.4MB in the beginning and 176.6MB in the end (delta: 6.8MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 66]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 66]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 77 locations, 23 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.4s, OverallIterations: 20, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 8.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1924 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1794 mSDsluCounter, 1626 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1568 mSDsCounter, 395 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5851 IncrementalHoareTripleChecker+Invalid, 6246 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 395 mSolverCounterUnsat, 58 mSDtfsCounter, 5851 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 670 GetRequests, 480 SyntacticMatches, 6 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 466 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=847occurred in iteration=8, InterpolantAutomatonStates: 141, 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.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 681 NumberOfCodeBlocks, 501 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 901 ConstructedInterpolants, 0 QuantifiedInterpolants, 2395 SizeOfPredicates, 44 NumberOfNonLiveVariables, 2041 ConjunctsInSsa, 77 ConjunctsInUnsatCore, 42 InterpolantComputations, 10 PerfectInterpolantSequences, 581/719 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 14 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 15:30:02,338 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