./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/popl20-more-inc-subseq.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-inc-subseq.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 69f7b2e4777088b02df05d348ae0a210dcd9618a97428b10acd3ef63d9199610 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:29:19,951 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:29:20,014 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:20,019 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:29:20,019 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:29:20,040 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:29:20,041 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:29:20,041 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:29:20,042 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:29:20,042 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:29:20,042 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:29:20,043 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:29:20,043 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:29:20,043 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:29:20,043 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:29:20,043 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:29:20,044 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:29:20,044 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:29:20,044 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:29:20,044 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:29:20,044 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:29:20,044 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:29:20,044 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:29:20,044 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:29:20,044 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:29:20,044 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:29:20,044 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:29:20,044 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:29:20,044 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:29:20,045 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:29:20,045 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:29:20,045 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:29:20,045 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:29:20,045 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:29:20,045 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:29:20,046 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:29:20,046 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:29:20,046 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:29:20,046 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:29:20,046 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:29:20,046 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:29:20,046 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:29:20,046 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:29:20,046 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:29:20,046 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:29:20,046 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 -> 69f7b2e4777088b02df05d348ae0a210dcd9618a97428b10acd3ef63d9199610 [2025-03-04 15:29:20,260 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:29:20,268 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:29:20,270 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:29:20,273 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:29:20,273 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:29:20,274 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-inc-subseq.wvr.c [2025-03-04 15:29:21,427 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7edd3f4e4/b3e210bec3454e7ab11a6851a5bf913b/FLAGcc9f4216a [2025-03-04 15:29:21,656 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:29:21,656 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-inc-subseq.wvr.c [2025-03-04 15:29:21,662 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7edd3f4e4/b3e210bec3454e7ab11a6851a5bf913b/FLAGcc9f4216a [2025-03-04 15:29:22,003 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7edd3f4e4/b3e210bec3454e7ab11a6851a5bf913b [2025-03-04 15:29:22,004 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:29:22,005 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:29:22,006 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:29:22,006 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:29:22,009 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:29:22,009 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:29:22" (1/1) ... [2025-03-04 15:29:22,010 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1482b34e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:22, skipping insertion in model container [2025-03-04 15:29:22,010 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:29:22" (1/1) ... [2025-03-04 15:29:22,020 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:29:22,153 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:29:22,163 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:29:22,186 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:29:22,202 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:29:22,203 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:22 WrapperNode [2025-03-04 15:29:22,203 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:29:22,204 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:29:22,204 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:29:22,205 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:29:22,209 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:22" (1/1) ... [2025-03-04 15:29:22,214 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:22" (1/1) ... [2025-03-04 15:29:22,237 INFO L138 Inliner]: procedures = 23, calls = 36, calls flagged for inlining = 12, calls inlined = 14, statements flattened = 187 [2025-03-04 15:29:22,237 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:29:22,238 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:29:22,238 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:29:22,238 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:29:22,245 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:22" (1/1) ... [2025-03-04 15:29:22,245 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:22" (1/1) ... [2025-03-04 15:29:22,247 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:22" (1/1) ... [2025-03-04 15:29:22,268 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-03-04 15:29:22,269 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:22" (1/1) ... [2025-03-04 15:29:22,269 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:22" (1/1) ... [2025-03-04 15:29:22,278 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:22" (1/1) ... [2025-03-04 15:29:22,280 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:22" (1/1) ... [2025-03-04 15:29:22,281 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:22" (1/1) ... [2025-03-04 15:29:22,282 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:22" (1/1) ... [2025-03-04 15:29:22,287 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:29:22,288 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:29:22,288 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:29:22,288 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:29:22,289 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:22" (1/1) ... [2025-03-04 15:29:22,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:29:22,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:22,313 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:22,317 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:22,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:29:22,334 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 15:29:22,334 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 15:29:22,334 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 15:29:22,334 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 15:29:22,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:29:22,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 15:29:22,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:29:22,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:29:22,334 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 15:29:22,334 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 15:29:22,335 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 15:29:22,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:29:22,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:29:22,335 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:29:22,335 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:29:22,336 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:22,411 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:29:22,412 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:29:22,684 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:29:22,684 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:29:22,868 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:29:22,869 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:29:22,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:29:22 BoogieIcfgContainer [2025-03-04 15:29:22,870 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:29:22,872 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:29:22,872 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:29:22,875 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:29:22,875 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:29:22" (1/3) ... [2025-03-04 15:29:22,877 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b20e026 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:29:22, skipping insertion in model container [2025-03-04 15:29:22,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:22" (2/3) ... [2025-03-04 15:29:22,877 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b20e026 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:29:22, skipping insertion in model container [2025-03-04 15:29:22,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:29:22" (3/3) ... [2025-03-04 15:29:22,878 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-inc-subseq.wvr.c [2025-03-04 15:29:22,891 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:29:22,892 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-inc-subseq.wvr.c that has 3 procedures, 39 locations, 1 initial locations, 4 loop locations, and 10 error locations. [2025-03-04 15:29:22,892 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:29:22,953 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 15:29:22,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 43 transitions, 100 flow [2025-03-04 15:29:23,007 INFO L124 PetriNetUnfolderBase]: 5/41 cut-off events. [2025-03-04 15:29:23,011 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 15:29:23,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 41 events. 5/41 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 90 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 29. Up to 2 conditions per place. [2025-03-04 15:29:23,016 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 43 transitions, 100 flow [2025-03-04 15:29:23,018 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 39 transitions, 87 flow [2025-03-04 15:29:23,024 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:29:23,034 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;@11b4869e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:29:23,035 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-03-04 15:29:23,039 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:29:23,040 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-03-04 15:29:23,040 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:29:23,041 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:23,042 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 15:29:23,042 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:29:23,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:23,048 INFO L85 PathProgramCache]: Analyzing trace with hash 512980, now seen corresponding path program 1 times [2025-03-04 15:29:23,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:23,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440808728] [2025-03-04 15:29:23,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:23,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:23,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:29:23,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:29:23,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:23,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:23,249 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:23,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:23,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440808728] [2025-03-04 15:29:23,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440808728] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:29:23,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:29:23,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:29:23,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940840862] [2025-03-04 15:29:23,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:29:23,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:29:23,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:23,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:29:23,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:29:23,293 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 43 [2025-03-04 15:29:23,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 39 transitions, 87 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:23,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:23,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 43 [2025-03-04 15:29:23,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:23,475 INFO L124 PetriNetUnfolderBase]: 237/406 cut-off events. [2025-03-04 15:29:23,476 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-03-04 15:29:23,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 833 conditions, 406 events. 237/406 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1683 event pairs, 171 based on Foata normal form. 2/291 useless extension candidates. Maximal degree in co-relation 757. Up to 391 conditions per place. [2025-03-04 15:29:23,482 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 31 selfloop transitions, 7 changer transitions 0/43 dead transitions. [2025-03-04 15:29:23,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 43 transitions, 171 flow [2025-03-04 15:29:23,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:29:23,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:29:23,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2025-03-04 15:29:23,494 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4186046511627907 [2025-03-04 15:29:23,495 INFO L175 Difference]: Start difference. First operand has 41 places, 39 transitions, 87 flow. Second operand 4 states and 72 transitions. [2025-03-04 15:29:23,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 43 transitions, 171 flow [2025-03-04 15:29:23,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 43 transitions, 166 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:29:23,501 INFO L231 Difference]: Finished difference. Result has 42 places, 43 transitions, 138 flow [2025-03-04 15:29:23,502 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=138, PETRI_PLACES=42, PETRI_TRANSITIONS=43} [2025-03-04 15:29:23,506 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 1 predicate places. [2025-03-04 15:29:23,506 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 43 transitions, 138 flow [2025-03-04 15:29:23,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:23,507 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:23,507 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-04 15:29:23,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:29:23,507 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:29:23,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:23,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1897252631, now seen corresponding path program 1 times [2025-03-04 15:29:23,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:23,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967709505] [2025-03-04 15:29:23,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:23,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:23,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:29:23,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:29:23,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:23,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:23,632 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:23,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:23,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967709505] [2025-03-04 15:29:23,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967709505] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:29:23,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724513253] [2025-03-04 15:29:23,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:23,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:23,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:23,635 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:23,636 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:23,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:29:23,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:29:23,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:23,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:23,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:29:23,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:29:23,726 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:23,726 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:29:23,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1724513253] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:29:23,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:29:23,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-04 15:29:23,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947842122] [2025-03-04 15:29:23,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:29:23,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:29:23,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:23,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:29:23,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:29:23,742 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 43 [2025-03-04 15:29:23,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 43 transitions, 138 flow. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 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:23,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:23,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 43 [2025-03-04 15:29:23,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:23,892 INFO L124 PetriNetUnfolderBase]: 237/404 cut-off events. [2025-03-04 15:29:23,892 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-03-04 15:29:23,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 845 conditions, 404 events. 237/404 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1683 event pairs, 171 based on Foata normal form. 2/292 useless extension candidates. Maximal degree in co-relation 795. Up to 381 conditions per place. [2025-03-04 15:29:23,894 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 24 selfloop transitions, 12 changer transitions 0/41 dead transitions. [2025-03-04 15:29:23,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 41 transitions, 202 flow [2025-03-04 15:29:23,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:29:23,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:29:23,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2025-03-04 15:29:23,896 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.31007751937984496 [2025-03-04 15:29:23,896 INFO L175 Difference]: Start difference. First operand has 42 places, 43 transitions, 138 flow. Second operand 6 states and 80 transitions. [2025-03-04 15:29:23,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 41 transitions, 202 flow [2025-03-04 15:29:23,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 41 transitions, 202 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:29:23,898 INFO L231 Difference]: Finished difference. Result has 45 places, 41 transitions, 154 flow [2025-03-04 15:29:23,898 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=154, PETRI_PLACES=45, PETRI_TRANSITIONS=41} [2025-03-04 15:29:23,898 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 4 predicate places. [2025-03-04 15:29:23,898 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 41 transitions, 154 flow [2025-03-04 15:29:23,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 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:23,899 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:23,899 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-03-04 15:29:23,906 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:24,101 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:24,101 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:29:24,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:24,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1314711013, now seen corresponding path program 1 times [2025-03-04 15:29:24,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:24,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232247194] [2025-03-04 15:29:24,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:24,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:24,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:29:24,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:29:24,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:24,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:24,192 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:24,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:24,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232247194] [2025-03-04 15:29:24,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232247194] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:29:24,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142410097] [2025-03-04 15:29:24,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:24,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:24,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:24,195 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:24,197 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:24,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:29:24,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:29:24,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:24,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:24,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:29:24,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:29:24,278 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:24,278 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:29:24,311 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:24,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142410097] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:29:24,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:29:24,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-03-04 15:29:24,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447509798] [2025-03-04 15:29:24,312 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:29:24,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 15:29:24,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:24,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 15:29:24,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 15:29:24,330 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 43 [2025-03-04 15:29:24,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 41 transitions, 154 flow. Second operand has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 12 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:24,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:24,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 43 [2025-03-04 15:29:24,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:24,477 INFO L124 PetriNetUnfolderBase]: 243/428 cut-off events. [2025-03-04 15:29:24,477 INFO L125 PetriNetUnfolderBase]: For 53/53 co-relation queries the response was YES. [2025-03-04 15:29:24,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 939 conditions, 428 events. 243/428 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1846 event pairs, 171 based on Foata normal form. 6/319 useless extension candidates. Maximal degree in co-relation 797. Up to 392 conditions per place. [2025-03-04 15:29:24,482 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 29 selfloop transitions, 25 changer transitions 0/59 dead transitions. [2025-03-04 15:29:24,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 59 transitions, 376 flow [2025-03-04 15:29:24,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:29:24,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 15:29:24,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 130 transitions. [2025-03-04 15:29:24,485 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3023255813953488 [2025-03-04 15:29:24,485 INFO L175 Difference]: Start difference. First operand has 45 places, 41 transitions, 154 flow. Second operand 10 states and 130 transitions. [2025-03-04 15:29:24,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 59 transitions, 376 flow [2025-03-04 15:29:24,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 59 transitions, 318 flow, removed 12 selfloop flow, removed 5 redundant places. [2025-03-04 15:29:24,487 INFO L231 Difference]: Finished difference. Result has 52 places, 59 transitions, 294 flow [2025-03-04 15:29:24,487 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=294, PETRI_PLACES=52, PETRI_TRANSITIONS=59} [2025-03-04 15:29:24,488 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 11 predicate places. [2025-03-04 15:29:24,488 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 59 transitions, 294 flow [2025-03-04 15:29:24,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 12 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:24,488 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:24,488 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:24,495 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:24,689 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:24,690 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:29:24,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:24,691 INFO L85 PathProgramCache]: Analyzing trace with hash -878762704, now seen corresponding path program 1 times [2025-03-04 15:29:24,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:24,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546594867] [2025-03-04 15:29:24,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:24,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:24,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:29:24,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:29:24,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:24,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:24,775 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:24,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:24,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546594867] [2025-03-04 15:29:24,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546594867] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:29:24,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:29:24,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:29:24,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131482469] [2025-03-04 15:29:24,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:29:24,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:29:24,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:24,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:29:24,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:29:24,776 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2025-03-04 15:29:24,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 59 transitions, 294 flow. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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:24,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:24,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2025-03-04 15:29:24,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:24,858 INFO L124 PetriNetUnfolderBase]: 371/647 cut-off events. [2025-03-04 15:29:24,859 INFO L125 PetriNetUnfolderBase]: For 78/78 co-relation queries the response was YES. [2025-03-04 15:29:24,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1400 conditions, 647 events. 371/647 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3051 event pairs, 118 based on Foata normal form. 0/492 useless extension candidates. Maximal degree in co-relation 1333. Up to 347 conditions per place. [2025-03-04 15:29:24,862 INFO L140 encePairwiseOnDemand]: 39/43 looper letters, 68 selfloop transitions, 2 changer transitions 0/77 dead transitions. [2025-03-04 15:29:24,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 77 transitions, 473 flow [2025-03-04 15:29:24,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:29:24,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:29:24,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2025-03-04 15:29:24,863 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.627906976744186 [2025-03-04 15:29:24,863 INFO L175 Difference]: Start difference. First operand has 52 places, 59 transitions, 294 flow. Second operand 3 states and 81 transitions. [2025-03-04 15:29:24,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 77 transitions, 473 flow [2025-03-04 15:29:24,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 77 transitions, 449 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-03-04 15:29:24,866 INFO L231 Difference]: Finished difference. Result has 53 places, 60 transitions, 284 flow [2025-03-04 15:29:24,867 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=284, PETRI_PLACES=53, PETRI_TRANSITIONS=60} [2025-03-04 15:29:24,867 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 12 predicate places. [2025-03-04 15:29:24,867 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 60 transitions, 284 flow [2025-03-04 15:29:24,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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:24,867 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:24,867 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:24,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 15:29:24,867 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:29:24,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:24,868 INFO L85 PathProgramCache]: Analyzing trace with hash -878762737, now seen corresponding path program 1 times [2025-03-04 15:29:24,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:24,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409559858] [2025-03-04 15:29:24,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:24,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:24,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:29:24,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:29:24,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:24,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:24,953 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:24,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:24,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409559858] [2025-03-04 15:29:24,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409559858] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:29:24,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:29:24,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:29:24,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101425559] [2025-03-04 15:29:24,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:29:24,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:29:24,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:24,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:29:24,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:29:24,954 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2025-03-04 15:29:24,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 60 transitions, 284 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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:24,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:24,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2025-03-04 15:29:24,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:25,108 INFO L124 PetriNetUnfolderBase]: 488/890 cut-off events. [2025-03-04 15:29:25,108 INFO L125 PetriNetUnfolderBase]: For 97/97 co-relation queries the response was YES. [2025-03-04 15:29:25,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2031 conditions, 890 events. 488/890 cut-off events. For 97/97 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4580 event pairs, 390 based on Foata normal form. 37/728 useless extension candidates. Maximal degree in co-relation 1937. Up to 626 conditions per place. [2025-03-04 15:29:25,116 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 75 selfloop transitions, 5 changer transitions 3/90 dead transitions. [2025-03-04 15:29:25,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 90 transitions, 586 flow [2025-03-04 15:29:25,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:29:25,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:29:25,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2025-03-04 15:29:25,117 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5116279069767442 [2025-03-04 15:29:25,117 INFO L175 Difference]: Start difference. First operand has 53 places, 60 transitions, 284 flow. Second operand 5 states and 110 transitions. [2025-03-04 15:29:25,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 90 transitions, 586 flow [2025-03-04 15:29:25,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 90 transitions, 583 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:29:25,119 INFO L231 Difference]: Finished difference. Result has 58 places, 62 transitions, 321 flow [2025-03-04 15:29:25,120 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=321, PETRI_PLACES=58, PETRI_TRANSITIONS=62} [2025-03-04 15:29:25,121 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 17 predicate places. [2025-03-04 15:29:25,121 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 62 transitions, 321 flow [2025-03-04 15:29:25,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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:25,122 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:25,122 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:25,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:29:25,122 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:29:25,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:25,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1219910374, now seen corresponding path program 1 times [2025-03-04 15:29:25,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:25,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573904743] [2025-03-04 15:29:25,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:25,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:25,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:29:25,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:29:25,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:25,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:25,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:29:25,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:25,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573904743] [2025-03-04 15:29:25,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573904743] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:29:25,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:29:25,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:29:25,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783084011] [2025-03-04 15:29:25,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:29:25,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:29:25,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:25,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:29:25,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:29:25,206 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2025-03-04 15:29:25,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 62 transitions, 321 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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:25,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:25,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2025-03-04 15:29:25,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:25,326 INFO L124 PetriNetUnfolderBase]: 486/888 cut-off events. [2025-03-04 15:29:25,326 INFO L125 PetriNetUnfolderBase]: For 149/149 co-relation queries the response was YES. [2025-03-04 15:29:25,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2135 conditions, 888 events. 486/888 cut-off events. For 149/149 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4508 event pairs, 390 based on Foata normal form. 2/684 useless extension candidates. Maximal degree in co-relation 2039. Up to 850 conditions per place. [2025-03-04 15:29:25,329 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 46 selfloop transitions, 7 changer transitions 0/60 dead transitions. [2025-03-04 15:29:25,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 60 transitions, 411 flow [2025-03-04 15:29:25,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:29:25,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:29:25,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2025-03-04 15:29:25,331 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49612403100775193 [2025-03-04 15:29:25,331 INFO L175 Difference]: Start difference. First operand has 58 places, 62 transitions, 321 flow. Second operand 3 states and 64 transitions. [2025-03-04 15:29:25,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 60 transitions, 411 flow [2025-03-04 15:29:25,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 60 transitions, 399 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-04 15:29:25,334 INFO L231 Difference]: Finished difference. Result has 58 places, 60 transitions, 307 flow [2025-03-04 15:29:25,335 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=307, PETRI_PLACES=58, PETRI_TRANSITIONS=60} [2025-03-04 15:29:25,335 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 17 predicate places. [2025-03-04 15:29:25,336 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 60 transitions, 307 flow [2025-03-04 15:29:25,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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:25,336 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:25,336 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:25,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 15:29:25,337 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:29:25,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:25,337 INFO L85 PathProgramCache]: Analyzing trace with hash 783525672, now seen corresponding path program 1 times [2025-03-04 15:29:25,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:25,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988486749] [2025-03-04 15:29:25,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:25,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:25,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:29:25,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:29:25,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:25,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:25,401 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:29:25,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:25,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988486749] [2025-03-04 15:29:25,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988486749] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:29:25,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170447810] [2025-03-04 15:29:25,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:25,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:25,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:25,404 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:25,406 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:25,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:29:25,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:29:25,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:25,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:25,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 15:29:25,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:29:25,559 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:25,559 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:29:25,636 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:25,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1170447810] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:29:25,636 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:29:25,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 7, 7] total 14 [2025-03-04 15:29:25,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888528082] [2025-03-04 15:29:25,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:29:25,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 15:29:25,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:25,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 15:29:25,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-03-04 15:29:25,679 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 43 [2025-03-04 15:29:25,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 60 transitions, 307 flow. Second operand has 15 states, 15 states have (on average 9.2) internal successors, (138), 15 states have internal predecessors, (138), 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:25,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:25,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 43 [2025-03-04 15:29:25,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:26,055 INFO L124 PetriNetUnfolderBase]: 693/1250 cut-off events. [2025-03-04 15:29:26,055 INFO L125 PetriNetUnfolderBase]: For 173/173 co-relation queries the response was YES. [2025-03-04 15:29:26,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2940 conditions, 1250 events. 693/1250 cut-off events. For 173/173 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 6623 event pairs, 248 based on Foata normal form. 0/995 useless extension candidates. Maximal degree in co-relation 2841. Up to 359 conditions per place. [2025-03-04 15:29:26,064 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 83 selfloop transitions, 32 changer transitions 3/123 dead transitions. [2025-03-04 15:29:26,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 123 transitions, 710 flow [2025-03-04 15:29:26,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 15:29:26,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 15:29:26,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 185 transitions. [2025-03-04 15:29:26,067 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35852713178294576 [2025-03-04 15:29:26,067 INFO L175 Difference]: Start difference. First operand has 58 places, 60 transitions, 307 flow. Second operand 12 states and 185 transitions. [2025-03-04 15:29:26,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 123 transitions, 710 flow [2025-03-04 15:29:26,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 123 transitions, 703 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:29:26,070 INFO L231 Difference]: Finished difference. Result has 68 places, 63 transitions, 375 flow [2025-03-04 15:29:26,070 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=375, PETRI_PLACES=68, PETRI_TRANSITIONS=63} [2025-03-04 15:29:26,070 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 27 predicate places. [2025-03-04 15:29:26,070 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 63 transitions, 375 flow [2025-03-04 15:29:26,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 9.2) internal successors, (138), 15 states have internal predecessors, (138), 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:26,071 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:26,071 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:26,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 15:29:26,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:26,271 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:29:26,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:26,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1247875649, now seen corresponding path program 1 times [2025-03-04 15:29:26,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:26,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463481958] [2025-03-04 15:29:26,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:26,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:26,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:29:26,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:29:26,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:26,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:26,390 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:29:26,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:26,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463481958] [2025-03-04 15:29:26,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463481958] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:29:26,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858475560] [2025-03-04 15:29:26,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:26,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:26,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:26,393 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:26,394 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:26,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:29:26,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:29:26,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:26,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:26,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:29:26,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:29:26,475 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 15:29:26,475 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:29:26,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858475560] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:29:26,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:29:26,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [4] total 5 [2025-03-04 15:29:26,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392946918] [2025-03-04 15:29:26,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:29:26,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:29:26,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:26,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:29:26,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 15:29:26,477 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2025-03-04 15:29:26,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 63 transitions, 375 flow. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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:26,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:26,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2025-03-04 15:29:26,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:26,580 INFO L124 PetriNetUnfolderBase]: 564/1040 cut-off events. [2025-03-04 15:29:26,581 INFO L125 PetriNetUnfolderBase]: For 421/421 co-relation queries the response was YES. [2025-03-04 15:29:26,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2611 conditions, 1040 events. 564/1040 cut-off events. For 421/421 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 5301 event pairs, 435 based on Foata normal form. 0/942 useless extension candidates. Maximal degree in co-relation 2501. Up to 998 conditions per place. [2025-03-04 15:29:26,585 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 46 selfloop transitions, 1 changer transitions 7/61 dead transitions. [2025-03-04 15:29:26,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 61 transitions, 475 flow [2025-03-04 15:29:26,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:29:26,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:29:26,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2025-03-04 15:29:26,586 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46511627906976744 [2025-03-04 15:29:26,586 INFO L175 Difference]: Start difference. First operand has 68 places, 63 transitions, 375 flow. Second operand 3 states and 60 transitions. [2025-03-04 15:29:26,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 61 transitions, 475 flow [2025-03-04 15:29:26,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 61 transitions, 464 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:29:26,591 INFO L231 Difference]: Finished difference. Result has 65 places, 54 transitions, 326 flow [2025-03-04 15:29:26,591 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=326, PETRI_PLACES=65, PETRI_TRANSITIONS=54} [2025-03-04 15:29:26,592 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 24 predicate places. [2025-03-04 15:29:26,593 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 54 transitions, 326 flow [2025-03-04 15:29:26,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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:26,593 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:26,593 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1] [2025-03-04 15:29:26,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 15:29:26,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:26,793 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:29:26,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:26,794 INFO L85 PathProgramCache]: Analyzing trace with hash 627191962, now seen corresponding path program 2 times [2025-03-04 15:29:26,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:26,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769463650] [2025-03-04 15:29:26,794 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:29:26,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:26,801 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 15:29:26,804 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:26,804 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:29:26,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:26,825 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:26,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:26,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769463650] [2025-03-04 15:29:26,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769463650] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:29:26,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852713544] [2025-03-04 15:29:26,826 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:29:26,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:26,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:26,828 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:26,830 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:26,867 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 15:29:26,875 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:26,875 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:29:26,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:26,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:29:26,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:29:26,897 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:26,898 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:29:26,916 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:26,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852713544] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:29:26,917 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:29:26,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 2 [2025-03-04 15:29:26,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905384986] [2025-03-04 15:29:26,917 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:29:26,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:29:26,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:26,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:29:26,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:29:26,924 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 43 [2025-03-04 15:29:26,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 54 transitions, 326 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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:26,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:26,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 43 [2025-03-04 15:29:26,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:27,009 INFO L124 PetriNetUnfolderBase]: 304/567 cut-off events. [2025-03-04 15:29:27,010 INFO L125 PetriNetUnfolderBase]: For 209/209 co-relation queries the response was YES. [2025-03-04 15:29:27,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1460 conditions, 567 events. 304/567 cut-off events. For 209/209 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2383 event pairs, 228 based on Foata normal form. 1/499 useless extension candidates. Maximal degree in co-relation 1442. Up to 532 conditions per place. [2025-03-04 15:29:27,013 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 32 selfloop transitions, 16 changer transitions 0/53 dead transitions. [2025-03-04 15:29:27,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 53 transitions, 412 flow [2025-03-04 15:29:27,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:29:27,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:29:27,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2025-03-04 15:29:27,014 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3081395348837209 [2025-03-04 15:29:27,014 INFO L175 Difference]: Start difference. First operand has 65 places, 54 transitions, 326 flow. Second operand 4 states and 53 transitions. [2025-03-04 15:29:27,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 53 transitions, 412 flow [2025-03-04 15:29:27,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 53 transitions, 409 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-04 15:29:27,016 INFO L231 Difference]: Finished difference. Result has 59 places, 53 transitions, 345 flow [2025-03-04 15:29:27,016 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=345, PETRI_PLACES=59, PETRI_TRANSITIONS=53} [2025-03-04 15:29:27,017 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 18 predicate places. [2025-03-04 15:29:27,017 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 53 transitions, 345 flow [2025-03-04 15:29:27,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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:27,017 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:27,017 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1] [2025-03-04 15:29:27,023 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:27,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:27,222 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:29:27,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:27,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1776773554, now seen corresponding path program 1 times [2025-03-04 15:29:27,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:27,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216690051] [2025-03-04 15:29:27,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:27,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:27,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:29:27,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:29:27,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:27,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:27,349 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:27,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:27,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216690051] [2025-03-04 15:29:27,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216690051] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:29:27,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634366435] [2025-03-04 15:29:27,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:27,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:27,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:27,352 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:27,354 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:27,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:29:27,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:29:27,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:27,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:27,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 15:29:27,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:29:27,442 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:27,442 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:29:27,569 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:27,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634366435] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:29:27,569 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:29:27,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2025-03-04 15:29:27,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131160157] [2025-03-04 15:29:27,570 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:29:27,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 15:29:27,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:27,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 15:29:27,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2025-03-04 15:29:27,616 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 43 [2025-03-04 15:29:27,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 53 transitions, 345 flow. Second operand has 24 states, 24 states have (on average 8.083333333333334) internal successors, (194), 24 states have internal predecessors, (194), 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:27,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:27,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 43 [2025-03-04 15:29:27,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:27,895 INFO L124 PetriNetUnfolderBase]: 322/639 cut-off events. [2025-03-04 15:29:27,895 INFO L125 PetriNetUnfolderBase]: For 524/524 co-relation queries the response was YES. [2025-03-04 15:29:27,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1729 conditions, 639 events. 322/639 cut-off events. For 524/524 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2731 event pairs, 228 based on Foata normal form. 12/576 useless extension candidates. Maximal degree in co-relation 1711. Up to 528 conditions per place. [2025-03-04 15:29:27,898 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 24 selfloop transitions, 60 changer transitions 0/89 dead transitions. [2025-03-04 15:29:27,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 89 transitions, 837 flow [2025-03-04 15:29:27,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 15:29:27,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-04 15:29:27,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 242 transitions. [2025-03-04 15:29:27,900 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2558139534883721 [2025-03-04 15:29:27,900 INFO L175 Difference]: Start difference. First operand has 59 places, 53 transitions, 345 flow. Second operand 22 states and 242 transitions. [2025-03-04 15:29:27,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 89 transitions, 837 flow [2025-03-04 15:29:27,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 89 transitions, 769 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:29:27,903 INFO L231 Difference]: Finished difference. Result has 83 places, 89 transitions, 767 flow [2025-03-04 15:29:27,903 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=767, PETRI_PLACES=83, PETRI_TRANSITIONS=89} [2025-03-04 15:29:27,903 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 42 predicate places. [2025-03-04 15:29:27,903 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 89 transitions, 767 flow [2025-03-04 15:29:27,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 8.083333333333334) internal successors, (194), 24 states have internal predecessors, (194), 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:27,904 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:27,904 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:27,911 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 15:29:28,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:28,108 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:29:28,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:28,109 INFO L85 PathProgramCache]: Analyzing trace with hash -2026239354, now seen corresponding path program 1 times [2025-03-04 15:29:28,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:28,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723897148] [2025-03-04 15:29:28,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:28,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:28,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:29:28,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:29:28,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:28,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:28,161 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 15:29:28,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:28,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723897148] [2025-03-04 15:29:28,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723897148] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:29:28,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269844750] [2025-03-04 15:29:28,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:28,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:28,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:28,166 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:28,167 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:28,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:29:28,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:29:28,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:28,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:28,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:29:28,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:29:28,247 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 15:29:28,247 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:29:28,270 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 15:29:28,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1269844750] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:29:28,270 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:29:28,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 5 [2025-03-04 15:29:28,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963260300] [2025-03-04 15:29:28,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:29:28,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 15:29:28,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:28,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 15:29:28,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 15:29:28,271 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2025-03-04 15:29:28,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 89 transitions, 767 flow. Second operand has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 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:28,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:28,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2025-03-04 15:29:28,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:28,457 INFO L124 PetriNetUnfolderBase]: 721/1314 cut-off events. [2025-03-04 15:29:28,457 INFO L125 PetriNetUnfolderBase]: For 593/593 co-relation queries the response was YES. [2025-03-04 15:29:28,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3354 conditions, 1314 events. 721/1314 cut-off events. For 593/593 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 6247 event pairs, 93 based on Foata normal form. 0/1185 useless extension candidates. Maximal degree in co-relation 3330. Up to 303 conditions per place. [2025-03-04 15:29:28,462 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 133 selfloop transitions, 5 changer transitions 0/144 dead transitions. [2025-03-04 15:29:28,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 144 transitions, 1183 flow [2025-03-04 15:29:28,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:29:28,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:29:28,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 148 transitions. [2025-03-04 15:29:28,463 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5736434108527132 [2025-03-04 15:29:28,463 INFO L175 Difference]: Start difference. First operand has 83 places, 89 transitions, 767 flow. Second operand 6 states and 148 transitions. [2025-03-04 15:29:28,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 144 transitions, 1183 flow [2025-03-04 15:29:28,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 144 transitions, 1029 flow, removed 47 selfloop flow, removed 9 redundant places. [2025-03-04 15:29:28,469 INFO L231 Difference]: Finished difference. Result has 82 places, 92 transitions, 649 flow [2025-03-04 15:29:28,469 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=613, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=649, PETRI_PLACES=82, PETRI_TRANSITIONS=92} [2025-03-04 15:29:28,469 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 41 predicate places. [2025-03-04 15:29:28,469 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 92 transitions, 649 flow [2025-03-04 15:29:28,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 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:28,469 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:28,470 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:28,475 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:28,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:28,674 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:29:28,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:28,674 INFO L85 PathProgramCache]: Analyzing trace with hash 741911505, now seen corresponding path program 2 times [2025-03-04 15:29:28,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:28,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538126174] [2025-03-04 15:29:28,675 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:29:28,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:28,680 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-04 15:29:28,688 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 15:29:28,688 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:29:28,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:28,732 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 15:29:28,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:28,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538126174] [2025-03-04 15:29:28,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538126174] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:29:28,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488968817] [2025-03-04 15:29:28,732 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:29:28,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:28,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:28,734 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:28,736 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:28,785 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-04 15:29:28,804 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 15:29:28,804 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:29:28,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:28,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:29:28,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:29:28,828 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 15:29:28,829 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:29:28,865 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 15:29:28,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488968817] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:29:28,865 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:29:28,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 2 [2025-03-04 15:29:28,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290381742] [2025-03-04 15:29:28,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:29:28,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:29:28,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:28,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:29:28,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:29:28,866 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2025-03-04 15:29:28,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 92 transitions, 649 flow. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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:28,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:28,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2025-03-04 15:29:28,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:28,971 INFO L124 PetriNetUnfolderBase]: 695/1268 cut-off events. [2025-03-04 15:29:28,971 INFO L125 PetriNetUnfolderBase]: For 761/761 co-relation queries the response was YES. [2025-03-04 15:29:28,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3287 conditions, 1268 events. 695/1268 cut-off events. For 761/761 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 6217 event pairs, 441 based on Foata normal form. 20/1179 useless extension candidates. Maximal degree in co-relation 3260. Up to 1019 conditions per place. [2025-03-04 15:29:28,975 INFO L140 encePairwiseOnDemand]: 39/43 looper letters, 56 selfloop transitions, 1 changer transitions 40/100 dead transitions. [2025-03-04 15:29:28,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 100 transitions, 849 flow [2025-03-04 15:29:28,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:29:28,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:29:28,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2025-03-04 15:29:28,976 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4418604651162791 [2025-03-04 15:29:28,976 INFO L175 Difference]: Start difference. First operand has 82 places, 92 transitions, 649 flow. Second operand 4 states and 76 transitions. [2025-03-04 15:29:28,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 100 transitions, 849 flow [2025-03-04 15:29:28,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 100 transitions, 831 flow, removed 4 selfloop flow, removed 5 redundant places. [2025-03-04 15:29:28,980 INFO L231 Difference]: Finished difference. Result has 79 places, 60 transitions, 516 flow [2025-03-04 15:29:28,981 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=621, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=516, PETRI_PLACES=79, PETRI_TRANSITIONS=60} [2025-03-04 15:29:28,982 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 38 predicate places. [2025-03-04 15:29:28,982 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 60 transitions, 516 flow [2025-03-04 15:29:28,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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:28,982 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:28,982 INFO L206 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1] [2025-03-04 15:29:28,990 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 15:29:29,183 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,SelfDestructingSolverStorable11 [2025-03-04 15:29:29,183 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:29:29,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:29,184 INFO L85 PathProgramCache]: Analyzing trace with hash 484993298, now seen corresponding path program 2 times [2025-03-04 15:29:29,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:29,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480145071] [2025-03-04 15:29:29,184 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:29:29,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:29,192 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-03-04 15:29:29,198 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 15:29:29,198 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:29:29,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:29,259 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 15:29:29,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:29,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480145071] [2025-03-04 15:29:29,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480145071] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:29:29,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693861544] [2025-03-04 15:29:29,260 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:29:29,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:29,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:29,262 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:29,263 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:29,312 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-03-04 15:29:29,332 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 15:29:29,332 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:29:29,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:29,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:29:29,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:29:29,368 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 15:29:29,368 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:29:29,404 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 15:29:29,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1693861544] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:29:29,404 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:29:29,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-03-04 15:29:29,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245275912] [2025-03-04 15:29:29,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:29:29,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:29:29,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:29,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:29:29,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:29:29,415 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 43 [2025-03-04 15:29:29,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 60 transitions, 516 flow. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:29,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:29,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 43 [2025-03-04 15:29:29,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:29,438 INFO L124 PetriNetUnfolderBase]: 12/111 cut-off events. [2025-03-04 15:29:29,438 INFO L125 PetriNetUnfolderBase]: For 325/325 co-relation queries the response was YES. [2025-03-04 15:29:29,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 462 conditions, 111 events. 12/111 cut-off events. For 325/325 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 193 event pairs, 0 based on Foata normal form. 2/112 useless extension candidates. Maximal degree in co-relation 438. Up to 45 conditions per place. [2025-03-04 15:29:29,439 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 0 selfloop transitions, 0 changer transitions 59/59 dead transitions. [2025-03-04 15:29:29,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 59 transitions, 608 flow [2025-03-04 15:29:29,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:29:29,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:29:29,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2025-03-04 15:29:29,440 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.20348837209302326 [2025-03-04 15:29:29,440 INFO L175 Difference]: Start difference. First operand has 79 places, 60 transitions, 516 flow. Second operand 4 states and 35 transitions. [2025-03-04 15:29:29,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 59 transitions, 608 flow [2025-03-04 15:29:29,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 59 transitions, 560 flow, removed 2 selfloop flow, removed 13 redundant places. [2025-03-04 15:29:29,443 INFO L231 Difference]: Finished difference. Result has 44 places, 0 transitions, 0 flow [2025-03-04 15:29:29,443 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=44, PETRI_TRANSITIONS=0} [2025-03-04 15:29:29,443 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 3 predicate places. [2025-03-04 15:29:29,443 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 0 transitions, 0 flow [2025-03-04 15:29:29,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:29,445 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 18 remaining) [2025-03-04 15:29:29,446 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 18 remaining) [2025-03-04 15:29:29,446 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2025-03-04 15:29:29,446 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2025-03-04 15:29:29,446 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2025-03-04 15:29:29,446 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2025-03-04 15:29:29,446 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2025-03-04 15:29:29,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2025-03-04 15:29:29,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 18 remaining) [2025-03-04 15:29:29,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 18 remaining) [2025-03-04 15:29:29,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 18 remaining) [2025-03-04 15:29:29,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 18 remaining) [2025-03-04 15:29:29,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2025-03-04 15:29:29,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2025-03-04 15:29:29,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2025-03-04 15:29:29,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2025-03-04 15:29:29,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2025-03-04 15:29:29,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2025-03-04 15:29:29,454 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:29,648 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,SelfDestructingSolverStorable12 [2025-03-04 15:29:29,648 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:29,653 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 15:29:29,653 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 15:29:29,658 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 03:29:29 BasicIcfg [2025-03-04 15:29:29,658 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 15:29:29,659 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 15:29:29,659 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 15:29:29,659 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 15:29:29,659 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:22" (3/4) ... [2025-03-04 15:29:29,660 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 15:29:29,662 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-04 15:29:29,662 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-04 15:29:29,665 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 103 nodes and edges [2025-03-04 15:29:29,665 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 40 nodes and edges [2025-03-04 15:29:29,666 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2025-03-04 15:29:29,666 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 15:29:29,717 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 15:29:29,717 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 15:29:29,717 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 15:29:29,718 INFO L158 Benchmark]: Toolchain (without parser) took 7712.51ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 110.0MB in the beginning and 120.4MB in the end (delta: -10.4MB). Peak memory consumption was 161.8MB. Max. memory is 16.1GB. [2025-03-04 15:29:29,718 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 127.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:29:29,718 INFO L158 Benchmark]: CACSL2BoogieTranslator took 197.43ms. Allocated memory is still 142.6MB. Free memory was 110.0MB in the beginning and 97.9MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:29:29,718 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.59ms. Allocated memory is still 142.6MB. Free memory was 97.9MB in the beginning and 96.7MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:29:29,718 INFO L158 Benchmark]: Boogie Preprocessor took 49.54ms. Allocated memory is still 142.6MB. Free memory was 96.7MB in the beginning and 94.0MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:29:29,719 INFO L158 Benchmark]: IcfgBuilder took 581.64ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 42.9MB in the end (delta: 51.1MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-03-04 15:29:29,720 INFO L158 Benchmark]: TraceAbstraction took 6786.67ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 42.9MB in the beginning and 125.6MB in the end (delta: -82.7MB). Peak memory consumption was 94.7MB. Max. memory is 16.1GB. [2025-03-04 15:29:29,720 INFO L158 Benchmark]: Witness Printer took 58.62ms. Allocated memory is still 318.8MB. Free memory was 125.6MB in the beginning and 120.4MB in the end (delta: 5.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:29:29,720 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.22ms. Allocated memory is still 201.3MB. Free memory is still 127.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 197.43ms. Allocated memory is still 142.6MB. Free memory was 110.0MB in the beginning and 97.9MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.59ms. Allocated memory is still 142.6MB. Free memory was 97.9MB in the beginning and 96.7MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.54ms. Allocated memory is still 142.6MB. Free memory was 96.7MB in the beginning and 94.0MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 581.64ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 42.9MB in the end (delta: 51.1MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 6786.67ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 42.9MB in the beginning and 125.6MB in the end (delta: -82.7MB). Peak memory consumption was 94.7MB. Max. memory is 16.1GB. * Witness Printer took 58.62ms. Allocated memory is still 318.8MB. Free memory was 125.6MB in the beginning and 120.4MB in the end (delta: 5.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: 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: 73]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 73]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 117]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 117]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 117]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 117]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 61 locations, 18 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: 6.7s, OverallIterations: 13, TraceHistogramMax: 11, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 571 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 526 mSDsluCounter, 231 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 213 mSDsCounter, 129 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1528 IncrementalHoareTripleChecker+Invalid, 1657 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 129 mSolverCounterUnsat, 18 mSDtfsCounter, 1528 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 339 GetRequests, 230 SyntacticMatches, 6 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=767occurred in iteration=10, InterpolantAutomatonStates: 86, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 334 NumberOfCodeBlocks, 310 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 437 ConstructedInterpolants, 0 QuantifiedInterpolants, 1395 SizeOfPredicates, 26 NumberOfNonLiveVariables, 1279 ConjunctsInSsa, 54 ConjunctsInUnsatCore, 29 InterpolantComputations, 6 PerfectInterpolantSequences, 616/840 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 10 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 15:29:29,732 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE