./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/parallel-ticket-2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/parallel-ticket-2.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 9c046e6043edd4a9981865f273deb13bc96b2518d014dd6435bf0abb656de540 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:52:03,468 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:52:03,516 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 06:52:03,522 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:52:03,527 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:52:03,545 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:52:03,546 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:52:03,546 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:52:03,546 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:52:03,546 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:52:03,547 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:52:03,547 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:52:03,547 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:52:03,547 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:52:03,547 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:52:03,547 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:52:03,547 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:52:03,547 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:52:03,548 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:52:03,548 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:52:03,548 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:52:03,548 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:52:03,548 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:52:03,548 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:52:03,548 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:52:03,548 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:52:03,548 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:52:03,548 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:52:03,548 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:52:03,548 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:52:03,549 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:52:03,549 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:52:03,549 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:52:03,549 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:52:03,549 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:52:03,549 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:52:03,549 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:52:03,549 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:52:03,549 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:52:03,549 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:52:03,549 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:52:03,549 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:52:03,550 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:52:03,550 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:52:03,550 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:52:03,550 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:52:03,550 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:52:03,550 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:52:03,550 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:52:03,550 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:52:03,550 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-jdk21/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 -> 9c046e6043edd4a9981865f273deb13bc96b2518d014dd6435bf0abb656de540 [2025-01-10 06:52:03,760 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:52:03,767 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:52:03,773 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:52:03,774 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:52:03,774 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:52:03,776 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-ticket-2.wvr.c [2025-01-10 06:52:05,081 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d393f3df0/9d5b3e00116045f49b3bf8a05cd82397/FLAGf8d7fb9ac [2025-01-10 06:52:05,366 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:52:05,366 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/parallel-ticket-2.wvr.c [2025-01-10 06:52:05,383 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d393f3df0/9d5b3e00116045f49b3bf8a05cd82397/FLAGf8d7fb9ac [2025-01-10 06:52:05,688 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d393f3df0/9d5b3e00116045f49b3bf8a05cd82397 [2025-01-10 06:52:05,690 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:52:05,692 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:52:05,693 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:52:05,693 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:52:05,697 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:52:05,698 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:52:05" (1/1) ... [2025-01-10 06:52:05,699 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cf1bf7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:05, skipping insertion in model container [2025-01-10 06:52:05,699 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:52:05" (1/1) ... [2025-01-10 06:52:05,714 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:52:05,870 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:52:05,879 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:52:05,900 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:52:05,915 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:52:05,917 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:05 WrapperNode [2025-01-10 06:52:05,917 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:52:05,918 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:52:05,919 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:52:05,919 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:52:05,925 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:05" (1/1) ... [2025-01-10 06:52:05,931 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:05" (1/1) ... [2025-01-10 06:52:05,951 INFO L138 Inliner]: procedures = 18, calls = 13, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 118 [2025-01-10 06:52:05,952 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:52:05,952 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:52:05,953 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:52:05,953 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:52:05,960 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:05" (1/1) ... [2025-01-10 06:52:05,961 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:05" (1/1) ... [2025-01-10 06:52:05,962 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:05" (1/1) ... [2025-01-10 06:52:05,976 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-10 06:52:05,977 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:05" (1/1) ... [2025-01-10 06:52:05,977 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:05" (1/1) ... [2025-01-10 06:52:05,980 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:05" (1/1) ... [2025-01-10 06:52:05,981 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:05" (1/1) ... [2025-01-10 06:52:05,982 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:05" (1/1) ... [2025-01-10 06:52:05,983 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:05" (1/1) ... [2025-01-10 06:52:05,984 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:05" (1/1) ... [2025-01-10 06:52:05,986 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:52:05,986 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:52:05,986 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:52:05,986 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:52:05,987 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:05" (1/1) ... [2025-01-10 06:52:05,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:52:06,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:52:06,023 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 06:52:06,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 06:52:06,053 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:52:06,053 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 06:52:06,053 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 06:52:06,053 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 06:52:06,053 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 06:52:06,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:52:06,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:52:06,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:52:06,055 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 06:52:06,144 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:52:06,146 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:52:06,331 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 06:52:06,331 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:52:06,463 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:52:06,468 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 06:52:06,468 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:52:06 BoogieIcfgContainer [2025-01-10 06:52:06,468 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:52:06,470 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:52:06,470 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:52:06,476 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:52:06,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:52:05" (1/3) ... [2025-01-10 06:52:06,477 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eb1ce1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:52:06, skipping insertion in model container [2025-01-10 06:52:06,478 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:05" (2/3) ... [2025-01-10 06:52:06,478 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eb1ce1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:52:06, skipping insertion in model container [2025-01-10 06:52:06,478 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:52:06" (3/3) ... [2025-01-10 06:52:06,479 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-ticket-2.wvr.c [2025-01-10 06:52:06,494 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:52:06,496 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-ticket-2.wvr.c that has 3 procedures, 41 locations, 1 initial locations, 0 loop locations, and 8 error locations. [2025-01-10 06:52:06,496 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 06:52:06,545 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-10 06:52:06,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 41 transitions, 96 flow [2025-01-10 06:52:06,596 INFO L124 PetriNetUnfolderBase]: 1/39 cut-off events. [2025-01-10 06:52:06,597 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 06:52:06,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 39 events. 1/39 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 49 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 28. Up to 2 conditions per place. [2025-01-10 06:52:06,600 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 41 transitions, 96 flow [2025-01-10 06:52:06,602 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 37 transitions, 83 flow [2025-01-10 06:52:06,607 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:52:06,616 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;@5dfc35e8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:52:06,616 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-01-10 06:52:06,625 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:52:06,626 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-01-10 06:52:06,626 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:52:06,626 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:52:06,627 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:52:06,627 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 06:52:06,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:52:06,631 INFO L85 PathProgramCache]: Analyzing trace with hash -842765800, now seen corresponding path program 1 times [2025-01-10 06:52:06,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:52:06,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490793956] [2025-01-10 06:52:06,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:52:06,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:52:06,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:52:06,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:52:06,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:52:06,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:52:06,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:52:06,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:52:06,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490793956] [2025-01-10 06:52:06,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490793956] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:52:06,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:52:06,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:52:06,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943702288] [2025-01-10 06:52:06,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:52:06,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:52:06,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:52:06,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:52:06,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:52:06,877 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2025-01-10 06:52:06,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 83 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-01-10 06:52:06,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:52:06,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2025-01-10 06:52:06,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:52:06,991 INFO L124 PetriNetUnfolderBase]: 196/399 cut-off events. [2025-01-10 06:52:06,993 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-01-10 06:52:06,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 769 conditions, 399 events. 196/399 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1999 event pairs, 182 based on Foata normal form. 0/271 useless extension candidates. Maximal degree in co-relation 708. Up to 337 conditions per place. [2025-01-10 06:52:07,000 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 22 selfloop transitions, 3 changer transitions 0/35 dead transitions. [2025-01-10 06:52:07,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 35 transitions, 129 flow [2025-01-10 06:52:07,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:52:07,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:52:07,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2025-01-10 06:52:07,018 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5121951219512195 [2025-01-10 06:52:07,020 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 83 flow. Second operand 3 states and 63 transitions. [2025-01-10 06:52:07,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 35 transitions, 129 flow [2025-01-10 06:52:07,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 35 transitions, 124 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:52:07,025 INFO L231 Difference]: Finished difference. Result has 40 places, 35 transitions, 80 flow [2025-01-10 06:52:07,027 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=40, PETRI_TRANSITIONS=35} [2025-01-10 06:52:07,029 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2025-01-10 06:52:07,030 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 35 transitions, 80 flow [2025-01-10 06:52:07,030 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-01-10 06:52:07,030 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:52:07,030 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:52:07,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:52:07,030 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 06:52:07,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:52:07,031 INFO L85 PathProgramCache]: Analyzing trace with hash -842765799, now seen corresponding path program 1 times [2025-01-10 06:52:07,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:52:07,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670028576] [2025-01-10 06:52:07,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:52:07,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:52:07,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:52:07,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:52:07,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:52:07,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:52:07,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:52:07,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:52:07,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670028576] [2025-01-10 06:52:07,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670028576] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:52:07,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:52:07,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:52:07,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15937412] [2025-01-10 06:52:07,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:52:07,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:52:07,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:52:07,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:52:07,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:52:07,124 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2025-01-10 06:52:07,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 35 transitions, 80 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-01-10 06:52:07,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:52:07,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2025-01-10 06:52:07,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:52:07,208 INFO L124 PetriNetUnfolderBase]: 183/370 cut-off events. [2025-01-10 06:52:07,208 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 06:52:07,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 712 conditions, 370 events. 183/370 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1812 event pairs, 87 based on Foata normal form. 0/258 useless extension candidates. Maximal degree in co-relation 691. Up to 315 conditions per place. [2025-01-10 06:52:07,212 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 25 selfloop transitions, 5 changer transitions 0/40 dead transitions. [2025-01-10 06:52:07,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 40 transitions, 152 flow [2025-01-10 06:52:07,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:52:07,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:52:07,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2025-01-10 06:52:07,215 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5528455284552846 [2025-01-10 06:52:07,215 INFO L175 Difference]: Start difference. First operand has 40 places, 35 transitions, 80 flow. Second operand 3 states and 68 transitions. [2025-01-10 06:52:07,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 40 transitions, 152 flow [2025-01-10 06:52:07,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 40 transitions, 146 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:52:07,217 INFO L231 Difference]: Finished difference. Result has 41 places, 37 transitions, 101 flow [2025-01-10 06:52:07,218 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=101, PETRI_PLACES=41, PETRI_TRANSITIONS=37} [2025-01-10 06:52:07,219 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, -2 predicate places. [2025-01-10 06:52:07,219 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 37 transitions, 101 flow [2025-01-10 06:52:07,219 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-01-10 06:52:07,219 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:52:07,219 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:52:07,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 06:52:07,220 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 06:52:07,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:52:07,222 INFO L85 PathProgramCache]: Analyzing trace with hash 42213160, now seen corresponding path program 1 times [2025-01-10 06:52:07,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:52:07,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019537905] [2025-01-10 06:52:07,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:52:07,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:52:07,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 06:52:07,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 06:52:07,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:52:07,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:52:07,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:52:07,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:52:07,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019537905] [2025-01-10 06:52:07,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019537905] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:52:07,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:52:07,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:52:07,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384105836] [2025-01-10 06:52:07,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:52:07,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:52:07,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:52:07,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:52:07,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:52:07,308 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2025-01-10 06:52:07,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 37 transitions, 101 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-01-10 06:52:07,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:52:07,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2025-01-10 06:52:07,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:52:07,381 INFO L124 PetriNetUnfolderBase]: 153/321 cut-off events. [2025-01-10 06:52:07,381 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2025-01-10 06:52:07,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 644 conditions, 321 events. 153/321 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1467 event pairs, 0 based on Foata normal form. 0/243 useless extension candidates. Maximal degree in co-relation 544. Up to 196 conditions per place. [2025-01-10 06:52:07,384 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 33 selfloop transitions, 7 changer transitions 0/50 dead transitions. [2025-01-10 06:52:07,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 50 transitions, 206 flow [2025-01-10 06:52:07,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:52:07,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:52:07,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2025-01-10 06:52:07,385 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5487804878048781 [2025-01-10 06:52:07,385 INFO L175 Difference]: Start difference. First operand has 41 places, 37 transitions, 101 flow. Second operand 4 states and 90 transitions. [2025-01-10 06:52:07,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 50 transitions, 206 flow [2025-01-10 06:52:07,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 50 transitions, 201 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:52:07,387 INFO L231 Difference]: Finished difference. Result has 41 places, 35 transitions, 102 flow [2025-01-10 06:52:07,387 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=102, PETRI_PLACES=41, PETRI_TRANSITIONS=35} [2025-01-10 06:52:07,387 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, -2 predicate places. [2025-01-10 06:52:07,388 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 35 transitions, 102 flow [2025-01-10 06:52:07,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-01-10 06:52:07,388 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:52:07,388 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:52:07,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:52:07,388 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 06:52:07,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:52:07,389 INFO L85 PathProgramCache]: Analyzing trace with hash 595523164, now seen corresponding path program 1 times [2025-01-10 06:52:07,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:52:07,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082575606] [2025-01-10 06:52:07,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:52:07,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:52:07,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 06:52:07,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 06:52:07,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:52:07,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:52:07,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:52:07,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:52:07,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082575606] [2025-01-10 06:52:07,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082575606] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:52:07,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:52:07,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:52:07,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300569009] [2025-01-10 06:52:07,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:52:07,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:52:07,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:52:07,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:52:07,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:52:07,473 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2025-01-10 06:52:07,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 35 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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-01-10 06:52:07,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:52:07,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2025-01-10 06:52:07,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:52:07,514 INFO L124 PetriNetUnfolderBase]: 110/240 cut-off events. [2025-01-10 06:52:07,514 INFO L125 PetriNetUnfolderBase]: For 83/83 co-relation queries the response was YES. [2025-01-10 06:52:07,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 513 conditions, 240 events. 110/240 cut-off events. For 83/83 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1003 event pairs, 90 based on Foata normal form. 0/196 useless extension candidates. Maximal degree in co-relation 329. Up to 192 conditions per place. [2025-01-10 06:52:07,516 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 20 selfloop transitions, 3 changer transitions 0/33 dead transitions. [2025-01-10 06:52:07,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 33 transitions, 144 flow [2025-01-10 06:52:07,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:52:07,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:52:07,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2025-01-10 06:52:07,517 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4796747967479675 [2025-01-10 06:52:07,517 INFO L175 Difference]: Start difference. First operand has 41 places, 35 transitions, 102 flow. Second operand 3 states and 59 transitions. [2025-01-10 06:52:07,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 33 transitions, 144 flow [2025-01-10 06:52:07,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 33 transitions, 125 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-01-10 06:52:07,518 INFO L231 Difference]: Finished difference. Result has 38 places, 33 transitions, 85 flow [2025-01-10 06:52:07,518 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=85, PETRI_PLACES=38, PETRI_TRANSITIONS=33} [2025-01-10 06:52:07,519 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, -5 predicate places. [2025-01-10 06:52:07,519 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 33 transitions, 85 flow [2025-01-10 06:52:07,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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-01-10 06:52:07,519 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:52:07,519 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:52:07,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 06:52:07,520 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 06:52:07,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:52:07,520 INFO L85 PathProgramCache]: Analyzing trace with hash 595523165, now seen corresponding path program 1 times [2025-01-10 06:52:07,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:52:07,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292092020] [2025-01-10 06:52:07,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:52:07,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:52:07,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 06:52:07,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 06:52:07,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:52:07,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:52:07,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:52:07,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:52:07,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292092020] [2025-01-10 06:52:07,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292092020] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:52:07,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:52:07,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:52:07,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337977233] [2025-01-10 06:52:07,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:52:07,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:52:07,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:52:07,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:52:07,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:52:07,562 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2025-01-10 06:52:07,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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-01-10 06:52:07,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:52:07,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2025-01-10 06:52:07,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:52:07,608 INFO L124 PetriNetUnfolderBase]: 83/189 cut-off events. [2025-01-10 06:52:07,608 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-01-10 06:52:07,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 371 conditions, 189 events. 83/189 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 656 event pairs, 27 based on Foata normal form. 0/167 useless extension candidates. Maximal degree in co-relation 348. Up to 112 conditions per place. [2025-01-10 06:52:07,609 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 25 selfloop transitions, 5 changer transitions 2/42 dead transitions. [2025-01-10 06:52:07,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 42 transitions, 171 flow [2025-01-10 06:52:07,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:52:07,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:52:07,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2025-01-10 06:52:07,610 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5528455284552846 [2025-01-10 06:52:07,610 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 85 flow. Second operand 3 states and 68 transitions. [2025-01-10 06:52:07,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 42 transitions, 171 flow [2025-01-10 06:52:07,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 42 transitions, 165 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:52:07,611 INFO L231 Difference]: Finished difference. Result has 39 places, 33 transitions, 98 flow [2025-01-10 06:52:07,612 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=39, PETRI_TRANSITIONS=33} [2025-01-10 06:52:07,612 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, -4 predicate places. [2025-01-10 06:52:07,613 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 33 transitions, 98 flow [2025-01-10 06:52:07,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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-01-10 06:52:07,613 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:52:07,613 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:52:07,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:52:07,613 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 06:52:07,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:52:07,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1055151944, now seen corresponding path program 1 times [2025-01-10 06:52:07,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:52:07,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502660445] [2025-01-10 06:52:07,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:52:07,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:52:07,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 06:52:07,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 06:52:07,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:52:07,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:52:07,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:52:07,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:52:07,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502660445] [2025-01-10 06:52:07,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502660445] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:52:07,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:52:07,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:52:07,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331277785] [2025-01-10 06:52:07,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:52:07,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:52:07,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:52:07,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:52:07,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:52:07,734 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2025-01-10 06:52:07,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 33 transitions, 98 flow. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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-01-10 06:52:07,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:52:07,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2025-01-10 06:52:07,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:52:07,819 INFO L124 PetriNetUnfolderBase]: 95/250 cut-off events. [2025-01-10 06:52:07,819 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2025-01-10 06:52:07,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 512 conditions, 250 events. 95/250 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1103 event pairs, 32 based on Foata normal form. 4/240 useless extension candidates. Maximal degree in co-relation 336. Up to 90 conditions per place. [2025-01-10 06:52:07,820 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 28 selfloop transitions, 11 changer transitions 0/48 dead transitions. [2025-01-10 06:52:07,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 48 transitions, 218 flow [2025-01-10 06:52:07,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:52:07,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:52:07,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 93 transitions. [2025-01-10 06:52:07,822 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45365853658536587 [2025-01-10 06:52:07,822 INFO L175 Difference]: Start difference. First operand has 39 places, 33 transitions, 98 flow. Second operand 5 states and 93 transitions. [2025-01-10 06:52:07,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 48 transitions, 218 flow [2025-01-10 06:52:07,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 48 transitions, 212 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:52:07,823 INFO L231 Difference]: Finished difference. Result has 44 places, 36 transitions, 141 flow [2025-01-10 06:52:07,823 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=141, PETRI_PLACES=44, PETRI_TRANSITIONS=36} [2025-01-10 06:52:07,824 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 1 predicate places. [2025-01-10 06:52:07,824 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 36 transitions, 141 flow [2025-01-10 06:52:07,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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-01-10 06:52:07,824 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:52:07,824 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:52:07,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:52:07,825 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 06:52:07,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:52:07,825 INFO L85 PathProgramCache]: Analyzing trace with hash -2067672100, now seen corresponding path program 2 times [2025-01-10 06:52:07,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:52:07,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944270322] [2025-01-10 06:52:07,825 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:52:07,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:52:07,831 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 1 equivalence classes. [2025-01-10 06:52:07,837 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 06:52:07,837 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:52:07,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:52:07,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:52:07,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:52:07,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944270322] [2025-01-10 06:52:07,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944270322] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:52:07,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:52:07,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:52:07,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609218744] [2025-01-10 06:52:07,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:52:07,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:52:07,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:52:07,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:52:07,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:52:07,894 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2025-01-10 06:52:07,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 36 transitions, 141 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-01-10 06:52:07,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:52:07,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2025-01-10 06:52:07,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:52:07,944 INFO L124 PetriNetUnfolderBase]: 81/222 cut-off events. [2025-01-10 06:52:07,944 INFO L125 PetriNetUnfolderBase]: For 200/200 co-relation queries the response was YES. [2025-01-10 06:52:07,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 490 conditions, 222 events. 81/222 cut-off events. For 200/200 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 917 event pairs, 33 based on Foata normal form. 18/217 useless extension candidates. Maximal degree in co-relation 216. Up to 94 conditions per place. [2025-01-10 06:52:07,945 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 0 selfloop transitions, 0 changer transitions 39/39 dead transitions. [2025-01-10 06:52:07,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 39 transitions, 205 flow [2025-01-10 06:52:07,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:52:07,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:52:07,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2025-01-10 06:52:07,946 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4634146341463415 [2025-01-10 06:52:07,946 INFO L175 Difference]: Start difference. First operand has 44 places, 36 transitions, 141 flow. Second operand 4 states and 76 transitions. [2025-01-10 06:52:07,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 39 transitions, 205 flow [2025-01-10 06:52:07,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 39 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:52:07,947 INFO L231 Difference]: Finished difference. Result has 43 places, 0 transitions, 0 flow [2025-01-10 06:52:07,947 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=43, PETRI_TRANSITIONS=0} [2025-01-10 06:52:07,948 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 0 predicate places. [2025-01-10 06:52:07,948 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 0 transitions, 0 flow [2025-01-10 06:52:07,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-01-10 06:52:07,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 18 remaining) [2025-01-10 06:52:07,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 18 remaining) [2025-01-10 06:52:07,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2025-01-10 06:52:07,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2025-01-10 06:52:07,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2025-01-10 06:52:07,951 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2025-01-10 06:52:07,951 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2025-01-10 06:52:07,951 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2025-01-10 06:52:07,951 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 18 remaining) [2025-01-10 06:52:07,951 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 18 remaining) [2025-01-10 06:52:07,951 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 18 remaining) [2025-01-10 06:52:07,951 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2025-01-10 06:52:07,951 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2025-01-10 06:52:07,951 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2025-01-10 06:52:07,951 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2025-01-10 06:52:07,951 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2025-01-10 06:52:07,951 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2025-01-10 06:52:07,951 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2025-01-10 06:52:07,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 06:52:07,951 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2025-01-10 06:52:07,958 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-10 06:52:07,958 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 06:52:07,961 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 06:52:07 BasicIcfg [2025-01-10 06:52:07,961 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 06:52:07,962 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 06:52:07,962 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 06:52:07,962 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 06:52:07,963 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:52:06" (3/4) ... [2025-01-10 06:52:07,964 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 06:52:07,965 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-01-10 06:52:07,965 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-01-10 06:52:07,968 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 61 nodes and edges [2025-01-10 06:52:07,968 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-01-10 06:52:07,968 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-10 06:52:07,968 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-01-10 06:52:08,018 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 06:52:08,018 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 06:52:08,018 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 06:52:08,019 INFO L158 Benchmark]: Toolchain (without parser) took 2327.36ms. Allocated memory is still 167.8MB. Free memory was 134.5MB in the beginning and 91.0MB in the end (delta: 43.5MB). Peak memory consumption was 41.5MB. Max. memory is 16.1GB. [2025-01-10 06:52:08,019 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 226.5MB. Free memory is still 147.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:52:08,019 INFO L158 Benchmark]: CACSL2BoogieTranslator took 224.56ms. Allocated memory is still 167.8MB. Free memory was 134.5MB in the beginning and 123.7MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 06:52:08,020 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.39ms. Allocated memory is still 167.8MB. Free memory was 123.7MB in the beginning and 121.7MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:52:08,020 INFO L158 Benchmark]: Boogie Preprocessor took 33.52ms. Allocated memory is still 167.8MB. Free memory was 121.7MB in the beginning and 120.4MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 06:52:08,020 INFO L158 Benchmark]: RCFGBuilder took 481.88ms. Allocated memory is still 167.8MB. Free memory was 120.4MB in the beginning and 94.2MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-10 06:52:08,020 INFO L158 Benchmark]: TraceAbstraction took 1491.30ms. Allocated memory is still 167.8MB. Free memory was 93.2MB in the beginning and 97.0MB in the end (delta: -3.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:52:08,020 INFO L158 Benchmark]: Witness Printer took 56.52ms. Allocated memory is still 167.8MB. Free memory was 97.0MB in the beginning and 91.0MB in the end (delta: 6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 06:52:08,021 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.24ms. Allocated memory is still 226.5MB. Free memory is still 147.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 224.56ms. Allocated memory is still 167.8MB. Free memory was 134.5MB in the beginning and 123.7MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.39ms. Allocated memory is still 167.8MB. Free memory was 123.7MB in the beginning and 121.7MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.52ms. Allocated memory is still 167.8MB. Free memory was 121.7MB in the beginning and 120.4MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 481.88ms. Allocated memory is still 167.8MB. Free memory was 120.4MB in the beginning and 94.2MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 1491.30ms. Allocated memory is still 167.8MB. Free memory was 93.2MB in the beginning and 97.0MB in the end (delta: -3.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 56.52ms. Allocated memory is still 167.8MB. Free memory was 97.0MB in the beginning and 91.0MB in the end (delta: 6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 67 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: 1.4s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 93 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 87 mSDsluCounter, 8 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 322 IncrementalHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 7 mSDtfsCounter, 322 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=141occurred in iteration=6, InterpolantAutomatonStates: 25, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 118 NumberOfCodeBlocks, 118 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 111 ConstructedInterpolants, 0 QuantifiedInterpolants, 223 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-10 06:52:08,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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