./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/chl-simpl-str-trans.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/chl-simpl-str-trans.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 f7b74cf7a2419cab3ab4545eb4bb4cb738b0dd565da7b17a0ca0e4253475f1b6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:50:32,018 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:50:32,070 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:50:32,074 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:50:32,075 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:50:32,089 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:50:32,089 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:50:32,089 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:50:32,090 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:50:32,090 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:50:32,090 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:50:32,090 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:50:32,090 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:50:32,090 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:50:32,090 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:50:32,090 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:50:32,090 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:50:32,090 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:50:32,090 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:50:32,090 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:50:32,090 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:50:32,091 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:50:32,091 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:50:32,091 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:50:32,091 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:50:32,091 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:50:32,091 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:50:32,091 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:50:32,091 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:50:32,091 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:50:32,091 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:50:32,091 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:50:32,091 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:50:32,091 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:50:32,091 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:50:32,091 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:50:32,091 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:50:32,091 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:50:32,091 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:50:32,091 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:50:32,092 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:50:32,092 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:50:32,092 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:50:32,092 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:50:32,092 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:50:32,092 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:50:32,092 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:50:32,092 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:50:32,092 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:50:32,092 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:50:32,092 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 -> f7b74cf7a2419cab3ab4545eb4bb4cb738b0dd565da7b17a0ca0e4253475f1b6 [2025-01-10 06:50:32,298 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:50:32,308 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:50:32,310 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:50:32,310 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:50:32,311 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:50:32,311 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-simpl-str-trans.wvr.c [2025-01-10 06:50:33,587 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0f9d4444c/491757e1714d4a0fb8c6d3468d8faccd/FLAG99b450e58 [2025-01-10 06:50:33,928 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:50:33,936 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-simpl-str-trans.wvr.c [2025-01-10 06:50:33,947 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0f9d4444c/491757e1714d4a0fb8c6d3468d8faccd/FLAG99b450e58 [2025-01-10 06:50:34,184 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0f9d4444c/491757e1714d4a0fb8c6d3468d8faccd [2025-01-10 06:50:34,186 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:50:34,187 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:50:34,189 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:50:34,189 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:50:34,192 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:50:34,193 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:50:34" (1/1) ... [2025-01-10 06:50:34,194 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@756e6a64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:50:34, skipping insertion in model container [2025-01-10 06:50:34,194 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:50:34" (1/1) ... [2025-01-10 06:50:34,207 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:50:34,330 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:50:34,338 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:50:34,351 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:50:34,361 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:50:34,362 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:50:34 WrapperNode [2025-01-10 06:50:34,362 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:50:34,363 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:50:34,363 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:50:34,363 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:50:34,368 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:50:34" (1/1) ... [2025-01-10 06:50:34,373 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:50:34" (1/1) ... [2025-01-10 06:50:34,392 INFO L138 Inliner]: procedures = 22, calls = 16, calls flagged for inlining = 9, calls inlined = 13, statements flattened = 197 [2025-01-10 06:50:34,392 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:50:34,393 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:50:34,393 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:50:34,393 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:50:34,399 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:50:34" (1/1) ... [2025-01-10 06:50:34,399 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:50:34" (1/1) ... [2025-01-10 06:50:34,401 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:50:34" (1/1) ... [2025-01-10 06:50:34,425 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:50:34,425 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:50:34" (1/1) ... [2025-01-10 06:50:34,425 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:50:34" (1/1) ... [2025-01-10 06:50:34,428 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:50:34" (1/1) ... [2025-01-10 06:50:34,429 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:50:34" (1/1) ... [2025-01-10 06:50:34,433 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:50:34" (1/1) ... [2025-01-10 06:50:34,438 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:50:34" (1/1) ... [2025-01-10 06:50:34,439 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:50:34" (1/1) ... [2025-01-10 06:50:34,440 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:50:34,443 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:50:34,444 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:50:34,444 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:50:34,444 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:50:34" (1/1) ... [2025-01-10 06:50:34,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:50:34,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:50:34,480 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:50:34,488 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:50:34,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:50:34,504 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 06:50:34,504 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 06:50:34,504 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 06:50:34,504 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 06:50:34,505 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-10 06:50:34,505 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-10 06:50:34,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:50:34,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:50:34,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:50:34,506 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:50:34,576 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:50:34,578 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:50:34,889 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 06:50:34,890 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:50:35,037 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:50:35,038 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 06:50:35,038 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:50:35 BoogieIcfgContainer [2025-01-10 06:50:35,038 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:50:35,040 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:50:35,040 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:50:35,043 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:50:35,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:50:34" (1/3) ... [2025-01-10 06:50:35,046 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56594874 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:50:35, skipping insertion in model container [2025-01-10 06:50:35,046 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:50:34" (2/3) ... [2025-01-10 06:50:35,046 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56594874 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:50:35, skipping insertion in model container [2025-01-10 06:50:35,046 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:50:35" (3/3) ... [2025-01-10 06:50:35,048 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-simpl-str-trans.wvr.c [2025-01-10 06:50:35,060 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:50:35,061 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-simpl-str-trans.wvr.c that has 4 procedures, 78 locations, 1 initial locations, 0 loop locations, and 18 error locations. [2025-01-10 06:50:35,062 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 06:50:35,136 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-10 06:50:35,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 89 transitions, 199 flow [2025-01-10 06:50:35,244 INFO L124 PetriNetUnfolderBase]: 12/86 cut-off events. [2025-01-10 06:50:35,246 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-10 06:50:35,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 86 events. 12/86 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 313 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 84. Up to 2 conditions per place. [2025-01-10 06:50:35,253 INFO L82 GeneralOperation]: Start removeDead. Operand has 87 places, 89 transitions, 199 flow [2025-01-10 06:50:35,257 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 82 places, 84 transitions, 183 flow [2025-01-10 06:50:35,262 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:50:35,270 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;@53be958e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:50:35,270 INFO L334 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2025-01-10 06:50:35,276 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:50:35,278 INFO L124 PetriNetUnfolderBase]: 2/25 cut-off events. [2025-01-10 06:50:35,278 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 06:50:35,278 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:35,279 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:50:35,279 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-01-10 06:50:35,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:35,284 INFO L85 PathProgramCache]: Analyzing trace with hash -629453063, now seen corresponding path program 1 times [2025-01-10 06:50:35,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:35,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356319749] [2025-01-10 06:50:35,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:35,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:35,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:50:35,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:50:35,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:35,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:35,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:50:35,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:35,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356319749] [2025-01-10 06:50:35,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356319749] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:35,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:35,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:50:35,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331226451] [2025-01-10 06:50:35,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:35,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:50:35,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:35,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:50:35,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:50:35,564 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 89 [2025-01-10 06:50:35,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 84 transitions, 183 flow. Second operand has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 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:50:35,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:35,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 89 [2025-01-10 06:50:35,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:36,819 INFO L124 PetriNetUnfolderBase]: 8633/13840 cut-off events. [2025-01-10 06:50:36,819 INFO L125 PetriNetUnfolderBase]: For 268/268 co-relation queries the response was YES. [2025-01-10 06:50:36,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25678 conditions, 13840 events. 8633/13840 cut-off events. For 268/268 co-relation queries the response was YES. Maximal size of possible extension queue 853. Compared 105712 event pairs, 2832 based on Foata normal form. 364/11549 useless extension candidates. Maximal degree in co-relation 24979. Up to 5668 conditions per place. [2025-01-10 06:50:36,915 INFO L140 encePairwiseOnDemand]: 81/89 looper letters, 86 selfloop transitions, 5 changer transitions 0/133 dead transitions. [2025-01-10 06:50:36,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 133 transitions, 475 flow [2025-01-10 06:50:36,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:50:36,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:50:36,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 274 transitions. [2025-01-10 06:50:36,927 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7696629213483146 [2025-01-10 06:50:36,928 INFO L175 Difference]: Start difference. First operand has 82 places, 84 transitions, 183 flow. Second operand 4 states and 274 transitions. [2025-01-10 06:50:36,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 133 transitions, 475 flow [2025-01-10 06:50:36,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 133 transitions, 460 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-10 06:50:36,955 INFO L231 Difference]: Finished difference. Result has 82 places, 86 transitions, 208 flow [2025-01-10 06:50:36,957 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=208, PETRI_PLACES=82, PETRI_TRANSITIONS=86} [2025-01-10 06:50:36,960 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, 0 predicate places. [2025-01-10 06:50:36,961 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 86 transitions, 208 flow [2025-01-10 06:50:36,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 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:50:36,962 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:36,962 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:50:36,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:50:36,962 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-01-10 06:50:36,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:36,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1961792194, now seen corresponding path program 1 times [2025-01-10 06:50:36,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:36,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111539993] [2025-01-10 06:50:36,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:36,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:36,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:50:36,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:50:36,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:36,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:37,071 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:50:37,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:37,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111539993] [2025-01-10 06:50:37,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111539993] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:37,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:37,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:50:37,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080899882] [2025-01-10 06:50:37,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:37,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:50:37,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:37,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:50:37,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:50:37,090 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 89 [2025-01-10 06:50:37,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 86 transitions, 208 flow. Second operand has 4 states, 4 states have (on average 49.0) internal successors, (196), 4 states have internal predecessors, (196), 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:50:37,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:37,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 89 [2025-01-10 06:50:37,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:38,027 INFO L124 PetriNetUnfolderBase]: 6311/11503 cut-off events. [2025-01-10 06:50:38,027 INFO L125 PetriNetUnfolderBase]: For 2345/2363 co-relation queries the response was YES. [2025-01-10 06:50:38,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22474 conditions, 11503 events. 6311/11503 cut-off events. For 2345/2363 co-relation queries the response was YES. Maximal size of possible extension queue 741. Compared 97537 event pairs, 1511 based on Foata normal form. 18/9931 useless extension candidates. Maximal degree in co-relation 11989. Up to 5147 conditions per place. [2025-01-10 06:50:38,121 INFO L140 encePairwiseOnDemand]: 85/89 looper letters, 58 selfloop transitions, 4 changer transitions 0/108 dead transitions. [2025-01-10 06:50:38,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 108 transitions, 379 flow [2025-01-10 06:50:38,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:50:38,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:50:38,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 253 transitions. [2025-01-10 06:50:38,126 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7106741573033708 [2025-01-10 06:50:38,126 INFO L175 Difference]: Start difference. First operand has 82 places, 86 transitions, 208 flow. Second operand 4 states and 253 transitions. [2025-01-10 06:50:38,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 108 transitions, 379 flow [2025-01-10 06:50:38,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 108 transitions, 379 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:50:38,160 INFO L231 Difference]: Finished difference. Result has 84 places, 85 transitions, 214 flow [2025-01-10 06:50:38,160 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=214, PETRI_PLACES=84, PETRI_TRANSITIONS=85} [2025-01-10 06:50:38,161 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, 2 predicate places. [2025-01-10 06:50:38,161 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 85 transitions, 214 flow [2025-01-10 06:50:38,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.0) internal successors, (196), 4 states have internal predecessors, (196), 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:50:38,161 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:38,162 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:50:38,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 06:50:38,162 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-01-10 06:50:38,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:38,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1652510514, now seen corresponding path program 1 times [2025-01-10 06:50:38,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:38,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999329263] [2025-01-10 06:50:38,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:38,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:38,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:50:38,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:50:38,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:38,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:38,222 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:50:38,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:38,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999329263] [2025-01-10 06:50:38,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999329263] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:38,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:38,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:50:38,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405192403] [2025-01-10 06:50:38,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:38,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:50:38,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:38,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:50:38,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:50:38,246 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 89 [2025-01-10 06:50:38,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 85 transitions, 214 flow. Second operand has 4 states, 4 states have (on average 46.75) internal successors, (187), 4 states have internal predecessors, (187), 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:50:38,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:38,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 89 [2025-01-10 06:50:38,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:39,441 INFO L124 PetriNetUnfolderBase]: 10606/17820 cut-off events. [2025-01-10 06:50:39,441 INFO L125 PetriNetUnfolderBase]: For 6332/6941 co-relation queries the response was YES. [2025-01-10 06:50:39,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36166 conditions, 17820 events. 10606/17820 cut-off events. For 6332/6941 co-relation queries the response was YES. Maximal size of possible extension queue 1050. Compared 147793 event pairs, 3534 based on Foata normal form. 763/15551 useless extension candidates. Maximal degree in co-relation 20800. Up to 6926 conditions per place. [2025-01-10 06:50:39,549 INFO L140 encePairwiseOnDemand]: 81/89 looper letters, 90 selfloop transitions, 5 changer transitions 0/136 dead transitions. [2025-01-10 06:50:39,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 136 transitions, 560 flow [2025-01-10 06:50:39,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:50:39,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:50:39,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 272 transitions. [2025-01-10 06:50:39,551 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7640449438202247 [2025-01-10 06:50:39,551 INFO L175 Difference]: Start difference. First operand has 84 places, 85 transitions, 214 flow. Second operand 4 states and 272 transitions. [2025-01-10 06:50:39,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 136 transitions, 560 flow [2025-01-10 06:50:39,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 136 transitions, 540 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:50:39,601 INFO L231 Difference]: Finished difference. Result has 86 places, 87 transitions, 240 flow [2025-01-10 06:50:39,601 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=240, PETRI_PLACES=86, PETRI_TRANSITIONS=87} [2025-01-10 06:50:39,603 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, 4 predicate places. [2025-01-10 06:50:39,603 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 87 transitions, 240 flow [2025-01-10 06:50:39,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.75) internal successors, (187), 4 states have internal predecessors, (187), 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:50:39,603 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:39,603 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:50:39,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:50:39,603 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-01-10 06:50:39,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:39,604 INFO L85 PathProgramCache]: Analyzing trace with hash 685984765, now seen corresponding path program 1 times [2025-01-10 06:50:39,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:39,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413795084] [2025-01-10 06:50:39,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:39,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:39,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:50:39,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:50:39,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:39,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:39,680 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:50:39,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:39,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413795084] [2025-01-10 06:50:39,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413795084] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:39,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:39,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:50:39,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134078633] [2025-01-10 06:50:39,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:39,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:50:39,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:39,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:50:39,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:50:39,705 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 89 [2025-01-10 06:50:39,706 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 87 transitions, 240 flow. Second operand has 4 states, 4 states have (on average 48.25) internal successors, (193), 4 states have internal predecessors, (193), 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:50:39,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:39,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 89 [2025-01-10 06:50:39,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:40,626 INFO L124 PetriNetUnfolderBase]: 7663/14327 cut-off events. [2025-01-10 06:50:40,626 INFO L125 PetriNetUnfolderBase]: For 6263/6708 co-relation queries the response was YES. [2025-01-10 06:50:40,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29869 conditions, 14327 events. 7663/14327 cut-off events. For 6263/6708 co-relation queries the response was YES. Maximal size of possible extension queue 881. Compared 128416 event pairs, 1873 based on Foata normal form. 455/13012 useless extension candidates. Maximal degree in co-relation 17251. Up to 6429 conditions per place. [2025-01-10 06:50:40,715 INFO L140 encePairwiseOnDemand]: 85/89 looper letters, 63 selfloop transitions, 4 changer transitions 0/111 dead transitions. [2025-01-10 06:50:40,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 111 transitions, 441 flow [2025-01-10 06:50:40,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:50:40,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:50:40,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 249 transitions. [2025-01-10 06:50:40,716 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.699438202247191 [2025-01-10 06:50:40,717 INFO L175 Difference]: Start difference. First operand has 86 places, 87 transitions, 240 flow. Second operand 4 states and 249 transitions. [2025-01-10 06:50:40,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 111 transitions, 441 flow [2025-01-10 06:50:40,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 111 transitions, 441 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:50:40,758 INFO L231 Difference]: Finished difference. Result has 88 places, 86 transitions, 244 flow [2025-01-10 06:50:40,758 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=244, PETRI_PLACES=88, PETRI_TRANSITIONS=86} [2025-01-10 06:50:40,758 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, 6 predicate places. [2025-01-10 06:50:40,759 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 86 transitions, 244 flow [2025-01-10 06:50:40,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.25) internal successors, (193), 4 states have internal predecessors, (193), 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:50:40,759 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:40,759 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:50:40,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 06:50:40,759 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-01-10 06:50:40,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:40,760 INFO L85 PathProgramCache]: Analyzing trace with hash -311780926, now seen corresponding path program 1 times [2025-01-10 06:50:40,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:40,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545883211] [2025-01-10 06:50:40,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:40,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:40,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:50:40,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:50:40,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:40,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:40,805 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:50:40,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:40,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545883211] [2025-01-10 06:50:40,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545883211] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:40,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:40,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:50:40,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154292980] [2025-01-10 06:50:40,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:40,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:50:40,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:40,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:50:40,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:50:40,826 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 89 [2025-01-10 06:50:40,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 86 transitions, 244 flow. Second operand has 4 states, 4 states have (on average 49.5) internal successors, (198), 4 states have internal predecessors, (198), 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:50:40,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:40,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 89 [2025-01-10 06:50:40,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:41,757 INFO L124 PetriNetUnfolderBase]: 7682/14536 cut-off events. [2025-01-10 06:50:41,758 INFO L125 PetriNetUnfolderBase]: For 7388/7622 co-relation queries the response was YES. [2025-01-10 06:50:41,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30765 conditions, 14536 events. 7682/14536 cut-off events. For 7388/7622 co-relation queries the response was YES. Maximal size of possible extension queue 922. Compared 131896 event pairs, 1801 based on Foata normal form. 234/13015 useless extension candidates. Maximal degree in co-relation 17937. Up to 6391 conditions per place. [2025-01-10 06:50:41,851 INFO L140 encePairwiseOnDemand]: 85/89 looper letters, 61 selfloop transitions, 4 changer transitions 0/109 dead transitions. [2025-01-10 06:50:41,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 109 transitions, 447 flow [2025-01-10 06:50:41,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:50:41,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:50:41,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 252 transitions. [2025-01-10 06:50:41,855 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7078651685393258 [2025-01-10 06:50:41,855 INFO L175 Difference]: Start difference. First operand has 88 places, 86 transitions, 244 flow. Second operand 4 states and 252 transitions. [2025-01-10 06:50:41,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 109 transitions, 447 flow [2025-01-10 06:50:41,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 109 transitions, 433 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:50:41,928 INFO L231 Difference]: Finished difference. Result has 87 places, 85 transitions, 242 flow [2025-01-10 06:50:41,929 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=242, PETRI_PLACES=87, PETRI_TRANSITIONS=85} [2025-01-10 06:50:41,930 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, 5 predicate places. [2025-01-10 06:50:41,930 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 85 transitions, 242 flow [2025-01-10 06:50:41,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.5) internal successors, (198), 4 states have internal predecessors, (198), 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:50:41,930 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:41,930 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:50:41,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:50:41,930 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-01-10 06:50:41,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:41,931 INFO L85 PathProgramCache]: Analyzing trace with hash -209308091, now seen corresponding path program 1 times [2025-01-10 06:50:41,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:41,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101855813] [2025-01-10 06:50:41,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:41,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:41,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:50:41,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:50:41,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:41,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:41,983 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:50:41,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:41,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101855813] [2025-01-10 06:50:41,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101855813] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:41,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:41,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:50:41,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770121601] [2025-01-10 06:50:41,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:41,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:50:41,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:41,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:50:41,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:50:42,004 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 89 [2025-01-10 06:50:42,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 85 transitions, 242 flow. Second operand has 4 states, 4 states have (on average 46.5) internal successors, (186), 4 states have internal predecessors, (186), 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:50:42,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:42,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 89 [2025-01-10 06:50:42,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:42,759 INFO L124 PetriNetUnfolderBase]: 8589/15779 cut-off events. [2025-01-10 06:50:42,760 INFO L125 PetriNetUnfolderBase]: For 8381/8874 co-relation queries the response was YES. [2025-01-10 06:50:42,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33466 conditions, 15779 events. 8589/15779 cut-off events. For 8381/8874 co-relation queries the response was YES. Maximal size of possible extension queue 959. Compared 141525 event pairs, 3715 based on Foata normal form. 472/14104 useless extension candidates. Maximal degree in co-relation 18847. Up to 7012 conditions per place. [2025-01-10 06:50:42,850 INFO L140 encePairwiseOnDemand]: 84/89 looper letters, 90 selfloop transitions, 4 changer transitions 0/135 dead transitions. [2025-01-10 06:50:42,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 135 transitions, 580 flow [2025-01-10 06:50:42,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:50:42,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:50:42,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 269 transitions. [2025-01-10 06:50:42,852 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7556179775280899 [2025-01-10 06:50:42,852 INFO L175 Difference]: Start difference. First operand has 87 places, 85 transitions, 242 flow. Second operand 4 states and 269 transitions. [2025-01-10 06:50:42,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 135 transitions, 580 flow [2025-01-10 06:50:42,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 135 transitions, 557 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 06:50:42,885 INFO L231 Difference]: Finished difference. Result has 86 places, 84 transitions, 233 flow [2025-01-10 06:50:42,885 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=233, PETRI_PLACES=86, PETRI_TRANSITIONS=84} [2025-01-10 06:50:42,886 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, 4 predicate places. [2025-01-10 06:50:42,886 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 84 transitions, 233 flow [2025-01-10 06:50:42,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.5) internal successors, (186), 4 states have internal predecessors, (186), 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:50:42,886 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:42,886 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:50:42,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:50:42,886 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-01-10 06:50:42,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:42,887 INFO L85 PathProgramCache]: Analyzing trace with hash -209309116, now seen corresponding path program 1 times [2025-01-10 06:50:42,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:42,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021175162] [2025-01-10 06:50:42,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:42,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:42,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:50:42,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:50:42,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:42,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:42,968 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:50:42,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:42,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021175162] [2025-01-10 06:50:42,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021175162] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:42,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:42,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:50:42,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634230217] [2025-01-10 06:50:42,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:42,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:50:42,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:42,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:50:42,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:50:42,995 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 89 [2025-01-10 06:50:42,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 84 transitions, 233 flow. Second operand has 5 states, 5 states have (on average 47.4) internal successors, (237), 5 states have internal predecessors, (237), 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:50:42,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:42,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 89 [2025-01-10 06:50:42,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:43,865 INFO L124 PetriNetUnfolderBase]: 10510/16965 cut-off events. [2025-01-10 06:50:43,865 INFO L125 PetriNetUnfolderBase]: For 5720/6344 co-relation queries the response was YES. [2025-01-10 06:50:43,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37465 conditions, 16965 events. 10510/16965 cut-off events. For 5720/6344 co-relation queries the response was YES. Maximal size of possible extension queue 989. Compared 134175 event pairs, 1805 based on Foata normal form. 314/15775 useless extension candidates. Maximal degree in co-relation 21635. Up to 7845 conditions per place. [2025-01-10 06:50:43,940 INFO L140 encePairwiseOnDemand]: 83/89 looper letters, 88 selfloop transitions, 6 changer transitions 0/133 dead transitions. [2025-01-10 06:50:43,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 133 transitions, 561 flow [2025-01-10 06:50:43,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:50:43,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:50:43,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 318 transitions. [2025-01-10 06:50:43,941 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7146067415730337 [2025-01-10 06:50:43,941 INFO L175 Difference]: Start difference. First operand has 86 places, 84 transitions, 233 flow. Second operand 5 states and 318 transitions. [2025-01-10 06:50:43,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 133 transitions, 561 flow [2025-01-10 06:50:43,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 133 transitions, 555 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:50:43,967 INFO L231 Difference]: Finished difference. Result has 87 places, 83 transitions, 237 flow [2025-01-10 06:50:43,967 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=237, PETRI_PLACES=87, PETRI_TRANSITIONS=83} [2025-01-10 06:50:43,968 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, 5 predicate places. [2025-01-10 06:50:43,968 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 83 transitions, 237 flow [2025-01-10 06:50:43,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 47.4) internal successors, (237), 5 states have internal predecessors, (237), 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:50:43,968 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:43,968 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:50:43,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 06:50:43,968 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-01-10 06:50:43,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:43,969 INFO L85 PathProgramCache]: Analyzing trace with hash 297975129, now seen corresponding path program 1 times [2025-01-10 06:50:43,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:43,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884337271] [2025-01-10 06:50:43,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:43,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:43,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:50:43,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:50:43,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:43,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:44,008 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:50:44,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:44,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884337271] [2025-01-10 06:50:44,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884337271] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:44,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:44,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:50:44,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97227311] [2025-01-10 06:50:44,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:44,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:50:44,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:44,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:50:44,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:50:44,031 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 89 [2025-01-10 06:50:44,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 83 transitions, 237 flow. Second operand has 4 states, 4 states have (on average 47.25) internal successors, (189), 4 states have internal predecessors, (189), 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:50:44,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:44,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 89 [2025-01-10 06:50:44,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:44,988 INFO L124 PetriNetUnfolderBase]: 12659/21669 cut-off events. [2025-01-10 06:50:44,989 INFO L125 PetriNetUnfolderBase]: For 12861/13943 co-relation queries the response was YES. [2025-01-10 06:50:45,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46647 conditions, 21669 events. 12659/21669 cut-off events. For 12861/13943 co-relation queries the response was YES. Maximal size of possible extension queue 1239. Compared 189168 event pairs, 4628 based on Foata normal form. 1237/19913 useless extension candidates. Maximal degree in co-relation 26777. Up to 8789 conditions per place. [2025-01-10 06:50:45,090 INFO L140 encePairwiseOnDemand]: 81/89 looper letters, 94 selfloop transitions, 5 changer transitions 0/136 dead transitions. [2025-01-10 06:50:45,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 136 transitions, 629 flow [2025-01-10 06:50:45,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:50:45,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:50:45,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 270 transitions. [2025-01-10 06:50:45,092 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7584269662921348 [2025-01-10 06:50:45,092 INFO L175 Difference]: Start difference. First operand has 87 places, 83 transitions, 237 flow. Second operand 4 states and 270 transitions. [2025-01-10 06:50:45,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 136 transitions, 629 flow [2025-01-10 06:50:45,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 136 transitions, 608 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:50:45,140 INFO L231 Difference]: Finished difference. Result has 89 places, 85 transitions, 262 flow [2025-01-10 06:50:45,140 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=262, PETRI_PLACES=89, PETRI_TRANSITIONS=85} [2025-01-10 06:50:45,141 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, 7 predicate places. [2025-01-10 06:50:45,141 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 85 transitions, 262 flow [2025-01-10 06:50:45,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.25) internal successors, (189), 4 states have internal predecessors, (189), 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:50:45,141 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:45,141 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:50:45,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 06:50:45,142 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-01-10 06:50:45,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:45,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1075305194, now seen corresponding path program 1 times [2025-01-10 06:50:45,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:45,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256573684] [2025-01-10 06:50:45,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:45,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:45,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:50:45,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:50:45,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:45,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:45,179 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:50:45,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:45,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256573684] [2025-01-10 06:50:45,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256573684] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:45,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:45,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:50:45,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410905783] [2025-01-10 06:50:45,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:45,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:50:45,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:45,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:50:45,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:50:45,200 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 89 [2025-01-10 06:50:45,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 85 transitions, 262 flow. Second operand has 4 states, 4 states have (on average 48.75) internal successors, (195), 4 states have internal predecessors, (195), 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:50:45,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:45,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 89 [2025-01-10 06:50:45,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:46,217 INFO L124 PetriNetUnfolderBase]: 9275/17800 cut-off events. [2025-01-10 06:50:46,217 INFO L125 PetriNetUnfolderBase]: For 11232/11863 co-relation queries the response was YES. [2025-01-10 06:50:46,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38839 conditions, 17800 events. 9275/17800 cut-off events. For 11232/11863 co-relation queries the response was YES. Maximal size of possible extension queue 1059. Compared 168142 event pairs, 2224 based on Foata normal form. 734/16730 useless extension candidates. Maximal degree in co-relation 23961. Up to 7859 conditions per place. [2025-01-10 06:50:46,329 INFO L140 encePairwiseOnDemand]: 85/89 looper letters, 66 selfloop transitions, 4 changer transitions 0/110 dead transitions. [2025-01-10 06:50:46,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 110 transitions, 489 flow [2025-01-10 06:50:46,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:50:46,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:50:46,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 248 transitions. [2025-01-10 06:50:46,331 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6966292134831461 [2025-01-10 06:50:46,331 INFO L175 Difference]: Start difference. First operand has 89 places, 85 transitions, 262 flow. Second operand 4 states and 248 transitions. [2025-01-10 06:50:46,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 110 transitions, 489 flow [2025-01-10 06:50:46,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 110 transitions, 489 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:50:46,401 INFO L231 Difference]: Finished difference. Result has 91 places, 84 transitions, 266 flow [2025-01-10 06:50:46,401 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=266, PETRI_PLACES=91, PETRI_TRANSITIONS=84} [2025-01-10 06:50:46,402 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, 9 predicate places. [2025-01-10 06:50:46,403 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 84 transitions, 266 flow [2025-01-10 06:50:46,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.75) internal successors, (195), 4 states have internal predecessors, (195), 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:50:46,403 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:46,403 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:50:46,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 06:50:46,403 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-01-10 06:50:46,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:46,404 INFO L85 PathProgramCache]: Analyzing trace with hash 2101352672, now seen corresponding path program 1 times [2025-01-10 06:50:46,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:46,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007229189] [2025-01-10 06:50:46,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:46,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:46,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:50:46,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:50:46,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:46,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:46,475 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:50:46,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:46,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007229189] [2025-01-10 06:50:46,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007229189] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:46,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:46,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:50:46,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664854115] [2025-01-10 06:50:46,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:46,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:50:46,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:46,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:50:46,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:50:46,507 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 89 [2025-01-10 06:50:46,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 84 transitions, 266 flow. Second operand has 6 states, 6 states have (on average 44.166666666666664) internal successors, (265), 6 states have internal predecessors, (265), 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:50:46,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:46,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 89 [2025-01-10 06:50:46,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:47,954 INFO L124 PetriNetUnfolderBase]: 12676/20604 cut-off events. [2025-01-10 06:50:47,954 INFO L125 PetriNetUnfolderBase]: For 15746/16711 co-relation queries the response was YES. [2025-01-10 06:50:48,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49418 conditions, 20604 events. 12676/20604 cut-off events. For 15746/16711 co-relation queries the response was YES. Maximal size of possible extension queue 1168. Compared 168898 event pairs, 2296 based on Foata normal form. 1221/20431 useless extension candidates. Maximal degree in co-relation 30295. Up to 5311 conditions per place. [2025-01-10 06:50:48,110 INFO L140 encePairwiseOnDemand]: 81/89 looper letters, 118 selfloop transitions, 9 changer transitions 0/165 dead transitions. [2025-01-10 06:50:48,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 165 transitions, 817 flow [2025-01-10 06:50:48,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:50:48,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:50:48,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 368 transitions. [2025-01-10 06:50:48,111 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6891385767790262 [2025-01-10 06:50:48,111 INFO L175 Difference]: Start difference. First operand has 91 places, 84 transitions, 266 flow. Second operand 6 states and 368 transitions. [2025-01-10 06:50:48,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 165 transitions, 817 flow [2025-01-10 06:50:48,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 165 transitions, 791 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:50:48,196 INFO L231 Difference]: Finished difference. Result has 93 places, 84 transitions, 283 flow [2025-01-10 06:50:48,196 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=283, PETRI_PLACES=93, PETRI_TRANSITIONS=84} [2025-01-10 06:50:48,196 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, 11 predicate places. [2025-01-10 06:50:48,197 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 84 transitions, 283 flow [2025-01-10 06:50:48,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 44.166666666666664) internal successors, (265), 6 states have internal predecessors, (265), 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:50:48,197 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:48,197 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:50:48,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 06:50:48,197 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-01-10 06:50:48,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:48,197 INFO L85 PathProgramCache]: Analyzing trace with hash 647295124, now seen corresponding path program 1 times [2025-01-10 06:50:48,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:48,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084954952] [2025-01-10 06:50:48,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:48,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:48,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:50:48,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:50:48,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:48,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:48,265 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:50:48,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:48,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084954952] [2025-01-10 06:50:48,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084954952] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:48,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:48,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:50:48,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281157421] [2025-01-10 06:50:48,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:48,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:50:48,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:48,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:50:48,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:50:48,297 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 89 [2025-01-10 06:50:48,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 84 transitions, 283 flow. Second operand has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 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:50:48,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:48,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 89 [2025-01-10 06:50:48,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:49,313 INFO L124 PetriNetUnfolderBase]: 9329/17938 cut-off events. [2025-01-10 06:50:49,314 INFO L125 PetriNetUnfolderBase]: For 17304/18410 co-relation queries the response was YES. [2025-01-10 06:50:49,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41641 conditions, 17938 events. 9329/17938 cut-off events. For 17304/18410 co-relation queries the response was YES. Maximal size of possible extension queue 1062. Compared 170328 event pairs, 2522 based on Foata normal form. 959/17172 useless extension candidates. Maximal degree in co-relation 24671. Up to 7058 conditions per place. [2025-01-10 06:50:49,527 INFO L140 encePairwiseOnDemand]: 85/89 looper letters, 66 selfloop transitions, 4 changer transitions 0/109 dead transitions. [2025-01-10 06:50:49,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 109 transitions, 528 flow [2025-01-10 06:50:49,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:50:49,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:50:49,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 251 transitions. [2025-01-10 06:50:49,529 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7050561797752809 [2025-01-10 06:50:49,529 INFO L175 Difference]: Start difference. First operand has 93 places, 84 transitions, 283 flow. Second operand 4 states and 251 transitions. [2025-01-10 06:50:49,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 109 transitions, 528 flow [2025-01-10 06:50:49,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 109 transitions, 506 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 06:50:49,588 INFO L231 Difference]: Finished difference. Result has 91 places, 83 transitions, 276 flow [2025-01-10 06:50:49,588 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=276, PETRI_PLACES=91, PETRI_TRANSITIONS=83} [2025-01-10 06:50:49,588 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, 9 predicate places. [2025-01-10 06:50:49,588 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 83 transitions, 276 flow [2025-01-10 06:50:49,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 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:50:49,589 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:49,589 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:50:49,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 06:50:49,589 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-01-10 06:50:49,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:49,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1025278053, now seen corresponding path program 1 times [2025-01-10 06:50:49,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:49,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742344357] [2025-01-10 06:50:49,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:49,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:49,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:50:49,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:50:49,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:49,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:49,619 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:50:49,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:49,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742344357] [2025-01-10 06:50:49,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742344357] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:49,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:49,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:50:49,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080116498] [2025-01-10 06:50:49,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:49,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:50:49,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:49,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:50:49,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:50:49,633 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 89 [2025-01-10 06:50:49,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 83 transitions, 276 flow. Second operand has 4 states, 4 states have (on average 47.0) internal successors, (188), 4 states have internal predecessors, (188), 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:50:49,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:49,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 89 [2025-01-10 06:50:49,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:50,535 INFO L124 PetriNetUnfolderBase]: 10491/19538 cut-off events. [2025-01-10 06:50:50,535 INFO L125 PetriNetUnfolderBase]: For 17090/18481 co-relation queries the response was YES. [2025-01-10 06:50:50,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45405 conditions, 19538 events. 10491/19538 cut-off events. For 17090/18481 co-relation queries the response was YES. Maximal size of possible extension queue 1092. Compared 181634 event pairs, 4640 based on Foata normal form. 1322/18808 useless extension candidates. Maximal degree in co-relation 27526. Up to 8518 conditions per place. [2025-01-10 06:50:50,683 INFO L140 encePairwiseOnDemand]: 84/89 looper letters, 97 selfloop transitions, 4 changer transitions 0/137 dead transitions. [2025-01-10 06:50:50,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 137 transitions, 688 flow [2025-01-10 06:50:50,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:50:50,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:50:50,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 267 transitions. [2025-01-10 06:50:50,684 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.75 [2025-01-10 06:50:50,685 INFO L175 Difference]: Start difference. First operand has 91 places, 83 transitions, 276 flow. Second operand 4 states and 267 transitions. [2025-01-10 06:50:50,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 137 transitions, 688 flow [2025-01-10 06:50:50,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 137 transitions, 665 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 06:50:50,760 INFO L231 Difference]: Finished difference. Result has 90 places, 82 transitions, 267 flow [2025-01-10 06:50:50,760 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=267, PETRI_PLACES=90, PETRI_TRANSITIONS=82} [2025-01-10 06:50:50,761 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, 8 predicate places. [2025-01-10 06:50:50,761 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 82 transitions, 267 flow [2025-01-10 06:50:50,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.0) internal successors, (188), 4 states have internal predecessors, (188), 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:50:50,761 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:50,761 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:50:50,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 06:50:50,761 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-01-10 06:50:50,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:50,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1025277028, now seen corresponding path program 1 times [2025-01-10 06:50:50,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:50,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413824112] [2025-01-10 06:50:50,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:50,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:50,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:50:50,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:50:50,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:50,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:50,813 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:50:50,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:50,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413824112] [2025-01-10 06:50:50,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413824112] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:50,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:50,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:50:50,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580112509] [2025-01-10 06:50:50,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:50,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:50:50,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:50,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:50:50,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:50:50,842 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 89 [2025-01-10 06:50:50,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 82 transitions, 267 flow. Second operand has 5 states, 5 states have (on average 47.8) internal successors, (239), 5 states have internal predecessors, (239), 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:50:50,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:50,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 89 [2025-01-10 06:50:50,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:51,786 INFO L124 PetriNetUnfolderBase]: 12797/20792 cut-off events. [2025-01-10 06:50:51,786 INFO L125 PetriNetUnfolderBase]: For 15609/17548 co-relation queries the response was YES. [2025-01-10 06:50:51,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50905 conditions, 20792 events. 12797/20792 cut-off events. For 15609/17548 co-relation queries the response was YES. Maximal size of possible extension queue 1135. Compared 169158 event pairs, 2189 based on Foata normal form. 1372/20954 useless extension candidates. Maximal degree in co-relation 31234. Up to 9635 conditions per place. [2025-01-10 06:50:51,945 INFO L140 encePairwiseOnDemand]: 83/89 looper letters, 95 selfloop transitions, 6 changer transitions 0/135 dead transitions. [2025-01-10 06:50:51,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 135 transitions, 669 flow [2025-01-10 06:50:51,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:50:51,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:50:51,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 316 transitions. [2025-01-10 06:50:51,946 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7101123595505618 [2025-01-10 06:50:51,946 INFO L175 Difference]: Start difference. First operand has 90 places, 82 transitions, 267 flow. Second operand 5 states and 316 transitions. [2025-01-10 06:50:51,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 135 transitions, 669 flow [2025-01-10 06:50:52,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 135 transitions, 663 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:50:52,031 INFO L231 Difference]: Finished difference. Result has 91 places, 81 transitions, 271 flow [2025-01-10 06:50:52,031 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=271, PETRI_PLACES=91, PETRI_TRANSITIONS=81} [2025-01-10 06:50:52,032 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, 9 predicate places. [2025-01-10 06:50:52,032 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 81 transitions, 271 flow [2025-01-10 06:50:52,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 47.8) internal successors, (239), 5 states have internal predecessors, (239), 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:50:52,032 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:52,032 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:50:52,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 06:50:52,032 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-01-10 06:50:52,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:52,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1664741162, now seen corresponding path program 1 times [2025-01-10 06:50:52,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:52,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984278831] [2025-01-10 06:50:52,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:52,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:52,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:50:52,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:50:52,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:52,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:52,078 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:50:52,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:52,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984278831] [2025-01-10 06:50:52,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984278831] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:52,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:52,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:50:52,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033435859] [2025-01-10 06:50:52,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:52,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:50:52,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:52,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:50:52,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:50:52,101 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 89 [2025-01-10 06:50:52,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 81 transitions, 271 flow. Second operand has 5 states, 5 states have (on average 44.6) internal successors, (223), 5 states have internal predecessors, (223), 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:50:52,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:52,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 89 [2025-01-10 06:50:52,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:53,123 INFO L124 PetriNetUnfolderBase]: 12652/20642 cut-off events. [2025-01-10 06:50:53,123 INFO L125 PetriNetUnfolderBase]: For 17164/18020 co-relation queries the response was YES. [2025-01-10 06:50:53,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50828 conditions, 20642 events. 12652/20642 cut-off events. For 17164/18020 co-relation queries the response was YES. Maximal size of possible extension queue 1129. Compared 168882 event pairs, 4671 based on Foata normal form. 910/20216 useless extension candidates. Maximal degree in co-relation 30927. Up to 8859 conditions per place. [2025-01-10 06:50:53,256 INFO L140 encePairwiseOnDemand]: 82/89 looper letters, 149 selfloop transitions, 8 changer transitions 0/190 dead transitions. [2025-01-10 06:50:53,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 190 transitions, 983 flow [2025-01-10 06:50:53,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:50:53,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:50:53,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 396 transitions. [2025-01-10 06:50:53,257 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7415730337078652 [2025-01-10 06:50:53,257 INFO L175 Difference]: Start difference. First operand has 91 places, 81 transitions, 271 flow. Second operand 6 states and 396 transitions. [2025-01-10 06:50:53,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 190 transitions, 983 flow [2025-01-10 06:50:53,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 190 transitions, 945 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-01-10 06:50:53,390 INFO L231 Difference]: Finished difference. Result has 93 places, 82 transitions, 286 flow [2025-01-10 06:50:53,391 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=286, PETRI_PLACES=93, PETRI_TRANSITIONS=82} [2025-01-10 06:50:53,391 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, 11 predicate places. [2025-01-10 06:50:53,391 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 82 transitions, 286 flow [2025-01-10 06:50:53,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.6) internal successors, (223), 5 states have internal predecessors, (223), 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:50:53,391 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:53,391 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:50:53,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 06:50:53,392 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-01-10 06:50:53,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:53,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1408718691, now seen corresponding path program 1 times [2025-01-10 06:50:53,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:53,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193905410] [2025-01-10 06:50:53,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:53,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:53,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:50:53,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:50:53,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:53,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:53,416 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:50:53,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:53,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193905410] [2025-01-10 06:50:53,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193905410] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:53,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:53,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:50:53,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569639185] [2025-01-10 06:50:53,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:53,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:50:53,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:53,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:50:53,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:50:53,430 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 89 [2025-01-10 06:50:53,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 82 transitions, 286 flow. Second operand has 4 states, 4 states have (on average 49.25) internal successors, (197), 4 states have internal predecessors, (197), 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:50:53,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:53,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 89 [2025-01-10 06:50:53,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:54,185 INFO L124 PetriNetUnfolderBase]: 9321/17281 cut-off events. [2025-01-10 06:50:54,186 INFO L125 PetriNetUnfolderBase]: For 20529/21488 co-relation queries the response was YES. [2025-01-10 06:50:54,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40962 conditions, 17281 events. 9321/17281 cut-off events. For 20529/21488 co-relation queries the response was YES. Maximal size of possible extension queue 1000. Compared 157631 event pairs, 2522 based on Foata normal form. 1213/16891 useless extension candidates. Maximal degree in co-relation 28146. Up to 7312 conditions per place. [2025-01-10 06:50:54,323 INFO L140 encePairwiseOnDemand]: 85/89 looper letters, 69 selfloop transitions, 4 changer transitions 0/108 dead transitions. [2025-01-10 06:50:54,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 108 transitions, 543 flow [2025-01-10 06:50:54,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:50:54,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:50:54,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 247 transitions. [2025-01-10 06:50:54,324 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6938202247191011 [2025-01-10 06:50:54,324 INFO L175 Difference]: Start difference. First operand has 93 places, 82 transitions, 286 flow. Second operand 4 states and 247 transitions. [2025-01-10 06:50:54,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 108 transitions, 543 flow [2025-01-10 06:50:54,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 108 transitions, 515 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-01-10 06:50:54,395 INFO L231 Difference]: Finished difference. Result has 91 places, 81 transitions, 274 flow [2025-01-10 06:50:54,395 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=274, PETRI_PLACES=91, PETRI_TRANSITIONS=81} [2025-01-10 06:50:54,395 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, 9 predicate places. [2025-01-10 06:50:54,396 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 81 transitions, 274 flow [2025-01-10 06:50:54,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.25) internal successors, (197), 4 states have internal predecessors, (197), 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:50:54,396 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:54,396 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:50:54,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 06:50:54,399 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-01-10 06:50:54,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:54,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1718817497, now seen corresponding path program 1 times [2025-01-10 06:50:54,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:54,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744512569] [2025-01-10 06:50:54,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:54,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:54,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:50:54,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:50:54,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:54,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:54,471 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:50:54,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:54,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744512569] [2025-01-10 06:50:54,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744512569] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:54,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:54,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:50:54,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333988727] [2025-01-10 06:50:54,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:54,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:50:54,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:54,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:50:54,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:50:54,500 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 89 [2025-01-10 06:50:54,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 81 transitions, 274 flow. Second operand has 6 states, 6 states have (on average 44.5) internal successors, (267), 6 states have internal predecessors, (267), 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:50:54,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:54,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 89 [2025-01-10 06:50:54,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:55,534 INFO L124 PetriNetUnfolderBase]: 12797/20226 cut-off events. [2025-01-10 06:50:55,534 INFO L125 PetriNetUnfolderBase]: For 22075/23456 co-relation queries the response was YES. [2025-01-10 06:50:55,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50772 conditions, 20226 events. 12797/20226 cut-off events. For 22075/23456 co-relation queries the response was YES. Maximal size of possible extension queue 1138. Compared 158846 event pairs, 2180 based on Foata normal form. 1931/20947 useless extension candidates. Maximal degree in co-relation 34723. Up to 5475 conditions per place. [2025-01-10 06:50:55,658 INFO L140 encePairwiseOnDemand]: 81/89 looper letters, 123 selfloop transitions, 9 changer transitions 0/165 dead transitions. [2025-01-10 06:50:55,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 165 transitions, 874 flow [2025-01-10 06:50:55,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:50:55,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:50:55,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 365 transitions. [2025-01-10 06:50:55,660 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6835205992509363 [2025-01-10 06:50:55,660 INFO L175 Difference]: Start difference. First operand has 91 places, 81 transitions, 274 flow. Second operand 6 states and 365 transitions. [2025-01-10 06:50:55,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 165 transitions, 874 flow [2025-01-10 06:50:55,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 165 transitions, 848 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:50:55,737 INFO L231 Difference]: Finished difference. Result has 93 places, 81 transitions, 291 flow [2025-01-10 06:50:55,737 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=291, PETRI_PLACES=93, PETRI_TRANSITIONS=81} [2025-01-10 06:50:55,738 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, 11 predicate places. [2025-01-10 06:50:55,738 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 81 transitions, 291 flow [2025-01-10 06:50:55,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 44.5) internal successors, (267), 6 states have internal predecessors, (267), 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:50:55,738 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:55,738 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:50:55,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 06:50:55,739 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread3Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-01-10 06:50:55,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:55,739 INFO L85 PathProgramCache]: Analyzing trace with hash -720606762, now seen corresponding path program 1 times [2025-01-10 06:50:55,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:55,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644283642] [2025-01-10 06:50:55,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:55,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:55,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:50:55,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:50:55,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:55,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:55,816 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:50:55,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:55,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644283642] [2025-01-10 06:50:55,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644283642] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:55,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:55,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:50:55,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541847067] [2025-01-10 06:50:55,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:55,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:50:55,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:55,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:50:55,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:50:55,840 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 89 [2025-01-10 06:50:55,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 81 transitions, 291 flow. Second operand has 5 states, 5 states have (on average 48.2) internal successors, (241), 5 states have internal predecessors, (241), 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:50:55,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:55,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 89 [2025-01-10 06:50:55,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:56,742 INFO L124 PetriNetUnfolderBase]: 12930/20270 cut-off events. [2025-01-10 06:50:56,743 INFO L125 PetriNetUnfolderBase]: For 29666/31972 co-relation queries the response was YES. [2025-01-10 06:50:56,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53335 conditions, 20270 events. 12930/20270 cut-off events. For 29666/31972 co-relation queries the response was YES. Maximal size of possible extension queue 1096. Compared 156721 event pairs, 2539 based on Foata normal form. 2053/21350 useless extension candidates. Maximal degree in co-relation 36672. Up to 9002 conditions per place. [2025-01-10 06:50:56,881 INFO L140 encePairwiseOnDemand]: 83/89 looper letters, 99 selfloop transitions, 6 changer transitions 0/136 dead transitions. [2025-01-10 06:50:56,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 136 transitions, 743 flow [2025-01-10 06:50:56,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:50:56,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:50:56,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 314 transitions. [2025-01-10 06:50:56,882 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7056179775280899 [2025-01-10 06:50:56,882 INFO L175 Difference]: Start difference. First operand has 93 places, 81 transitions, 291 flow. Second operand 5 states and 314 transitions. [2025-01-10 06:50:56,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 136 transitions, 743 flow [2025-01-10 06:50:56,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 136 transitions, 712 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 06:50:56,959 INFO L231 Difference]: Finished difference. Result has 92 places, 80 transitions, 288 flow [2025-01-10 06:50:56,959 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=288, PETRI_PLACES=92, PETRI_TRANSITIONS=80} [2025-01-10 06:50:56,960 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, 10 predicate places. [2025-01-10 06:50:56,960 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 80 transitions, 288 flow [2025-01-10 06:50:56,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 48.2) internal successors, (241), 5 states have internal predecessors, (241), 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:50:56,960 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:56,960 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:50:56,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 06:50:56,960 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-01-10 06:50:56,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:56,961 INFO L85 PathProgramCache]: Analyzing trace with hash -720605737, now seen corresponding path program 1 times [2025-01-10 06:50:56,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:56,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199123472] [2025-01-10 06:50:56,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:56,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:56,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:50:56,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:50:56,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:56,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:56,983 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:50:56,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:56,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199123472] [2025-01-10 06:50:56,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199123472] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:56,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:56,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:50:56,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97242060] [2025-01-10 06:50:56,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:56,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:50:56,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:56,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:50:56,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:50:56,996 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 89 [2025-01-10 06:50:56,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 80 transitions, 288 flow. Second operand has 4 states, 4 states have (on average 47.5) internal successors, (190), 4 states have internal predecessors, (190), 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:50:56,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:56,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 89 [2025-01-10 06:50:56,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:57,799 INFO L124 PetriNetUnfolderBase]: 10522/18008 cut-off events. [2025-01-10 06:50:57,800 INFO L125 PetriNetUnfolderBase]: For 22769/24514 co-relation queries the response was YES. [2025-01-10 06:50:57,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45473 conditions, 18008 events. 10522/18008 cut-off events. For 22769/24514 co-relation queries the response was YES. Maximal size of possible extension queue 1012. Compared 153033 event pairs, 4871 based on Foata normal form. 1861/18896 useless extension candidates. Maximal degree in co-relation 31247. Up to 8895 conditions per place. [2025-01-10 06:50:57,884 INFO L140 encePairwiseOnDemand]: 84/89 looper letters, 101 selfloop transitions, 4 changer transitions 0/136 dead transitions. [2025-01-10 06:50:57,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 136 transitions, 720 flow [2025-01-10 06:50:57,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:50:57,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:50:57,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 265 transitions. [2025-01-10 06:50:57,885 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7443820224719101 [2025-01-10 06:50:57,886 INFO L175 Difference]: Start difference. First operand has 92 places, 80 transitions, 288 flow. Second operand 4 states and 265 transitions. [2025-01-10 06:50:57,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 136 transitions, 720 flow [2025-01-10 06:50:57,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 136 transitions, 708 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 06:50:57,939 INFO L231 Difference]: Finished difference. Result has 91 places, 79 transitions, 278 flow [2025-01-10 06:50:57,940 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=278, PETRI_PLACES=91, PETRI_TRANSITIONS=79} [2025-01-10 06:50:57,940 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, 9 predicate places. [2025-01-10 06:50:57,940 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 79 transitions, 278 flow [2025-01-10 06:50:57,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.5) internal successors, (190), 4 states have internal predecessors, (190), 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:50:57,940 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:57,940 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:50:57,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 06:50:57,941 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-01-10 06:50:57,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:57,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1603914646, now seen corresponding path program 1 times [2025-01-10 06:50:57,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:57,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755839532] [2025-01-10 06:50:57,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:57,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:57,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:50:57,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:50:57,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:57,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:57,964 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:50:57,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:57,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755839532] [2025-01-10 06:50:57,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755839532] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:57,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:57,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:50:57,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190136274] [2025-01-10 06:50:57,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:57,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:50:57,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:57,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:50:57,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:50:57,979 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 89 [2025-01-10 06:50:57,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 79 transitions, 278 flow. Second operand has 4 states, 4 states have (on average 47.25) internal successors, (189), 4 states have internal predecessors, (189), 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:50:57,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:57,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 89 [2025-01-10 06:50:57,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:58,836 INFO L124 PetriNetUnfolderBase]: 12701/20098 cut-off events. [2025-01-10 06:50:58,836 INFO L125 PetriNetUnfolderBase]: For 24570/26071 co-relation queries the response was YES. [2025-01-10 06:50:58,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51490 conditions, 20098 events. 12701/20098 cut-off events. For 24570/26071 co-relation queries the response was YES. Maximal size of possible extension queue 1112. Compared 158119 event pairs, 4595 based on Foata normal form. 1776/20867 useless extension candidates. Maximal degree in co-relation 35113. Up to 8717 conditions per place. [2025-01-10 06:50:58,962 INFO L140 encePairwiseOnDemand]: 84/89 looper letters, 99 selfloop transitions, 5 changer transitions 0/135 dead transitions. [2025-01-10 06:50:58,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 135 transitions, 707 flow [2025-01-10 06:50:58,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:50:58,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:50:58,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 265 transitions. [2025-01-10 06:50:58,963 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7443820224719101 [2025-01-10 06:50:58,963 INFO L175 Difference]: Start difference. First operand has 91 places, 79 transitions, 278 flow. Second operand 4 states and 265 transitions. [2025-01-10 06:50:58,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 135 transitions, 707 flow [2025-01-10 06:50:58,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 135 transitions, 688 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:50:58,997 INFO L231 Difference]: Finished difference. Result has 91 places, 79 transitions, 282 flow [2025-01-10 06:50:58,997 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=282, PETRI_PLACES=91, PETRI_TRANSITIONS=79} [2025-01-10 06:50:58,997 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, 9 predicate places. [2025-01-10 06:50:58,997 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 79 transitions, 282 flow [2025-01-10 06:50:58,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.25) internal successors, (189), 4 states have internal predecessors, (189), 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:50:58,997 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:58,998 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:50:58,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-10 06:50:58,998 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread3Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-01-10 06:50:58,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:58,998 INFO L85 PathProgramCache]: Analyzing trace with hash -863972416, now seen corresponding path program 1 times [2025-01-10 06:50:58,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:58,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948085272] [2025-01-10 06:50:58,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:58,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:59,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 06:50:59,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 06:50:59,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:59,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:59,041 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:50:59,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:59,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948085272] [2025-01-10 06:50:59,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948085272] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:59,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:59,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:50:59,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441226514] [2025-01-10 06:50:59,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:59,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:50:59,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:59,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:50:59,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:50:59,062 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 89 [2025-01-10 06:50:59,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 79 transitions, 282 flow. Second operand has 6 states, 6 states have (on average 44.833333333333336) internal successors, (269), 6 states have internal predecessors, (269), 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:50:59,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:59,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 89 [2025-01-10 06:50:59,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:00,210 INFO L124 PetriNetUnfolderBase]: 13746/21383 cut-off events. [2025-01-10 06:51:00,210 INFO L125 PetriNetUnfolderBase]: For 30736/32891 co-relation queries the response was YES. [2025-01-10 06:51:00,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56967 conditions, 21383 events. 13746/21383 cut-off events. For 30736/32891 co-relation queries the response was YES. Maximal size of possible extension queue 1169. Compared 165224 event pairs, 2778 based on Foata normal form. 2709/23037 useless extension candidates. Maximal degree in co-relation 44476. Up to 5557 conditions per place. [2025-01-10 06:51:00,329 INFO L140 encePairwiseOnDemand]: 81/89 looper letters, 128 selfloop transitions, 9 changer transitions 0/166 dead transitions. [2025-01-10 06:51:00,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 166 transitions, 934 flow [2025-01-10 06:51:00,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:51:00,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:51:00,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 362 transitions. [2025-01-10 06:51:00,331 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6779026217228464 [2025-01-10 06:51:00,331 INFO L175 Difference]: Start difference. First operand has 91 places, 79 transitions, 282 flow. Second operand 6 states and 362 transitions. [2025-01-10 06:51:00,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 166 transitions, 934 flow [2025-01-10 06:51:00,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 166 transitions, 918 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:51:00,396 INFO L231 Difference]: Finished difference. Result has 95 places, 79 transitions, 303 flow [2025-01-10 06:51:00,396 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=303, PETRI_PLACES=95, PETRI_TRANSITIONS=79} [2025-01-10 06:51:00,397 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, 13 predicate places. [2025-01-10 06:51:00,397 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 79 transitions, 303 flow [2025-01-10 06:51:00,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 44.833333333333336) internal successors, (269), 6 states have internal predecessors, (269), 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:51:00,397 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:00,397 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:51:00,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-10 06:51:00,397 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-01-10 06:51:00,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:00,398 INFO L85 PathProgramCache]: Analyzing trace with hash -66023300, now seen corresponding path program 1 times [2025-01-10 06:51:00,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:00,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713777181] [2025-01-10 06:51:00,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:00,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:00,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 06:51:00,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 06:51:00,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:00,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:00,431 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:51:00,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:00,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713777181] [2025-01-10 06:51:00,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713777181] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:00,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:00,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:51:00,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996503387] [2025-01-10 06:51:00,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:00,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:51:00,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:00,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:51:00,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:51:00,454 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 89 [2025-01-10 06:51:00,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 79 transitions, 303 flow. Second operand has 5 states, 5 states have (on average 45.4) internal successors, (227), 5 states have internal predecessors, (227), 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:51:00,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:00,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 89 [2025-01-10 06:51:00,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:01,457 INFO L124 PetriNetUnfolderBase]: 13746/20724 cut-off events. [2025-01-10 06:51:01,457 INFO L125 PetriNetUnfolderBase]: For 32307/34421 co-relation queries the response was YES. [2025-01-10 06:51:01,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58546 conditions, 20724 events. 13746/20724 cut-off events. For 32307/34421 co-relation queries the response was YES. Maximal size of possible extension queue 1145. Compared 153317 event pairs, 5330 based on Foata normal form. 2391/22568 useless extension candidates. Maximal degree in co-relation 45907. Up to 9937 conditions per place. [2025-01-10 06:51:01,517 INFO L140 encePairwiseOnDemand]: 82/89 looper letters, 0 selfloop transitions, 0 changer transitions 196/196 dead transitions. [2025-01-10 06:51:01,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 196 transitions, 1131 flow [2025-01-10 06:51:01,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:51:01,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:51:01,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 388 transitions. [2025-01-10 06:51:01,518 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7265917602996255 [2025-01-10 06:51:01,518 INFO L175 Difference]: Start difference. First operand has 95 places, 79 transitions, 303 flow. Second operand 6 states and 388 transitions. [2025-01-10 06:51:01,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 196 transitions, 1131 flow [2025-01-10 06:51:01,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 196 transitions, 1113 flow, removed 1 selfloop flow, removed 5 redundant places. [2025-01-10 06:51:01,699 INFO L231 Difference]: Finished difference. Result has 94 places, 0 transitions, 0 flow [2025-01-10 06:51:01,699 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=94, PETRI_TRANSITIONS=0} [2025-01-10 06:51:01,699 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, 12 predicate places. [2025-01-10 06:51:01,700 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 0 transitions, 0 flow [2025-01-10 06:51:01,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.4) internal successors, (227), 5 states have internal predecessors, (227), 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:51:01,702 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 39 remaining) [2025-01-10 06:51:01,702 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 39 remaining) [2025-01-10 06:51:01,702 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 39 remaining) [2025-01-10 06:51:01,702 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 39 remaining) [2025-01-10 06:51:01,702 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 39 remaining) [2025-01-10 06:51:01,702 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 39 remaining) [2025-01-10 06:51:01,702 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 39 remaining) [2025-01-10 06:51:01,702 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 39 remaining) [2025-01-10 06:51:01,702 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 39 remaining) [2025-01-10 06:51:01,702 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 39 remaining) [2025-01-10 06:51:01,702 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 39 remaining) [2025-01-10 06:51:01,702 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 39 remaining) [2025-01-10 06:51:01,703 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 39 remaining) [2025-01-10 06:51:01,703 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 39 remaining) [2025-01-10 06:51:01,703 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 39 remaining) [2025-01-10 06:51:01,703 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 39 remaining) [2025-01-10 06:51:01,703 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 39 remaining) [2025-01-10 06:51:01,703 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 39 remaining) [2025-01-10 06:51:01,703 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 39 remaining) [2025-01-10 06:51:01,703 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 39 remaining) [2025-01-10 06:51:01,703 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 39 remaining) [2025-01-10 06:51:01,703 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 39 remaining) [2025-01-10 06:51:01,703 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 39 remaining) [2025-01-10 06:51:01,703 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 39 remaining) [2025-01-10 06:51:01,703 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 39 remaining) [2025-01-10 06:51:01,703 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 39 remaining) [2025-01-10 06:51:01,703 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 39 remaining) [2025-01-10 06:51:01,703 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 39 remaining) [2025-01-10 06:51:01,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 39 remaining) [2025-01-10 06:51:01,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 39 remaining) [2025-01-10 06:51:01,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 39 remaining) [2025-01-10 06:51:01,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 39 remaining) [2025-01-10 06:51:01,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 39 remaining) [2025-01-10 06:51:01,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 39 remaining) [2025-01-10 06:51:01,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 39 remaining) [2025-01-10 06:51:01,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 39 remaining) [2025-01-10 06:51:01,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 39 remaining) [2025-01-10 06:51:01,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 39 remaining) [2025-01-10 06:51:01,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 39 remaining) [2025-01-10 06:51:01,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-10 06:51:01,705 INFO L422 BasicCegarLoop]: Path program histogram: [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:51:01,709 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-10 06:51:01,709 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 06:51:01,721 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 06:51:01 BasicIcfg [2025-01-10 06:51:01,723 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 06:51:01,724 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 06:51:01,724 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 06:51:01,724 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 06:51:01,726 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:50:35" (3/4) ... [2025-01-10 06:51:01,727 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 06:51:01,729 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-01-10 06:51:01,730 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-01-10 06:51:01,730 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-01-10 06:51:01,737 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 70 nodes and edges [2025-01-10 06:51:01,738 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-01-10 06:51:01,738 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-10 06:51:01,738 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-01-10 06:51:01,791 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 06:51:01,792 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 06:51:01,792 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 06:51:01,792 INFO L158 Benchmark]: Toolchain (without parser) took 27605.04ms. Allocated memory was 142.6MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 106.4MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2025-01-10 06:51:01,793 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:51:01,793 INFO L158 Benchmark]: CACSL2BoogieTranslator took 173.10ms. Allocated memory is still 142.6MB. Free memory was 106.4MB in the beginning and 94.4MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 06:51:01,794 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.28ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 93.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:51:01,795 INFO L158 Benchmark]: Boogie Preprocessor took 47.34ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 91.4MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 06:51:01,795 INFO L158 Benchmark]: RCFGBuilder took 594.79ms. Allocated memory is still 142.6MB. Free memory was 91.4MB in the beginning and 45.9MB in the end (delta: 45.5MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-01-10 06:51:01,795 INFO L158 Benchmark]: TraceAbstraction took 26683.35ms. Allocated memory was 142.6MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 45.0MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2025-01-10 06:51:01,795 INFO L158 Benchmark]: Witness Printer took 68.17ms. Allocated memory is still 2.8GB. Free memory was 1.2GB in the beginning and 1.1GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 06:51:01,797 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.20ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 173.10ms. Allocated memory is still 142.6MB. Free memory was 106.4MB in the beginning and 94.4MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.28ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 93.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 47.34ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 91.4MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 594.79ms. Allocated memory is still 142.6MB. Free memory was 91.4MB in the beginning and 45.9MB in the end (delta: 45.5MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 26683.35ms. Allocated memory was 142.6MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 45.0MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. * Witness Printer took 68.17ms. Allocated memory is still 2.8GB. Free memory was 1.2GB in the beginning and 1.1GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 86]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 86]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 87]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 88]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 87]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 88]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 86]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 86]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 87]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 88]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 87]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 88]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 86]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 86]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 87]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 88]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 87]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 88]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 147 locations, 39 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: 26.5s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 25.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2056 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1755 mSDsluCounter, 224 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 99 mSDsCounter, 104 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4140 IncrementalHoareTripleChecker+Invalid, 4244 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 104 mSolverCounterUnsat, 125 mSDtfsCounter, 4140 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=303occurred in iteration=20, InterpolantAutomatonStates: 97, 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, 1.0s InterpolantComputationTime, 243 NumberOfCodeBlocks, 243 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 222 ConstructedInterpolants, 0 QuantifiedInterpolants, 731 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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 18 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-10 06:51:01,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE