./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/parallel-bakery-2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/parallel-bakery-2.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4f539592bc69a174492e01050b581a78ee6bfd25c2e79dba974730b39e2fa54b --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:51:07,295 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:51:07,352 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:51:07,356 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:51:07,357 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:51:07,373 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:51:07,373 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:51:07,373 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:51:07,373 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:51:07,373 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:51:07,374 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:51:07,374 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:51:07,374 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:51:07,374 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:51:07,374 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:51:07,374 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:51:07,374 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:51:07,374 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:51:07,374 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:51:07,374 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:51:07,374 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:51:07,374 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:51:07,374 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:51:07,374 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:51:07,375 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:51:07,375 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:51:07,375 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:51:07,375 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:51:07,375 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:51:07,375 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:51:07,375 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:51:07,375 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:51:07,375 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:51:07,375 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:51:07,375 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:51:07,375 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:51:07,375 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:51:07,375 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:51:07,375 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:51:07,375 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:51:07,375 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:51:07,376 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:51:07,376 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:51:07,376 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:51:07,376 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:51:07,376 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:51:07,376 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:51:07,376 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:51:07,376 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:51:07,376 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:51:07,376 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 -> 4f539592bc69a174492e01050b581a78ee6bfd25c2e79dba974730b39e2fa54b [2025-01-10 06:51:07,613 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:51:07,622 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:51:07,625 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:51:07,626 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:51:07,627 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:51:07,628 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-bakery-2.wvr.c [2025-01-10 06:51:08,740 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2c1c5c338/8d5e67a981814604b9afd84f2ac5e68a/FLAGd9ab5d301 [2025-01-10 06:51:08,970 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:51:08,974 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/parallel-bakery-2.wvr.c [2025-01-10 06:51:08,980 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2c1c5c338/8d5e67a981814604b9afd84f2ac5e68a/FLAGd9ab5d301 [2025-01-10 06:51:09,317 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2c1c5c338/8d5e67a981814604b9afd84f2ac5e68a [2025-01-10 06:51:09,319 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:51:09,320 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:51:09,321 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:51:09,321 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:51:09,324 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:51:09,325 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:51:09" (1/1) ... [2025-01-10 06:51:09,325 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57db6fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:51:09, skipping insertion in model container [2025-01-10 06:51:09,325 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:51:09" (1/1) ... [2025-01-10 06:51:09,338 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:51:09,438 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:51:09,445 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:51:09,462 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:51:09,472 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:51:09,472 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:51:09 WrapperNode [2025-01-10 06:51:09,473 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:51:09,473 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:51:09,473 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:51:09,474 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:51:09,478 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:51:09" (1/1) ... [2025-01-10 06:51:09,483 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:51:09" (1/1) ... [2025-01-10 06:51:09,502 INFO L138 Inliner]: procedures = 18, calls = 15, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 149 [2025-01-10 06:51:09,502 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:51:09,503 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:51:09,503 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:51:09,503 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:51:09,510 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:51:09" (1/1) ... [2025-01-10 06:51:09,510 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:51:09" (1/1) ... [2025-01-10 06:51:09,512 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:51:09" (1/1) ... [2025-01-10 06:51:09,530 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:51:09,530 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:51:09" (1/1) ... [2025-01-10 06:51:09,530 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:51:09" (1/1) ... [2025-01-10 06:51:09,533 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:51:09" (1/1) ... [2025-01-10 06:51:09,534 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:51:09" (1/1) ... [2025-01-10 06:51:09,539 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:51:09" (1/1) ... [2025-01-10 06:51:09,539 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:51:09" (1/1) ... [2025-01-10 06:51:09,540 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:51:09" (1/1) ... [2025-01-10 06:51:09,541 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:51:09,542 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:51:09,542 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:51:09,542 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:51:09,546 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:51:09" (1/1) ... [2025-01-10 06:51:09,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:51:09,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:51:09,572 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:51:09,577 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:51:09,593 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:51:09,594 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 06:51:09,594 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 06:51:09,594 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 06:51:09,594 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 06:51:09,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:51:09,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:51:09,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:51:09,596 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:51:09,665 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:51:09,667 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:51:09,874 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 06:51:09,874 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:51:09,981 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:51:09,982 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 06:51:09,982 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:51:09 BoogieIcfgContainer [2025-01-10 06:51:09,982 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:51:09,985 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:51:09,985 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:51:09,988 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:51:09,989 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:51:09" (1/3) ... [2025-01-10 06:51:09,989 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d51dccb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:51:09, skipping insertion in model container [2025-01-10 06:51:09,990 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:51:09" (2/3) ... [2025-01-10 06:51:09,990 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d51dccb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:51:09, skipping insertion in model container [2025-01-10 06:51:09,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:51:09" (3/3) ... [2025-01-10 06:51:09,991 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-bakery-2.wvr.c [2025-01-10 06:51:10,000 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:51:10,002 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-bakery-2.wvr.c that has 3 procedures, 63 locations, 1 initial locations, 0 loop locations, and 8 error locations. [2025-01-10 06:51:10,002 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 06:51:10,047 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-10 06:51:10,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 64 transitions, 142 flow [2025-01-10 06:51:10,102 INFO L124 PetriNetUnfolderBase]: 2/62 cut-off events. [2025-01-10 06:51:10,103 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 06:51:10,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 62 events. 2/62 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 69 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2025-01-10 06:51:10,108 INFO L82 GeneralOperation]: Start removeDead. Operand has 69 places, 64 transitions, 142 flow [2025-01-10 06:51:10,110 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 65 places, 60 transitions, 129 flow [2025-01-10 06:51:10,115 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:51:10,122 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;@13f694d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:51:10,122 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-01-10 06:51:10,129 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:51:10,129 INFO L124 PetriNetUnfolderBase]: 1/27 cut-off events. [2025-01-10 06:51:10,129 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:51:10,129 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:10,130 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:10,130 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 06:51:10,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:10,134 INFO L85 PathProgramCache]: Analyzing trace with hash -850074253, now seen corresponding path program 1 times [2025-01-10 06:51:10,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:10,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713561382] [2025-01-10 06:51:10,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:10,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:10,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 06:51:10,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 06:51:10,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:10,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:10,358 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:10,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:10,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713561382] [2025-01-10 06:51:10,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713561382] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:10,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:10,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:51:10,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141794704] [2025-01-10 06:51:10,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:10,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:51:10,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:10,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:51:10,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:51:10,399 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 64 [2025-01-10 06:51:10,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 60 transitions, 129 flow. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 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:10,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:10,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 64 [2025-01-10 06:51:10,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:10,616 INFO L124 PetriNetUnfolderBase]: 260/688 cut-off events. [2025-01-10 06:51:10,616 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-01-10 06:51:10,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1169 conditions, 688 events. 260/688 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4267 event pairs, 138 based on Foata normal form. 0/494 useless extension candidates. Maximal degree in co-relation 1104. Up to 293 conditions per place. [2025-01-10 06:51:10,621 INFO L140 encePairwiseOnDemand]: 57/64 looper letters, 35 selfloop transitions, 6 changer transitions 0/73 dead transitions. [2025-01-10 06:51:10,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 73 transitions, 240 flow [2025-01-10 06:51:10,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:51:10,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:51:10,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2025-01-10 06:51:10,631 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.75 [2025-01-10 06:51:10,632 INFO L175 Difference]: Start difference. First operand has 65 places, 60 transitions, 129 flow. Second operand 3 states and 144 transitions. [2025-01-10 06:51:10,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 73 transitions, 240 flow [2025-01-10 06:51:10,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 73 transitions, 234 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:51:10,639 INFO L231 Difference]: Finished difference. Result has 66 places, 62 transitions, 158 flow [2025-01-10 06:51:10,642 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=66, PETRI_TRANSITIONS=62} [2025-01-10 06:51:10,646 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 1 predicate places. [2025-01-10 06:51:10,646 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 62 transitions, 158 flow [2025-01-10 06:51:10,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 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:10,647 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:10,647 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:10,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:51:10,647 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 06:51:10,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:10,648 INFO L85 PathProgramCache]: Analyzing trace with hash -582498681, now seen corresponding path program 1 times [2025-01-10 06:51:10,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:10,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069430833] [2025-01-10 06:51:10,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:10,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:10,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 06:51:10,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 06:51:10,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:10,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:10,741 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:10,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:10,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069430833] [2025-01-10 06:51:10,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069430833] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:10,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:10,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:51:10,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939020386] [2025-01-10 06:51:10,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:10,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:51:10,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:10,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:51:10,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:51:10,778 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 64 [2025-01-10 06:51:10,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 62 transitions, 158 flow. Second operand has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 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:10,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:10,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 64 [2025-01-10 06:51:10,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:10,950 INFO L124 PetriNetUnfolderBase]: 464/1144 cut-off events. [2025-01-10 06:51:10,951 INFO L125 PetriNetUnfolderBase]: For 117/117 co-relation queries the response was YES. [2025-01-10 06:51:10,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2122 conditions, 1144 events. 464/1144 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 7311 event pairs, 54 based on Foata normal form. 0/908 useless extension candidates. Maximal degree in co-relation 1847. Up to 357 conditions per place. [2025-01-10 06:51:10,957 INFO L140 encePairwiseOnDemand]: 53/64 looper letters, 55 selfloop transitions, 13 changer transitions 0/94 dead transitions. [2025-01-10 06:51:10,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 94 transitions, 368 flow [2025-01-10 06:51:10,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:51:10,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:51:10,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 208 transitions. [2025-01-10 06:51:10,960 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.65 [2025-01-10 06:51:10,960 INFO L175 Difference]: Start difference. First operand has 66 places, 62 transitions, 158 flow. Second operand 5 states and 208 transitions. [2025-01-10 06:51:10,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 94 transitions, 368 flow [2025-01-10 06:51:10,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 94 transitions, 356 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:51:10,967 INFO L231 Difference]: Finished difference. Result has 72 places, 71 transitions, 238 flow [2025-01-10 06:51:10,968 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=238, PETRI_PLACES=72, PETRI_TRANSITIONS=71} [2025-01-10 06:51:10,968 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 7 predicate places. [2025-01-10 06:51:10,969 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 71 transitions, 238 flow [2025-01-10 06:51:10,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 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:10,969 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:10,969 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:10,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 06:51:10,970 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 06:51:10,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:10,971 INFO L85 PathProgramCache]: Analyzing trace with hash -850074252, now seen corresponding path program 1 times [2025-01-10 06:51:10,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:10,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452639117] [2025-01-10 06:51:10,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:10,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:10,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 06:51:10,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 06:51:10,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:10,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:11,027 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:11,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:11,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452639117] [2025-01-10 06:51:11,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452639117] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:11,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:11,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:51:11,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557413971] [2025-01-10 06:51:11,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:11,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:51:11,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:11,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:51:11,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:51:11,037 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 64 [2025-01-10 06:51:11,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 71 transitions, 238 flow. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 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:11,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:11,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 64 [2025-01-10 06:51:11,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:11,154 INFO L124 PetriNetUnfolderBase]: 305/885 cut-off events. [2025-01-10 06:51:11,154 INFO L125 PetriNetUnfolderBase]: For 513/536 co-relation queries the response was YES. [2025-01-10 06:51:11,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1790 conditions, 885 events. 305/885 cut-off events. For 513/536 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5987 event pairs, 98 based on Foata normal form. 26/723 useless extension candidates. Maximal degree in co-relation 1451. Up to 262 conditions per place. [2025-01-10 06:51:11,160 INFO L140 encePairwiseOnDemand]: 56/64 looper letters, 35 selfloop transitions, 10 changer transitions 0/81 dead transitions. [2025-01-10 06:51:11,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 81 transitions, 356 flow [2025-01-10 06:51:11,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:51:11,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:51:11,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 141 transitions. [2025-01-10 06:51:11,163 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.734375 [2025-01-10 06:51:11,163 INFO L175 Difference]: Start difference. First operand has 72 places, 71 transitions, 238 flow. Second operand 3 states and 141 transitions. [2025-01-10 06:51:11,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 81 transitions, 356 flow [2025-01-10 06:51:11,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 81 transitions, 354 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-01-10 06:51:11,168 INFO L231 Difference]: Finished difference. Result has 75 places, 71 transitions, 266 flow [2025-01-10 06:51:11,169 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=266, PETRI_PLACES=75, PETRI_TRANSITIONS=71} [2025-01-10 06:51:11,170 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 10 predicate places. [2025-01-10 06:51:11,170 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 71 transitions, 266 flow [2025-01-10 06:51:11,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 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:11,170 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:11,170 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:11,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:51:11,171 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 06:51:11,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:11,171 INFO L85 PathProgramCache]: Analyzing trace with hash -195996117, now seen corresponding path program 1 times [2025-01-10 06:51:11,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:11,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241839447] [2025-01-10 06:51:11,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:11,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:11,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 06:51:11,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 06:51:11,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:11,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:11,233 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:11,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:11,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241839447] [2025-01-10 06:51:11,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241839447] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:11,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:11,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:51:11,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504142796] [2025-01-10 06:51:11,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:11,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:51:11,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:11,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:51:11,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:51:11,244 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 64 [2025-01-10 06:51:11,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 71 transitions, 266 flow. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 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:11,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:11,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 64 [2025-01-10 06:51:11,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:11,354 INFO L124 PetriNetUnfolderBase]: 346/1064 cut-off events. [2025-01-10 06:51:11,354 INFO L125 PetriNetUnfolderBase]: For 551/590 co-relation queries the response was YES. [2025-01-10 06:51:11,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2173 conditions, 1064 events. 346/1064 cut-off events. For 551/590 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 7989 event pairs, 196 based on Foata normal form. 3/835 useless extension candidates. Maximal degree in co-relation 1220. Up to 375 conditions per place. [2025-01-10 06:51:11,361 INFO L140 encePairwiseOnDemand]: 57/64 looper letters, 39 selfloop transitions, 8 changer transitions 0/84 dead transitions. [2025-01-10 06:51:11,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 84 transitions, 407 flow [2025-01-10 06:51:11,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:51:11,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:51:11,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2025-01-10 06:51:11,362 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7447916666666666 [2025-01-10 06:51:11,362 INFO L175 Difference]: Start difference. First operand has 75 places, 71 transitions, 266 flow. Second operand 3 states and 143 transitions. [2025-01-10 06:51:11,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 84 transitions, 407 flow [2025-01-10 06:51:11,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 84 transitions, 395 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:51:11,365 INFO L231 Difference]: Finished difference. Result has 78 places, 73 transitions, 298 flow [2025-01-10 06:51:11,365 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=298, PETRI_PLACES=78, PETRI_TRANSITIONS=73} [2025-01-10 06:51:11,366 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 13 predicate places. [2025-01-10 06:51:11,366 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 73 transitions, 298 flow [2025-01-10 06:51:11,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 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:11,366 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:11,366 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:11,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 06:51:11,367 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 06:51:11,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:11,367 INFO L85 PathProgramCache]: Analyzing trace with hash -195996116, now seen corresponding path program 1 times [2025-01-10 06:51:11,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:11,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587153199] [2025-01-10 06:51:11,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:11,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:11,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 06:51:11,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 06:51:11,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:11,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:11,421 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:11,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:11,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587153199] [2025-01-10 06:51:11,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587153199] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:11,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:11,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:51:11,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019759417] [2025-01-10 06:51:11,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:11,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:51:11,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:11,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:51:11,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:51:11,431 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 64 [2025-01-10 06:51:11,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 73 transitions, 298 flow. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 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:11,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:11,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 64 [2025-01-10 06:51:11,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:11,563 INFO L124 PetriNetUnfolderBase]: 329/1055 cut-off events. [2025-01-10 06:51:11,563 INFO L125 PetriNetUnfolderBase]: For 716/751 co-relation queries the response was YES. [2025-01-10 06:51:11,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2260 conditions, 1055 events. 329/1055 cut-off events. For 716/751 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8031 event pairs, 130 based on Foata normal form. 8/873 useless extension candidates. Maximal degree in co-relation 1248. Up to 319 conditions per place. [2025-01-10 06:51:11,570 INFO L140 encePairwiseOnDemand]: 56/64 looper letters, 33 selfloop transitions, 12 changer transitions 0/82 dead transitions. [2025-01-10 06:51:11,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 82 transitions, 423 flow [2025-01-10 06:51:11,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:51:11,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:51:11,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2025-01-10 06:51:11,574 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7291666666666666 [2025-01-10 06:51:11,574 INFO L175 Difference]: Start difference. First operand has 78 places, 73 transitions, 298 flow. Second operand 3 states and 140 transitions. [2025-01-10 06:51:11,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 82 transitions, 423 flow [2025-01-10 06:51:11,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 82 transitions, 407 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:51:11,577 INFO L231 Difference]: Finished difference. Result has 79 places, 73 transitions, 322 flow [2025-01-10 06:51:11,577 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=322, PETRI_PLACES=79, PETRI_TRANSITIONS=73} [2025-01-10 06:51:11,580 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 14 predicate places. [2025-01-10 06:51:11,582 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 73 transitions, 322 flow [2025-01-10 06:51:11,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 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:11,582 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:11,582 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:11,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:51:11,582 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 06:51:11,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:11,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1780912926, now seen corresponding path program 1 times [2025-01-10 06:51:11,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:11,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113092532] [2025-01-10 06:51:11,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:11,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:11,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 06:51:11,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 06:51:11,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:11,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:11,650 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:11,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:11,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113092532] [2025-01-10 06:51:11,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113092532] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:11,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:11,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:51:11,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409218740] [2025-01-10 06:51:11,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:11,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:51:11,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:11,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:51:11,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:51:11,668 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 64 [2025-01-10 06:51:11,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 73 transitions, 322 flow. Second operand has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:51:11,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:11,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 64 [2025-01-10 06:51:11,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:11,817 INFO L124 PetriNetUnfolderBase]: 341/1014 cut-off events. [2025-01-10 06:51:11,818 INFO L125 PetriNetUnfolderBase]: For 1255/1279 co-relation queries the response was YES. [2025-01-10 06:51:11,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2334 conditions, 1014 events. 341/1014 cut-off events. For 1255/1279 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 7118 event pairs, 47 based on Foata normal form. 8/888 useless extension candidates. Maximal degree in co-relation 2083. Up to 337 conditions per place. [2025-01-10 06:51:11,823 INFO L140 encePairwiseOnDemand]: 53/64 looper letters, 60 selfloop transitions, 13 changer transitions 0/101 dead transitions. [2025-01-10 06:51:11,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 101 transitions, 585 flow [2025-01-10 06:51:11,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:51:11,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:51:11,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 201 transitions. [2025-01-10 06:51:11,825 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.628125 [2025-01-10 06:51:11,825 INFO L175 Difference]: Start difference. First operand has 79 places, 73 transitions, 322 flow. Second operand 5 states and 201 transitions. [2025-01-10 06:51:11,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 101 transitions, 585 flow [2025-01-10 06:51:11,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 101 transitions, 571 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:51:11,831 INFO L231 Difference]: Finished difference. Result has 86 places, 80 transitions, 404 flow [2025-01-10 06:51:11,831 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=404, PETRI_PLACES=86, PETRI_TRANSITIONS=80} [2025-01-10 06:51:11,833 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 21 predicate places. [2025-01-10 06:51:11,833 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 80 transitions, 404 flow [2025-01-10 06:51:11,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:51:11,834 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:11,834 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:11,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:51:11,834 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 06:51:11,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:11,835 INFO L85 PathProgramCache]: Analyzing trace with hash 171383401, now seen corresponding path program 1 times [2025-01-10 06:51:11,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:11,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139106340] [2025-01-10 06:51:11,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:11,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:11,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 06:51:11,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 06:51:11,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:11,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:11,891 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:11,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:11,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139106340] [2025-01-10 06:51:11,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139106340] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:11,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:11,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:51:11,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043447097] [2025-01-10 06:51:11,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:11,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:51:11,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:11,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:51:11,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:51:11,912 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 64 [2025-01-10 06:51:11,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 80 transitions, 404 flow. Second operand has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 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:11,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:11,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 64 [2025-01-10 06:51:11,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:12,094 INFO L124 PetriNetUnfolderBase]: 633/1499 cut-off events. [2025-01-10 06:51:12,095 INFO L125 PetriNetUnfolderBase]: For 1640/1670 co-relation queries the response was YES. [2025-01-10 06:51:12,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3790 conditions, 1499 events. 633/1499 cut-off events. For 1640/1670 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 10547 event pairs, 106 based on Foata normal form. 65/1467 useless extension candidates. Maximal degree in co-relation 2338. Up to 415 conditions per place. [2025-01-10 06:51:12,103 INFO L140 encePairwiseOnDemand]: 55/64 looper letters, 57 selfloop transitions, 9 changer transitions 3/109 dead transitions. [2025-01-10 06:51:12,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 109 transitions, 644 flow [2025-01-10 06:51:12,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:51:12,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:51:12,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 211 transitions. [2025-01-10 06:51:12,104 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.659375 [2025-01-10 06:51:12,105 INFO L175 Difference]: Start difference. First operand has 86 places, 80 transitions, 404 flow. Second operand 5 states and 211 transitions. [2025-01-10 06:51:12,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 109 transitions, 644 flow [2025-01-10 06:51:12,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 109 transitions, 642 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-01-10 06:51:12,111 INFO L231 Difference]: Finished difference. Result has 94 places, 84 transitions, 456 flow [2025-01-10 06:51:12,111 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=456, PETRI_PLACES=94, PETRI_TRANSITIONS=84} [2025-01-10 06:51:12,111 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 29 predicate places. [2025-01-10 06:51:12,111 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 84 transitions, 456 flow [2025-01-10 06:51:12,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 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:12,112 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:12,112 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:12,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 06:51:12,112 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 06:51:12,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:12,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1017918552, now seen corresponding path program 1 times [2025-01-10 06:51:12,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:12,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27316771] [2025-01-10 06:51:12,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:12,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:12,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 06:51:12,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 06:51:12,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:12,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:12,158 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:12,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:12,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27316771] [2025-01-10 06:51:12,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27316771] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:12,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:12,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:51:12,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961860088] [2025-01-10 06:51:12,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:12,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:51:12,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:12,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:51:12,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:51:12,174 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 64 [2025-01-10 06:51:12,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 84 transitions, 456 flow. Second operand has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 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:12,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:12,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 64 [2025-01-10 06:51:12,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:12,369 INFO L124 PetriNetUnfolderBase]: 539/1357 cut-off events. [2025-01-10 06:51:12,369 INFO L125 PetriNetUnfolderBase]: For 2046/2096 co-relation queries the response was YES. [2025-01-10 06:51:12,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3860 conditions, 1357 events. 539/1357 cut-off events. For 2046/2096 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 9574 event pairs, 127 based on Foata normal form. 79/1352 useless extension candidates. Maximal degree in co-relation 2583. Up to 356 conditions per place. [2025-01-10 06:51:12,377 INFO L140 encePairwiseOnDemand]: 55/64 looper letters, 63 selfloop transitions, 8 changer transitions 2/113 dead transitions. [2025-01-10 06:51:12,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 113 transitions, 731 flow [2025-01-10 06:51:12,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:51:12,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:51:12,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 214 transitions. [2025-01-10 06:51:12,380 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.66875 [2025-01-10 06:51:12,380 INFO L175 Difference]: Start difference. First operand has 94 places, 84 transitions, 456 flow. Second operand 5 states and 214 transitions. [2025-01-10 06:51:12,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 113 transitions, 731 flow [2025-01-10 06:51:12,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 113 transitions, 726 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:51:12,390 INFO L231 Difference]: Finished difference. Result has 98 places, 83 transitions, 469 flow [2025-01-10 06:51:12,390 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=447, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=469, PETRI_PLACES=98, PETRI_TRANSITIONS=83} [2025-01-10 06:51:12,391 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 33 predicate places. [2025-01-10 06:51:12,391 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 83 transitions, 469 flow [2025-01-10 06:51:12,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 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:12,391 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:12,391 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:12,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 06:51:12,393 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 06:51:12,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:12,393 INFO L85 PathProgramCache]: Analyzing trace with hash 983537605, now seen corresponding path program 1 times [2025-01-10 06:51:12,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:12,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806659848] [2025-01-10 06:51:12,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:12,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:12,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 06:51:12,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 06:51:12,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:12,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:12,455 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:12,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:12,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806659848] [2025-01-10 06:51:12,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806659848] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:12,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:12,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:51:12,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166531555] [2025-01-10 06:51:12,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:12,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:51:12,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:12,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:51:12,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:51:12,470 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 64 [2025-01-10 06:51:12,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 83 transitions, 469 flow. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:51:12,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:12,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 64 [2025-01-10 06:51:12,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:12,688 INFO L124 PetriNetUnfolderBase]: 645/1564 cut-off events. [2025-01-10 06:51:12,688 INFO L125 PetriNetUnfolderBase]: For 2486/2568 co-relation queries the response was YES. [2025-01-10 06:51:12,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4493 conditions, 1564 events. 645/1564 cut-off events. For 2486/2568 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 11181 event pairs, 115 based on Foata normal form. 114/1612 useless extension candidates. Maximal degree in co-relation 2927. Up to 382 conditions per place. [2025-01-10 06:51:12,700 INFO L140 encePairwiseOnDemand]: 55/64 looper letters, 57 selfloop transitions, 10 changer transitions 3/111 dead transitions. [2025-01-10 06:51:12,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 111 transitions, 720 flow [2025-01-10 06:51:12,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:51:12,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:51:12,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 211 transitions. [2025-01-10 06:51:12,701 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.659375 [2025-01-10 06:51:12,701 INFO L175 Difference]: Start difference. First operand has 98 places, 83 transitions, 469 flow. Second operand 5 states and 211 transitions. [2025-01-10 06:51:12,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 111 transitions, 720 flow [2025-01-10 06:51:12,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 111 transitions, 692 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-01-10 06:51:12,709 INFO L231 Difference]: Finished difference. Result has 102 places, 87 transitions, 510 flow [2025-01-10 06:51:12,709 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=510, PETRI_PLACES=102, PETRI_TRANSITIONS=87} [2025-01-10 06:51:12,711 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 37 predicate places. [2025-01-10 06:51:12,711 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 87 transitions, 510 flow [2025-01-10 06:51:12,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:51:12,711 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:12,712 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:12,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 06:51:12,712 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 06:51:12,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:12,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1093917847, now seen corresponding path program 1 times [2025-01-10 06:51:12,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:12,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802904451] [2025-01-10 06:51:12,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:12,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:12,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 06:51:12,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 06:51:12,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:12,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:12,803 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:12,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:12,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802904451] [2025-01-10 06:51:12,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802904451] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:12,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:12,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:51:12,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376001282] [2025-01-10 06:51:12,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:12,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:51:12,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:12,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:51:12,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:51:12,848 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 64 [2025-01-10 06:51:12,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 87 transitions, 510 flow. Second operand has 6 states, 6 states have (on average 31.333333333333332) internal successors, (188), 6 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:51:12,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:12,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 64 [2025-01-10 06:51:12,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:13,106 INFO L124 PetriNetUnfolderBase]: 506/1452 cut-off events. [2025-01-10 06:51:13,106 INFO L125 PetriNetUnfolderBase]: For 2997/3055 co-relation queries the response was YES. [2025-01-10 06:51:13,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4320 conditions, 1452 events. 506/1452 cut-off events. For 2997/3055 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 10623 event pairs, 60 based on Foata normal form. 47/1454 useless extension candidates. Maximal degree in co-relation 3961. Up to 252 conditions per place. [2025-01-10 06:51:13,115 INFO L140 encePairwiseOnDemand]: 51/64 looper letters, 69 selfloop transitions, 41 changer transitions 3/148 dead transitions. [2025-01-10 06:51:13,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 148 transitions, 1019 flow [2025-01-10 06:51:13,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 06:51:13,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 06:51:13,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 433 transitions. [2025-01-10 06:51:13,117 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5638020833333334 [2025-01-10 06:51:13,117 INFO L175 Difference]: Start difference. First operand has 102 places, 87 transitions, 510 flow. Second operand 12 states and 433 transitions. [2025-01-10 06:51:13,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 148 transitions, 1019 flow [2025-01-10 06:51:13,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 148 transitions, 1012 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-10 06:51:13,127 INFO L231 Difference]: Finished difference. Result has 112 places, 103 transitions, 716 flow [2025-01-10 06:51:13,128 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=499, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=716, PETRI_PLACES=112, PETRI_TRANSITIONS=103} [2025-01-10 06:51:13,128 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 47 predicate places. [2025-01-10 06:51:13,129 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 103 transitions, 716 flow [2025-01-10 06:51:13,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.333333333333332) internal successors, (188), 6 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:51:13,129 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:13,129 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:13,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 06:51:13,129 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 06:51:13,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:13,130 INFO L85 PathProgramCache]: Analyzing trace with hash -973449390, now seen corresponding path program 1 times [2025-01-10 06:51:13,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:13,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293460902] [2025-01-10 06:51:13,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:13,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:13,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 06:51:13,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 06:51:13,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:13,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:13,226 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:13,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:13,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293460902] [2025-01-10 06:51:13,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293460902] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:13,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:13,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:51:13,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780567201] [2025-01-10 06:51:13,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:13,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:51:13,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:13,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:51:13,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:51:13,263 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 64 [2025-01-10 06:51:13,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 103 transitions, 716 flow. Second operand has 6 states, 6 states have (on average 31.333333333333332) internal successors, (188), 6 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:51:13,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:13,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 64 [2025-01-10 06:51:13,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:13,537 INFO L124 PetriNetUnfolderBase]: 590/1887 cut-off events. [2025-01-10 06:51:13,537 INFO L125 PetriNetUnfolderBase]: For 5333/5548 co-relation queries the response was YES. [2025-01-10 06:51:13,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5901 conditions, 1887 events. 590/1887 cut-off events. For 5333/5548 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 15672 event pairs, 208 based on Foata normal form. 111/1957 useless extension candidates. Maximal degree in co-relation 5238. Up to 410 conditions per place. [2025-01-10 06:51:13,548 INFO L140 encePairwiseOnDemand]: 51/64 looper letters, 82 selfloop transitions, 34 changer transitions 10/161 dead transitions. [2025-01-10 06:51:13,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 161 transitions, 1351 flow [2025-01-10 06:51:13,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 06:51:13,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 06:51:13,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 336 transitions. [2025-01-10 06:51:13,554 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2025-01-10 06:51:13,554 INFO L175 Difference]: Start difference. First operand has 112 places, 103 transitions, 716 flow. Second operand 9 states and 336 transitions. [2025-01-10 06:51:13,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 161 transitions, 1351 flow [2025-01-10 06:51:13,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 161 transitions, 1269 flow, removed 22 selfloop flow, removed 2 redundant places. [2025-01-10 06:51:13,568 INFO L231 Difference]: Finished difference. Result has 123 places, 116 transitions, 899 flow [2025-01-10 06:51:13,569 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=667, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=899, PETRI_PLACES=123, PETRI_TRANSITIONS=116} [2025-01-10 06:51:13,569 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 58 predicate places. [2025-01-10 06:51:13,569 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 116 transitions, 899 flow [2025-01-10 06:51:13,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.333333333333332) internal successors, (188), 6 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:51:13,569 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:13,569 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:13,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 06:51:13,570 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 06:51:13,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:13,570 INFO L85 PathProgramCache]: Analyzing trace with hash -3906924, now seen corresponding path program 1 times [2025-01-10 06:51:13,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:13,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394923346] [2025-01-10 06:51:13,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:13,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:13,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 06:51:13,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 06:51:13,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:13,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:13,640 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:13,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:13,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394923346] [2025-01-10 06:51:13,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394923346] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:13,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:13,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:51:13,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423819799] [2025-01-10 06:51:13,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:13,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:51:13,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:13,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:51:13,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:51:13,675 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 64 [2025-01-10 06:51:13,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 116 transitions, 899 flow. Second operand has 6 states, 6 states have (on average 31.333333333333332) internal successors, (188), 6 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:51:13,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:13,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 64 [2025-01-10 06:51:13,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:13,956 INFO L124 PetriNetUnfolderBase]: 637/2364 cut-off events. [2025-01-10 06:51:13,956 INFO L125 PetriNetUnfolderBase]: For 7348/7706 co-relation queries the response was YES. [2025-01-10 06:51:13,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7131 conditions, 2364 events. 637/2364 cut-off events. For 7348/7706 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 22482 event pairs, 167 based on Foata normal form. 142/2461 useless extension candidates. Maximal degree in co-relation 6250. Up to 371 conditions per place. [2025-01-10 06:51:13,971 INFO L140 encePairwiseOnDemand]: 51/64 looper letters, 89 selfloop transitions, 36 changer transitions 6/169 dead transitions. [2025-01-10 06:51:13,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 169 transitions, 1510 flow [2025-01-10 06:51:13,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 06:51:13,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 06:51:13,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 334 transitions. [2025-01-10 06:51:13,973 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5798611111111112 [2025-01-10 06:51:13,973 INFO L175 Difference]: Start difference. First operand has 123 places, 116 transitions, 899 flow. Second operand 9 states and 334 transitions. [2025-01-10 06:51:13,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 169 transitions, 1510 flow [2025-01-10 06:51:13,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 169 transitions, 1488 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-01-10 06:51:14,010 INFO L231 Difference]: Finished difference. Result has 134 places, 126 transitions, 1118 flow [2025-01-10 06:51:14,010 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=862, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1118, PETRI_PLACES=134, PETRI_TRANSITIONS=126} [2025-01-10 06:51:14,012 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 69 predicate places. [2025-01-10 06:51:14,012 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 126 transitions, 1118 flow [2025-01-10 06:51:14,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.333333333333332) internal successors, (188), 6 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:51:14,012 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:14,012 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:14,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 06:51:14,013 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 06:51:14,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:14,013 INFO L85 PathProgramCache]: Analyzing trace with hash 428818033, now seen corresponding path program 1 times [2025-01-10 06:51:14,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:14,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170094257] [2025-01-10 06:51:14,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:14,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:14,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 06:51:14,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 06:51:14,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:14,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:14,081 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:14,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:14,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170094257] [2025-01-10 06:51:14,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170094257] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:14,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:14,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:51:14,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344028098] [2025-01-10 06:51:14,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:14,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:51:14,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:14,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:51:14,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:51:14,106 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 64 [2025-01-10 06:51:14,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 126 transitions, 1118 flow. Second operand has 6 states, 6 states have (on average 31.333333333333332) internal successors, (188), 6 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:51:14,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:14,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 64 [2025-01-10 06:51:14,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:14,418 INFO L124 PetriNetUnfolderBase]: 490/2090 cut-off events. [2025-01-10 06:51:14,418 INFO L125 PetriNetUnfolderBase]: For 8481/8888 co-relation queries the response was YES. [2025-01-10 06:51:14,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6698 conditions, 2090 events. 490/2090 cut-off events. For 8481/8888 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 20515 event pairs, 58 based on Foata normal form. 210/2285 useless extension candidates. Maximal degree in co-relation 6348. Up to 294 conditions per place. [2025-01-10 06:51:14,427 INFO L140 encePairwiseOnDemand]: 51/64 looper letters, 74 selfloop transitions, 58 changer transitions 0/170 dead transitions. [2025-01-10 06:51:14,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 170 transitions, 1627 flow [2025-01-10 06:51:14,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 06:51:14,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 06:51:14,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 423 transitions. [2025-01-10 06:51:14,429 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.55078125 [2025-01-10 06:51:14,429 INFO L175 Difference]: Start difference. First operand has 134 places, 126 transitions, 1118 flow. Second operand 12 states and 423 transitions. [2025-01-10 06:51:14,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 170 transitions, 1627 flow [2025-01-10 06:51:14,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 170 transitions, 1520 flow, removed 17 selfloop flow, removed 6 redundant places. [2025-01-10 06:51:14,450 INFO L231 Difference]: Finished difference. Result has 139 places, 131 transitions, 1203 flow [2025-01-10 06:51:14,450 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=998, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1203, PETRI_PLACES=139, PETRI_TRANSITIONS=131} [2025-01-10 06:51:14,451 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 74 predicate places. [2025-01-10 06:51:14,451 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 131 transitions, 1203 flow [2025-01-10 06:51:14,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.333333333333332) internal successors, (188), 6 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:51:14,451 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:14,451 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:14,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 06:51:14,451 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 06:51:14,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:14,452 INFO L85 PathProgramCache]: Analyzing trace with hash 424895120, now seen corresponding path program 1 times [2025-01-10 06:51:14,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:14,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79923230] [2025-01-10 06:51:14,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:14,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:14,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 06:51:14,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 06:51:14,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:14,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:14,494 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:14,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:14,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79923230] [2025-01-10 06:51:14,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79923230] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:14,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:14,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:51:14,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280081061] [2025-01-10 06:51:14,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:14,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:51:14,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:14,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:51:14,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:51:14,514 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 64 [2025-01-10 06:51:14,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 131 transitions, 1203 flow. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:51:14,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:14,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 64 [2025-01-10 06:51:14,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:14,769 INFO L124 PetriNetUnfolderBase]: 918/2705 cut-off events. [2025-01-10 06:51:14,769 INFO L125 PetriNetUnfolderBase]: For 9280/9395 co-relation queries the response was YES. [2025-01-10 06:51:14,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8664 conditions, 2705 events. 918/2705 cut-off events. For 9280/9395 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 24924 event pairs, 313 based on Foata normal form. 168/2781 useless extension candidates. Maximal degree in co-relation 8265. Up to 808 conditions per place. [2025-01-10 06:51:14,780 INFO L140 encePairwiseOnDemand]: 55/64 looper letters, 68 selfloop transitions, 8 changer transitions 3/156 dead transitions. [2025-01-10 06:51:14,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 156 transitions, 1542 flow [2025-01-10 06:51:14,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:51:14,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:51:14,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 204 transitions. [2025-01-10 06:51:14,781 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6375 [2025-01-10 06:51:14,782 INFO L175 Difference]: Start difference. First operand has 139 places, 131 transitions, 1203 flow. Second operand 5 states and 204 transitions. [2025-01-10 06:51:14,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 156 transitions, 1542 flow [2025-01-10 06:51:14,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 156 transitions, 1500 flow, removed 13 selfloop flow, removed 3 redundant places. [2025-01-10 06:51:14,802 INFO L231 Difference]: Finished difference. Result has 140 places, 128 transitions, 1166 flow [2025-01-10 06:51:14,803 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=1165, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1166, PETRI_PLACES=140, PETRI_TRANSITIONS=128} [2025-01-10 06:51:14,803 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 75 predicate places. [2025-01-10 06:51:14,803 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 128 transitions, 1166 flow [2025-01-10 06:51:14,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:51:14,803 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:14,803 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:14,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 06:51:14,803 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 06:51:14,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:14,804 INFO L85 PathProgramCache]: Analyzing trace with hash 591457429, now seen corresponding path program 1 times [2025-01-10 06:51:14,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:14,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439751386] [2025-01-10 06:51:14,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:14,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:14,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-10 06:51:14,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-10 06:51:14,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:14,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:14,869 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:14,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:14,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439751386] [2025-01-10 06:51:14,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439751386] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:14,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:14,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:51:14,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579073939] [2025-01-10 06:51:14,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:14,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:51:14,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:14,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:51:14,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:51:14,892 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 64 [2025-01-10 06:51:14,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 128 transitions, 1166 flow. Second operand has 5 states, 5 states have (on average 33.4) internal successors, (167), 5 states have internal predecessors, (167), 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:14,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:14,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 64 [2025-01-10 06:51:14,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:15,099 INFO L124 PetriNetUnfolderBase]: 397/1799 cut-off events. [2025-01-10 06:51:15,100 INFO L125 PetriNetUnfolderBase]: For 7205/7563 co-relation queries the response was YES. [2025-01-10 06:51:15,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5736 conditions, 1799 events. 397/1799 cut-off events. For 7205/7563 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 17281 event pairs, 84 based on Foata normal form. 128/1910 useless extension candidates. Maximal degree in co-relation 5462. Up to 222 conditions per place. [2025-01-10 06:51:15,110 INFO L140 encePairwiseOnDemand]: 52/64 looper letters, 79 selfloop transitions, 34 changer transitions 0/152 dead transitions. [2025-01-10 06:51:15,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 152 transitions, 1514 flow [2025-01-10 06:51:15,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:51:15,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:51:15,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 240 transitions. [2025-01-10 06:51:15,111 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.625 [2025-01-10 06:51:15,111 INFO L175 Difference]: Start difference. First operand has 140 places, 128 transitions, 1166 flow. Second operand 6 states and 240 transitions. [2025-01-10 06:51:15,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 152 transitions, 1514 flow [2025-01-10 06:51:15,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 152 transitions, 1483 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-01-10 06:51:15,136 INFO L231 Difference]: Finished difference. Result has 140 places, 127 transitions, 1226 flow [2025-01-10 06:51:15,136 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=1114, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1226, PETRI_PLACES=140, PETRI_TRANSITIONS=127} [2025-01-10 06:51:15,136 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 75 predicate places. [2025-01-10 06:51:15,136 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 127 transitions, 1226 flow [2025-01-10 06:51:15,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.4) internal successors, (167), 5 states have internal predecessors, (167), 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:15,137 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:15,137 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:15,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 06:51:15,137 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 06:51:15,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:15,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1557673871, now seen corresponding path program 1 times [2025-01-10 06:51:15,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:15,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915097121] [2025-01-10 06:51:15,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:15,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:15,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-10 06:51:15,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-10 06:51:15,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:15,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:15,205 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:15,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:15,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915097121] [2025-01-10 06:51:15,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915097121] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:15,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:15,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:51:15,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920244159] [2025-01-10 06:51:15,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:15,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:51:15,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:15,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:51:15,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:51:15,229 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 64 [2025-01-10 06:51:15,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 127 transitions, 1226 flow. Second operand has 5 states, 5 states have (on average 33.4) internal successors, (167), 5 states have internal predecessors, (167), 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:15,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:15,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 64 [2025-01-10 06:51:15,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:15,436 INFO L124 PetriNetUnfolderBase]: 381/1709 cut-off events. [2025-01-10 06:51:15,436 INFO L125 PetriNetUnfolderBase]: For 7842/8193 co-relation queries the response was YES. [2025-01-10 06:51:15,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5384 conditions, 1709 events. 381/1709 cut-off events. For 7842/8193 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 16116 event pairs, 81 based on Foata normal form. 120/1816 useless extension candidates. Maximal degree in co-relation 5126. Up to 233 conditions per place. [2025-01-10 06:51:15,443 INFO L140 encePairwiseOnDemand]: 53/64 looper letters, 81 selfloop transitions, 32 changer transitions 0/152 dead transitions. [2025-01-10 06:51:15,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 152 transitions, 1598 flow [2025-01-10 06:51:15,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:51:15,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:51:15,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 239 transitions. [2025-01-10 06:51:15,445 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6223958333333334 [2025-01-10 06:51:15,445 INFO L175 Difference]: Start difference. First operand has 140 places, 127 transitions, 1226 flow. Second operand 6 states and 239 transitions. [2025-01-10 06:51:15,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 152 transitions, 1598 flow [2025-01-10 06:51:15,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 152 transitions, 1574 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-01-10 06:51:15,457 INFO L231 Difference]: Finished difference. Result has 143 places, 126 transitions, 1286 flow [2025-01-10 06:51:15,457 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=1179, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1286, PETRI_PLACES=143, PETRI_TRANSITIONS=126} [2025-01-10 06:51:15,457 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 78 predicate places. [2025-01-10 06:51:15,457 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 126 transitions, 1286 flow [2025-01-10 06:51:15,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.4) internal successors, (167), 5 states have internal predecessors, (167), 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:15,457 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:15,457 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:15,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 06:51:15,458 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 06:51:15,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:15,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1214213649, now seen corresponding path program 1 times [2025-01-10 06:51:15,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:15,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713157277] [2025-01-10 06:51:15,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:15,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:15,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-10 06:51:15,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-10 06:51:15,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:15,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:15,513 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:15,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:15,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713157277] [2025-01-10 06:51:15,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713157277] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:15,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:15,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:51:15,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743965875] [2025-01-10 06:51:15,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:15,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:51:15,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:15,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:51:15,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:51:15,538 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 64 [2025-01-10 06:51:15,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 126 transitions, 1286 flow. Second operand has 6 states, 6 states have (on average 30.0) internal successors, (180), 6 states have internal predecessors, (180), 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:15,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:15,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 64 [2025-01-10 06:51:15,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:15,812 INFO L124 PetriNetUnfolderBase]: 973/2682 cut-off events. [2025-01-10 06:51:15,812 INFO L125 PetriNetUnfolderBase]: For 9523/9618 co-relation queries the response was YES. [2025-01-10 06:51:15,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8420 conditions, 2682 events. 973/2682 cut-off events. For 9523/9618 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 23356 event pairs, 242 based on Foata normal form. 138/2764 useless extension candidates. Maximal degree in co-relation 5947. Up to 627 conditions per place. [2025-01-10 06:51:15,829 INFO L140 encePairwiseOnDemand]: 54/64 looper letters, 76 selfloop transitions, 9 changer transitions 4/159 dead transitions. [2025-01-10 06:51:15,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 159 transitions, 1683 flow [2025-01-10 06:51:15,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 06:51:15,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 06:51:15,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 243 transitions. [2025-01-10 06:51:15,830 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5424107142857143 [2025-01-10 06:51:15,830 INFO L175 Difference]: Start difference. First operand has 143 places, 126 transitions, 1286 flow. Second operand 7 states and 243 transitions. [2025-01-10 06:51:15,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 159 transitions, 1683 flow [2025-01-10 06:51:15,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 159 transitions, 1672 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:51:15,846 INFO L231 Difference]: Finished difference. Result has 146 places, 125 transitions, 1290 flow [2025-01-10 06:51:15,847 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=1272, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1290, PETRI_PLACES=146, PETRI_TRANSITIONS=125} [2025-01-10 06:51:15,847 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 81 predicate places. [2025-01-10 06:51:15,847 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 125 transitions, 1290 flow [2025-01-10 06:51:15,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 30.0) internal successors, (180), 6 states have internal predecessors, (180), 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:15,847 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:15,848 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:15,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 06:51:15,848 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 06:51:15,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:15,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1609585059, now seen corresponding path program 1 times [2025-01-10 06:51:15,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:15,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505081738] [2025-01-10 06:51:15,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:15,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:15,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-10 06:51:15,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-10 06:51:15,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:15,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:15,918 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:15,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:15,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505081738] [2025-01-10 06:51:15,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505081738] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:15,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:15,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:51:15,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900791364] [2025-01-10 06:51:15,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:15,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:51:15,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:15,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:51:15,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:51:15,943 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 64 [2025-01-10 06:51:15,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 125 transitions, 1290 flow. Second operand has 6 states, 6 states have (on average 30.0) internal successors, (180), 6 states have internal predecessors, (180), 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:15,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:15,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 64 [2025-01-10 06:51:15,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:16,222 INFO L124 PetriNetUnfolderBase]: 914/2561 cut-off events. [2025-01-10 06:51:16,222 INFO L125 PetriNetUnfolderBase]: For 10178/10241 co-relation queries the response was YES. [2025-01-10 06:51:16,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8429 conditions, 2561 events. 914/2561 cut-off events. For 10178/10241 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 22141 event pairs, 244 based on Foata normal form. 92/2599 useless extension candidates. Maximal degree in co-relation 6040. Up to 599 conditions per place. [2025-01-10 06:51:16,235 INFO L140 encePairwiseOnDemand]: 54/64 looper letters, 73 selfloop transitions, 9 changer transitions 4/156 dead transitions. [2025-01-10 06:51:16,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 156 transitions, 1675 flow [2025-01-10 06:51:16,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 06:51:16,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 06:51:16,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 240 transitions. [2025-01-10 06:51:16,237 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5357142857142857 [2025-01-10 06:51:16,237 INFO L175 Difference]: Start difference. First operand has 146 places, 125 transitions, 1290 flow. Second operand 7 states and 240 transitions. [2025-01-10 06:51:16,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 156 transitions, 1675 flow [2025-01-10 06:51:16,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 156 transitions, 1649 flow, removed 1 selfloop flow, removed 6 redundant places. [2025-01-10 06:51:16,252 INFO L231 Difference]: Finished difference. Result has 145 places, 124 transitions, 1281 flow [2025-01-10 06:51:16,252 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=1263, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1281, PETRI_PLACES=145, PETRI_TRANSITIONS=124} [2025-01-10 06:51:16,254 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 80 predicate places. [2025-01-10 06:51:16,254 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 124 transitions, 1281 flow [2025-01-10 06:51:16,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 30.0) internal successors, (180), 6 states have internal predecessors, (180), 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:16,254 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:16,254 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:16,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 06:51:16,254 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 06:51:16,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:16,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1107292166, now seen corresponding path program 1 times [2025-01-10 06:51:16,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:16,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186008771] [2025-01-10 06:51:16,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:16,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:16,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-10 06:51:16,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-10 06:51:16,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:16,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:16,315 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:16,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:16,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186008771] [2025-01-10 06:51:16,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186008771] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:16,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:16,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:51:16,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799226695] [2025-01-10 06:51:16,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:16,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:51:16,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:16,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:51:16,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:51:16,341 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 64 [2025-01-10 06:51:16,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 124 transitions, 1281 flow. Second operand has 6 states, 6 states have (on average 30.0) internal successors, (180), 6 states have internal predecessors, (180), 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:16,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:16,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 64 [2025-01-10 06:51:16,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:16,619 INFO L124 PetriNetUnfolderBase]: 841/2424 cut-off events. [2025-01-10 06:51:16,619 INFO L125 PetriNetUnfolderBase]: For 10040/10109 co-relation queries the response was YES. [2025-01-10 06:51:16,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7948 conditions, 2424 events. 841/2424 cut-off events. For 10040/10109 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 21053 event pairs, 193 based on Foata normal form. 112/2488 useless extension candidates. Maximal degree in co-relation 5634. Up to 625 conditions per place. [2025-01-10 06:51:16,628 INFO L140 encePairwiseOnDemand]: 54/64 looper letters, 50 selfloop transitions, 7 changer transitions 59/167 dead transitions. [2025-01-10 06:51:16,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 167 transitions, 1765 flow [2025-01-10 06:51:16,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 06:51:16,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 06:51:16,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 326 transitions. [2025-01-10 06:51:16,630 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.509375 [2025-01-10 06:51:16,630 INFO L175 Difference]: Start difference. First operand has 145 places, 124 transitions, 1281 flow. Second operand 10 states and 326 transitions. [2025-01-10 06:51:16,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 167 transitions, 1765 flow [2025-01-10 06:51:16,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 167 transitions, 1740 flow, removed 1 selfloop flow, removed 6 redundant places. [2025-01-10 06:51:16,643 INFO L231 Difference]: Finished difference. Result has 147 places, 94 transitions, 912 flow [2025-01-10 06:51:16,643 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=1254, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=912, PETRI_PLACES=147, PETRI_TRANSITIONS=94} [2025-01-10 06:51:16,643 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 82 predicate places. [2025-01-10 06:51:16,643 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 94 transitions, 912 flow [2025-01-10 06:51:16,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 30.0) internal successors, (180), 6 states have internal predecessors, (180), 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:16,644 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:16,644 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:16,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-10 06:51:16,644 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 06:51:16,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:16,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1896133424, now seen corresponding path program 1 times [2025-01-10 06:51:16,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:16,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259141708] [2025-01-10 06:51:16,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:16,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:16,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-10 06:51:16,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-10 06:51:16,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:16,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:16,707 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:16,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:16,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259141708] [2025-01-10 06:51:16,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259141708] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:16,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:16,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:51:16,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335365542] [2025-01-10 06:51:16,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:16,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:51:16,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:16,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:51:16,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:51:16,738 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 64 [2025-01-10 06:51:16,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 94 transitions, 912 flow. Second operand has 6 states, 6 states have (on average 30.0) internal successors, (180), 6 states have internal predecessors, (180), 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:16,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:16,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 64 [2025-01-10 06:51:16,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:16,880 INFO L124 PetriNetUnfolderBase]: 378/1128 cut-off events. [2025-01-10 06:51:16,880 INFO L125 PetriNetUnfolderBase]: For 5096/5117 co-relation queries the response was YES. [2025-01-10 06:51:16,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3873 conditions, 1128 events. 378/1128 cut-off events. For 5096/5117 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 8094 event pairs, 91 based on Foata normal form. 63/1156 useless extension candidates. Maximal degree in co-relation 3451. Up to 228 conditions per place. [2025-01-10 06:51:16,884 INFO L140 encePairwiseOnDemand]: 54/64 looper letters, 0 selfloop transitions, 0 changer transitions 111/111 dead transitions. [2025-01-10 06:51:16,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 111 transitions, 1157 flow [2025-01-10 06:51:16,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 06:51:16,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 06:51:16,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 273 transitions. [2025-01-10 06:51:16,886 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4739583333333333 [2025-01-10 06:51:16,886 INFO L175 Difference]: Start difference. First operand has 147 places, 94 transitions, 912 flow. Second operand 9 states and 273 transitions. [2025-01-10 06:51:16,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 111 transitions, 1157 flow [2025-01-10 06:51:16,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 111 transitions, 1051 flow, removed 2 selfloop flow, removed 23 redundant places. [2025-01-10 06:51:16,894 INFO L231 Difference]: Finished difference. Result has 120 places, 0 transitions, 0 flow [2025-01-10 06:51:16,895 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=807, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=0, PETRI_PLACES=120, PETRI_TRANSITIONS=0} [2025-01-10 06:51:16,895 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 55 predicate places. [2025-01-10 06:51:16,895 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 0 transitions, 0 flow [2025-01-10 06:51:16,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 30.0) internal successors, (180), 6 states have internal predecessors, (180), 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:16,899 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 18 remaining) [2025-01-10 06:51:16,899 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 18 remaining) [2025-01-10 06:51:16,899 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2025-01-10 06:51:16,899 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2025-01-10 06:51:16,899 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2025-01-10 06:51:16,899 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2025-01-10 06:51:16,899 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2025-01-10 06:51:16,899 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2025-01-10 06:51:16,899 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 18 remaining) [2025-01-10 06:51:16,900 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 18 remaining) [2025-01-10 06:51:16,900 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 18 remaining) [2025-01-10 06:51:16,900 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2025-01-10 06:51:16,900 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2025-01-10 06:51:16,900 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2025-01-10 06:51:16,900 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2025-01-10 06:51:16,900 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2025-01-10 06:51:16,900 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2025-01-10 06:51:16,900 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2025-01-10 06:51:16,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-10 06:51:16,900 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] [2025-01-10 06:51:16,906 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-10 06:51:16,906 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 06:51:16,911 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 06:51:16 BasicIcfg [2025-01-10 06:51:16,911 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 06:51:16,912 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 06:51:16,912 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 06:51:16,912 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 06:51:16,913 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:51:09" (3/4) ... [2025-01-10 06:51:16,914 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 06:51:16,917 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-01-10 06:51:16,917 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-01-10 06:51:16,922 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 61 nodes and edges [2025-01-10 06:51:16,923 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-01-10 06:51:16,923 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-10 06:51:16,923 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-01-10 06:51:16,986 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 06:51:16,986 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 06:51:16,987 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 06:51:16,987 INFO L158 Benchmark]: Toolchain (without parser) took 7667.15ms. Allocated memory was 167.8MB in the beginning and 343.9MB in the end (delta: 176.2MB). Free memory was 122.6MB in the beginning and 160.9MB in the end (delta: -38.3MB). Peak memory consumption was 132.2MB. Max. memory is 16.1GB. [2025-01-10 06:51:16,987 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 119.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:51:16,988 INFO L158 Benchmark]: CACSL2BoogieTranslator took 152.18ms. Allocated memory is still 167.8MB. Free memory was 122.2MB in the beginning and 110.9MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 06:51:16,988 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.02ms. Allocated memory is still 167.8MB. Free memory was 110.9MB in the beginning and 109.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:51:16,988 INFO L158 Benchmark]: Boogie Preprocessor took 38.29ms. Allocated memory is still 167.8MB. Free memory was 109.2MB in the beginning and 107.7MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 06:51:16,988 INFO L158 Benchmark]: RCFGBuilder took 440.51ms. Allocated memory is still 167.8MB. Free memory was 107.7MB in the beginning and 80.1MB in the end (delta: 27.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-10 06:51:16,988 INFO L158 Benchmark]: TraceAbstraction took 6926.58ms. Allocated memory was 167.8MB in the beginning and 343.9MB in the end (delta: 176.2MB). Free memory was 79.2MB in the beginning and 165.6MB in the end (delta: -86.4MB). Peak memory consumption was 90.2MB. Max. memory is 16.1GB. [2025-01-10 06:51:16,988 INFO L158 Benchmark]: Witness Printer took 74.57ms. Allocated memory is still 343.9MB. Free memory was 165.6MB in the beginning and 160.9MB in the end (delta: 4.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:51:16,989 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.27ms. Allocated memory is still 201.3MB. Free memory is still 119.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 152.18ms. Allocated memory is still 167.8MB. Free memory was 122.2MB in the beginning and 110.9MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.02ms. Allocated memory is still 167.8MB. Free memory was 110.9MB in the beginning and 109.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.29ms. Allocated memory is still 167.8MB. Free memory was 109.2MB in the beginning and 107.7MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 440.51ms. Allocated memory is still 167.8MB. Free memory was 107.7MB in the beginning and 80.1MB in the end (delta: 27.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 6926.58ms. Allocated memory was 167.8MB in the beginning and 343.9MB in the end (delta: 176.2MB). Free memory was 79.2MB in the beginning and 165.6MB in the end (delta: -86.4MB). Peak memory consumption was 90.2MB. Max. memory is 16.1GB. * Witness Printer took 74.57ms. Allocated memory is still 343.9MB. Free memory was 165.6MB in the beginning and 160.9MB in the end (delta: 4.7MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 63]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 63]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 71]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 71]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 105 locations, 18 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.8s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1385 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1119 mSDsluCounter, 557 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 386 mSDsCounter, 154 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2435 IncrementalHoareTripleChecker+Invalid, 2589 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 154 mSolverCounterUnsat, 171 mSDtfsCounter, 2435 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 140 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1290occurred in iteration=17, InterpolantAutomatonStates: 129, 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.2s InterpolantComputationTime, 596 NumberOfCodeBlocks, 596 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 576 ConstructedInterpolants, 0 QuantifiedInterpolants, 1176 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-10 06:51:17,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE