./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/popl20-bad-counter-queue.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d 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/popl20-bad-counter-queue.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 387879bf92b16ead997b40b3e249348f8a6b399496756f9bc3c41b6dc3c21353 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 14:10:59,067 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 14:10:59,102 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-08 14:10:59,105 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 14:10:59,105 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 14:10:59,119 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 14:10:59,120 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 14:10:59,120 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 14:10:59,120 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 14:10:59,120 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 14:10:59,120 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 14:10:59,120 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 14:10:59,120 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 14:10:59,120 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 14:10:59,120 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 14:10:59,120 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 14:10:59,120 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 14:10:59,121 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 14:10:59,121 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 14:10:59,121 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 14:10:59,121 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 14:10:59,121 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 14:10:59,121 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 14:10:59,121 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 14:10:59,121 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 14:10:59,121 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 14:10:59,121 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 14:10:59,121 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 14:10:59,121 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 14:10:59,121 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 14:10:59,121 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 14:10:59,121 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 14:10:59,121 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 14:10:59,121 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 14:10:59,121 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 14:10:59,121 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 14:10:59,121 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 14:10:59,121 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 14:10:59,121 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 14:10:59,121 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 14:10:59,121 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 14:10:59,121 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 14:10:59,121 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 14:10:59,122 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 14:10:59,122 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 14:10:59,122 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 -> 387879bf92b16ead997b40b3e249348f8a6b399496756f9bc3c41b6dc3c21353 [2025-02-08 14:10:59,365 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 14:10:59,375 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 14:10:59,377 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 14:10:59,379 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 14:10:59,379 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 14:10:59,380 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-counter-queue.wvr.c [2025-02-08 14:11:00,724 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/13e410c31/78810556e3314facac4093a7336e6b48/FLAG9fe9dbbdf [2025-02-08 14:11:01,053 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 14:11:01,059 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-counter-queue.wvr.c [2025-02-08 14:11:01,074 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/13e410c31/78810556e3314facac4093a7336e6b48/FLAG9fe9dbbdf [2025-02-08 14:11:01,104 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/13e410c31/78810556e3314facac4093a7336e6b48 [2025-02-08 14:11:01,106 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 14:11:01,107 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 14:11:01,108 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 14:11:01,108 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 14:11:01,111 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 14:11:01,112 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:11:01" (1/1) ... [2025-02-08 14:11:01,113 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@789ca5c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:11:01, skipping insertion in model container [2025-02-08 14:11:01,113 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:11:01" (1/1) ... [2025-02-08 14:11:01,127 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 14:11:01,249 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:11:01,257 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 14:11:01,276 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:11:01,287 INFO L204 MainTranslator]: Completed translation [2025-02-08 14:11:01,288 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:11:01 WrapperNode [2025-02-08 14:11:01,288 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 14:11:01,288 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 14:11:01,289 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 14:11:01,289 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 14:11:01,295 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:11:01" (1/1) ... [2025-02-08 14:11:01,300 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:11:01" (1/1) ... [2025-02-08 14:11:01,318 INFO L138 Inliner]: procedures = 23, calls = 23, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 161 [2025-02-08 14:11:01,319 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 14:11:01,320 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 14:11:01,320 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 14:11:01,320 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 14:11:01,326 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:11:01" (1/1) ... [2025-02-08 14:11:01,326 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:11:01" (1/1) ... [2025-02-08 14:11:01,328 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:11:01" (1/1) ... [2025-02-08 14:11:01,344 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-02-08 14:11:01,344 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:11:01" (1/1) ... [2025-02-08 14:11:01,344 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:11:01" (1/1) ... [2025-02-08 14:11:01,351 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:11:01" (1/1) ... [2025-02-08 14:11:01,351 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:11:01" (1/1) ... [2025-02-08 14:11:01,354 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:11:01" (1/1) ... [2025-02-08 14:11:01,355 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:11:01" (1/1) ... [2025-02-08 14:11:01,356 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 14:11:01,357 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 14:11:01,360 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 14:11:01,360 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 14:11:01,361 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:11:01" (1/1) ... [2025-02-08 14:11:01,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 14:11:01,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:11:01,390 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-02-08 14:11:01,392 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-02-08 14:11:01,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 14:11:01,409 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 14:11:01,409 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 14:11:01,409 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 14:11:01,409 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 14:11:01,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 14:11:01,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 14:11:01,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 14:11:01,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 14:11:01,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 14:11:01,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 14:11:01,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 14:11:01,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 14:11:01,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 14:11:01,411 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 14:11:01,486 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 14:11:01,487 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 14:11:01,590 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-1: havoc #t~post3#1; [2025-02-08 14:11:01,591 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-2: assume 1 + #t~post3#1 <= 2147483647; [2025-02-08 14:11:01,591 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-2: assume !(1 + #t~post3#1 <= 2147483647); [2025-02-08 14:11:01,591 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-3: ~i~0#1 := 1 + #t~post3#1; [2025-02-08 14:11:01,591 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-4: assume 1 + #t~post3#1 >= -2147483648; [2025-02-08 14:11:01,591 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-4: assume !(1 + #t~post3#1 >= -2147483648); [2025-02-08 14:11:01,591 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-5: #t~post3#1 := ~i~0#1; [2025-02-08 14:11:01,591 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-6: havoc ~tmp~0#1; [2025-02-08 14:11:01,591 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L49: havoc #t~ret2#1; [2025-02-08 14:11:01,591 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L49-1: havoc #t~mem1#1; [2025-02-08 14:11:01,591 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L49-2: ~tmp~0#1 := #t~ret2#1; [2025-02-08 14:11:01,591 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L49-3: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret2#1 && #t~ret2#1 <= 2147483647; [2025-02-08 14:11:01,592 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L49-4: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 14:11:01,592 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L49-5: havoc plus_#t~short18#1, plus_#t~short19#1, plus_~a#1, plus_~b#1; [2025-02-08 14:11:01,592 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L49-6: #t~ret2#1 := plus_#res#1; [2025-02-08 14:11:01,592 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50: [2025-02-08 14:11:01,592 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50-1: ~counter~0 := ~tmp~0#1; [2025-02-08 14:11:01,638 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L57-1: havoc #t~post6#1; [2025-02-08 14:11:01,638 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L57-2: assume 1 + #t~post6#1 <= 2147483647; [2025-02-08 14:11:01,638 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L57-2: assume !(1 + #t~post6#1 <= 2147483647); [2025-02-08 14:11:01,638 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L57-3: ~i~1#1 := 1 + #t~post6#1; [2025-02-08 14:11:01,638 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L57-4: assume 1 + #t~post6#1 >= -2147483648; [2025-02-08 14:11:01,638 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L57-4: assume !(1 + #t~post6#1 >= -2147483648); [2025-02-08 14:11:01,638 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L57-5: #t~post6#1 := ~i~1#1; [2025-02-08 14:11:01,638 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L57-6: havoc ~tmp~1#1; [2025-02-08 14:11:01,639 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L58: havoc #t~ret5#1; [2025-02-08 14:11:01,639 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L58-1: havoc #t~mem4#1; [2025-02-08 14:11:01,639 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L58-2: ~tmp~1#1 := #t~ret5#1; [2025-02-08 14:11:01,639 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L58-3: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647; [2025-02-08 14:11:01,639 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L58-4: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 14:11:01,639 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L58-5: havoc minus_#t~short16#1, minus_#t~short17#1, minus_~a#1, minus_~b#1; [2025-02-08 14:11:01,639 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L58-6: #t~ret5#1 := minus_#res#1; [2025-02-08 14:11:01,640 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L59: [2025-02-08 14:11:01,640 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L59-1: ~counter~0 := ~tmp~1#1; [2025-02-08 14:11:01,695 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 14:11:01,695 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 14:11:01,796 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 14:11:01,796 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 14:11:01,797 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:11:01 BoogieIcfgContainer [2025-02-08 14:11:01,797 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 14:11:01,798 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 14:11:01,798 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 14:11:01,802 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 14:11:01,802 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 02:11:01" (1/3) ... [2025-02-08 14:11:01,802 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@562c8c47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 02:11:01, skipping insertion in model container [2025-02-08 14:11:01,802 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:11:01" (2/3) ... [2025-02-08 14:11:01,802 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@562c8c47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 02:11:01, skipping insertion in model container [2025-02-08 14:11:01,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:11:01" (3/3) ... [2025-02-08 14:11:01,803 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-counter-queue.wvr.c [2025-02-08 14:11:01,815 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 14:11:01,816 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-counter-queue.wvr.c that has 3 procedures, 54 locations, 1 initial locations, 3 loop locations, and 18 error locations. [2025-02-08 14:11:01,816 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 14:11:01,869 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 14:11:01,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 58 transitions, 130 flow [2025-02-08 14:11:01,939 INFO L124 PetriNetUnfolderBase]: 5/56 cut-off events. [2025-02-08 14:11:01,941 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 14:11:01,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 56 events. 5/56 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 188 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2025-02-08 14:11:01,946 INFO L82 GeneralOperation]: Start removeDead. Operand has 60 places, 58 transitions, 130 flow [2025-02-08 14:11:01,950 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 54 transitions, 117 flow [2025-02-08 14:11:01,958 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 14:11:01,971 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;@16e94e3e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 14:11:01,971 INFO L334 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2025-02-08 14:11:01,976 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 14:11:01,976 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-02-08 14:11:01,976 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 14:11:01,976 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:11:01,977 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 14:11:01,977 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-02-08 14:11:01,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:11:01,984 INFO L85 PathProgramCache]: Analyzing trace with hash 433277, now seen corresponding path program 1 times [2025-02-08 14:11:01,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:11:01,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673525362] [2025-02-08 14:11:01,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:11:01,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:11:02,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:11:02,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:11:02,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:11:02,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:11:02,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:11:02,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:11:02,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673525362] [2025-02-08 14:11:02,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673525362] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:11:02,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:11:02,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:11:02,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642131763] [2025-02-08 14:11:02,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:11:02,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:11:02,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:11:02,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:11:02,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:11:02,219 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 58 [2025-02-08 14:11:02,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 54 transitions, 117 flow. Second operand has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 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-02-08 14:11:02,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:11:02,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 58 [2025-02-08 14:11:02,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:11:02,396 INFO L124 PetriNetUnfolderBase]: 244/673 cut-off events. [2025-02-08 14:11:02,396 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-02-08 14:11:02,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1098 conditions, 673 events. 244/673 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4344 event pairs, 172 based on Foata normal form. 1/511 useless extension candidates. Maximal degree in co-relation 1029. Up to 397 conditions per place. [2025-02-08 14:11:02,401 INFO L140 encePairwiseOnDemand]: 52/58 looper letters, 26 selfloop transitions, 4 changer transitions 0/57 dead transitions. [2025-02-08 14:11:02,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 57 transitions, 183 flow [2025-02-08 14:11:02,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:11:02,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:11:02,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2025-02-08 14:11:02,409 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6379310344827587 [2025-02-08 14:11:02,410 INFO L175 Difference]: Start difference. First operand has 56 places, 54 transitions, 117 flow. Second operand 4 states and 148 transitions. [2025-02-08 14:11:02,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 57 transitions, 183 flow [2025-02-08 14:11:02,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 57 transitions, 178 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 14:11:02,418 INFO L231 Difference]: Finished difference. Result has 58 places, 57 transitions, 141 flow [2025-02-08 14:11:02,419 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=141, PETRI_PLACES=58, PETRI_TRANSITIONS=57} [2025-02-08 14:11:02,421 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 2 predicate places. [2025-02-08 14:11:02,421 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 57 transitions, 141 flow [2025-02-08 14:11:02,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 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-02-08 14:11:02,421 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:11:02,421 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-02-08 14:11:02,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 14:11:02,422 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-02-08 14:11:02,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:11:02,422 INFO L85 PathProgramCache]: Analyzing trace with hash 23200967, now seen corresponding path program 1 times [2025-02-08 14:11:02,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:11:02,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917802251] [2025-02-08 14:11:02,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:11:02,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:11:02,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:11:02,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:11:02,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:11:02,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:11:02,502 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:11:02,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:11:02,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917802251] [2025-02-08 14:11:02,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917802251] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:11:02,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413207700] [2025-02-08 14:11:02,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:11:02,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:11:02,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:11:02,506 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:11:02,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 14:11:02,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:11:02,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:11:02,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:11:02,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:11:02,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 14:11:02,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:11:02,581 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:11:02,581 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 14:11:02,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413207700] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:11:02,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 14:11:02,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-02-08 14:11:02,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355480966] [2025-02-08 14:11:02,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:11:02,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 14:11:02,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:11:02,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 14:11:02,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-08 14:11:02,589 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 58 [2025-02-08 14:11:02,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 57 transitions, 141 flow. Second operand has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 6 states have internal predecessors, (179), 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-02-08 14:11:02,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:11:02,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 58 [2025-02-08 14:11:02,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:11:02,724 INFO L124 PetriNetUnfolderBase]: 244/672 cut-off events. [2025-02-08 14:11:02,725 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-02-08 14:11:02,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1100 conditions, 672 events. 244/672 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4321 event pairs, 172 based on Foata normal form. 1/511 useless extension candidates. Maximal degree in co-relation 1073. Up to 392 conditions per place. [2025-02-08 14:11:02,730 INFO L140 encePairwiseOnDemand]: 53/58 looper letters, 22 selfloop transitions, 7 changer transitions 0/56 dead transitions. [2025-02-08 14:11:02,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 56 transitions, 195 flow [2025-02-08 14:11:02,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:11:02,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 14:11:02,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 204 transitions. [2025-02-08 14:11:02,732 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5862068965517241 [2025-02-08 14:11:02,732 INFO L175 Difference]: Start difference. First operand has 58 places, 57 transitions, 141 flow. Second operand 6 states and 204 transitions. [2025-02-08 14:11:02,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 56 transitions, 195 flow [2025-02-08 14:11:02,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 56 transitions, 192 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:11:02,733 INFO L231 Difference]: Finished difference. Result has 61 places, 56 transitions, 148 flow [2025-02-08 14:11:02,734 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=148, PETRI_PLACES=61, PETRI_TRANSITIONS=56} [2025-02-08 14:11:02,734 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 5 predicate places. [2025-02-08 14:11:02,734 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 56 transitions, 148 flow [2025-02-08 14:11:02,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 6 states have internal predecessors, (179), 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-02-08 14:11:02,734 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:11:02,734 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-02-08 14:11:02,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 14:11:02,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:11:02,938 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-02-08 14:11:02,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:11:02,939 INFO L85 PathProgramCache]: Analyzing trace with hash 719230325, now seen corresponding path program 1 times [2025-02-08 14:11:02,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:11:02,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631257623] [2025-02-08 14:11:02,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:11:02,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:11:02,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:11:02,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:11:02,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:11:02,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:11:03,029 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:11:03,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:11:03,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631257623] [2025-02-08 14:11:03,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631257623] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:11:03,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306873054] [2025-02-08 14:11:03,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:11:03,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:11:03,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:11:03,031 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:11:03,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 14:11:03,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:11:03,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:11:03,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:11:03,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:11:03,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 14:11:03,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:11:03,136 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:11:03,136 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:11:03,168 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:11:03,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [306873054] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:11:03,169 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:11:03,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-02-08 14:11:03,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793940124] [2025-02-08 14:11:03,169 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:11:03,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 14:11:03,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:11:03,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 14:11:03,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-08 14:11:03,181 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 58 [2025-02-08 14:11:03,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 56 transitions, 148 flow. Second operand has 12 states, 12 states have (on average 30.083333333333332) internal successors, (361), 12 states have internal predecessors, (361), 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-02-08 14:11:03,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:11:03,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 58 [2025-02-08 14:11:03,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:11:03,314 INFO L124 PetriNetUnfolderBase]: 247/684 cut-off events. [2025-02-08 14:11:03,314 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2025-02-08 14:11:03,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1144 conditions, 684 events. 247/684 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4407 event pairs, 172 based on Foata normal form. 3/523 useless extension candidates. Maximal degree in co-relation 1074. Up to 399 conditions per place. [2025-02-08 14:11:03,317 INFO L140 encePairwiseOnDemand]: 53/58 looper letters, 25 selfloop transitions, 13 changer transitions 0/65 dead transitions. [2025-02-08 14:11:03,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 65 transitions, 278 flow [2025-02-08 14:11:03,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 14:11:03,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 14:11:03,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 331 transitions. [2025-02-08 14:11:03,319 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5706896551724138 [2025-02-08 14:11:03,320 INFO L175 Difference]: Start difference. First operand has 61 places, 56 transitions, 148 flow. Second operand 10 states and 331 transitions. [2025-02-08 14:11:03,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 65 transitions, 278 flow [2025-02-08 14:11:03,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 65 transitions, 232 flow, removed 8 selfloop flow, removed 5 redundant places. [2025-02-08 14:11:03,321 INFO L231 Difference]: Finished difference. Result has 68 places, 65 transitions, 200 flow [2025-02-08 14:11:03,321 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=200, PETRI_PLACES=68, PETRI_TRANSITIONS=65} [2025-02-08 14:11:03,322 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 12 predicate places. [2025-02-08 14:11:03,322 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 65 transitions, 200 flow [2025-02-08 14:11:03,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 30.083333333333332) internal successors, (361), 12 states have internal predecessors, (361), 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-02-08 14:11:03,322 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:11:03,325 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:11:03,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 14:11:03,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:11:03,529 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-02-08 14:11:03,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:11:03,530 INFO L85 PathProgramCache]: Analyzing trace with hash 791753422, now seen corresponding path program 1 times [2025-02-08 14:11:03,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:11:03,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92760467] [2025-02-08 14:11:03,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:11:03,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:11:03,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:11:03,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:11:03,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:11:03,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:11:03,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:11:03,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:11:03,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92760467] [2025-02-08 14:11:03,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92760467] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:11:03,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:11:03,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:11:03,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949059342] [2025-02-08 14:11:03,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:11:03,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:11:03,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:11:03,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:11:03,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:11:03,592 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 58 [2025-02-08 14:11:03,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 65 transitions, 200 flow. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:11:03,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:11:03,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 58 [2025-02-08 14:11:03,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:11:03,710 INFO L124 PetriNetUnfolderBase]: 505/1174 cut-off events. [2025-02-08 14:11:03,710 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-02-08 14:11:03,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2077 conditions, 1174 events. 505/1174 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 7913 event pairs, 179 based on Foata normal form. 40/969 useless extension candidates. Maximal degree in co-relation 2043. Up to 373 conditions per place. [2025-02-08 14:11:03,714 INFO L140 encePairwiseOnDemand]: 51/58 looper letters, 64 selfloop transitions, 4 changer transitions 0/90 dead transitions. [2025-02-08 14:11:03,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 90 transitions, 390 flow [2025-02-08 14:11:03,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:11:03,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:11:03,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2025-02-08 14:11:03,716 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6853448275862069 [2025-02-08 14:11:03,716 INFO L175 Difference]: Start difference. First operand has 68 places, 65 transitions, 200 flow. Second operand 4 states and 159 transitions. [2025-02-08 14:11:03,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 90 transitions, 390 flow [2025-02-08 14:11:03,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 90 transitions, 379 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-02-08 14:11:03,718 INFO L231 Difference]: Finished difference. Result has 71 places, 66 transitions, 215 flow [2025-02-08 14:11:03,718 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=215, PETRI_PLACES=71, PETRI_TRANSITIONS=66} [2025-02-08 14:11:03,718 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 15 predicate places. [2025-02-08 14:11:03,718 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 66 transitions, 215 flow [2025-02-08 14:11:03,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:11:03,719 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:11:03,719 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:11:03,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 14:11:03,719 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-02-08 14:11:03,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:11:03,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1225447289, now seen corresponding path program 1 times [2025-02-08 14:11:03,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:11:03,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962013153] [2025-02-08 14:11:03,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:11:03,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:11:03,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:11:03,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:11:03,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:11:03,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:11:03,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:11:03,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:11:03,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962013153] [2025-02-08 14:11:03,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962013153] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:11:03,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:11:03,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 14:11:03,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156483925] [2025-02-08 14:11:03,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:11:03,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 14:11:03,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:11:03,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 14:11:03,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 14:11:03,790 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 58 [2025-02-08 14:11:03,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 66 transitions, 215 flow. Second operand has 5 states, 5 states have (on average 32.0) internal successors, (160), 5 states have internal predecessors, (160), 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-02-08 14:11:03,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:11:03,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 58 [2025-02-08 14:11:03,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:11:03,912 INFO L124 PetriNetUnfolderBase]: 399/1128 cut-off events. [2025-02-08 14:11:03,913 INFO L125 PetriNetUnfolderBase]: For 192/211 co-relation queries the response was YES. [2025-02-08 14:11:03,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2002 conditions, 1128 events. 399/1128 cut-off events. For 192/211 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 8093 event pairs, 281 based on Foata normal form. 29/946 useless extension candidates. Maximal degree in co-relation 1966. Up to 543 conditions per place. [2025-02-08 14:11:03,916 INFO L140 encePairwiseOnDemand]: 52/58 looper letters, 55 selfloop transitions, 5 changer transitions 4/92 dead transitions. [2025-02-08 14:11:03,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 92 transitions, 401 flow [2025-02-08 14:11:03,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 14:11:03,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 14:11:03,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 210 transitions. [2025-02-08 14:11:03,917 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7241379310344828 [2025-02-08 14:11:03,917 INFO L175 Difference]: Start difference. First operand has 71 places, 66 transitions, 215 flow. Second operand 5 states and 210 transitions. [2025-02-08 14:11:03,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 92 transitions, 401 flow [2025-02-08 14:11:03,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 92 transitions, 401 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 14:11:03,920 INFO L231 Difference]: Finished difference. Result has 77 places, 68 transitions, 240 flow [2025-02-08 14:11:03,920 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=240, PETRI_PLACES=77, PETRI_TRANSITIONS=68} [2025-02-08 14:11:03,920 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 21 predicate places. [2025-02-08 14:11:03,920 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 68 transitions, 240 flow [2025-02-08 14:11:03,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.0) internal successors, (160), 5 states have internal predecessors, (160), 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-02-08 14:11:03,921 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:11:03,921 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:11:03,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 14:11:03,921 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-02-08 14:11:03,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:11:03,921 INFO L85 PathProgramCache]: Analyzing trace with hash -897158606, now seen corresponding path program 1 times [2025-02-08 14:11:03,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:11:03,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85380574] [2025-02-08 14:11:03,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:11:03,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:11:03,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 14:11:03,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 14:11:03,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:11:03,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:11:03,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:11:03,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:11:03,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85380574] [2025-02-08 14:11:03,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85380574] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:11:03,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:11:03,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:11:03,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697555725] [2025-02-08 14:11:03,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:11:03,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:11:03,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:11:03,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:11:03,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:11:03,972 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 58 [2025-02-08 14:11:03,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 68 transitions, 240 flow. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 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-02-08 14:11:03,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:11:03,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 58 [2025-02-08 14:11:03,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:11:04,129 INFO L124 PetriNetUnfolderBase]: 806/1944 cut-off events. [2025-02-08 14:11:04,129 INFO L125 PetriNetUnfolderBase]: For 672/704 co-relation queries the response was YES. [2025-02-08 14:11:04,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3914 conditions, 1944 events. 806/1944 cut-off events. For 672/704 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 14346 event pairs, 303 based on Foata normal form. 82/1728 useless extension candidates. Maximal degree in co-relation 3875. Up to 630 conditions per place. [2025-02-08 14:11:04,136 INFO L140 encePairwiseOnDemand]: 51/58 looper letters, 71 selfloop transitions, 4 changer transitions 0/97 dead transitions. [2025-02-08 14:11:04,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 97 transitions, 502 flow [2025-02-08 14:11:04,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:11:04,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:11:04,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 157 transitions. [2025-02-08 14:11:04,137 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6767241379310345 [2025-02-08 14:11:04,137 INFO L175 Difference]: Start difference. First operand has 77 places, 68 transitions, 240 flow. Second operand 4 states and 157 transitions. [2025-02-08 14:11:04,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 97 transitions, 502 flow [2025-02-08 14:11:04,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 97 transitions, 497 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 14:11:04,140 INFO L231 Difference]: Finished difference. Result has 80 places, 69 transitions, 261 flow [2025-02-08 14:11:04,140 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=261, PETRI_PLACES=80, PETRI_TRANSITIONS=69} [2025-02-08 14:11:04,140 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 24 predicate places. [2025-02-08 14:11:04,140 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 69 transitions, 261 flow [2025-02-08 14:11:04,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 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-02-08 14:11:04,141 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:11:04,141 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:11:04,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 14:11:04,141 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-02-08 14:11:04,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:11:04,141 INFO L85 PathProgramCache]: Analyzing trace with hash -2042112584, now seen corresponding path program 1 times [2025-02-08 14:11:04,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:11:04,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359697465] [2025-02-08 14:11:04,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:11:04,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:11:04,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 14:11:04,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 14:11:04,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:11:04,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:11:04,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:11:04,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:11:04,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359697465] [2025-02-08 14:11:04,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359697465] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:11:04,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:11:04,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 14:11:04,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352429989] [2025-02-08 14:11:04,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:11:04,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 14:11:04,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:11:04,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 14:11:04,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 14:11:04,255 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 58 [2025-02-08 14:11:04,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 69 transitions, 261 flow. Second operand has 5 states, 5 states have (on average 32.4) internal successors, (162), 5 states have internal predecessors, (162), 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-02-08 14:11:04,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:11:04,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 58 [2025-02-08 14:11:04,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:11:04,484 INFO L124 PetriNetUnfolderBase]: 482/1362 cut-off events. [2025-02-08 14:11:04,484 INFO L125 PetriNetUnfolderBase]: For 550/596 co-relation queries the response was YES. [2025-02-08 14:11:04,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2785 conditions, 1362 events. 482/1362 cut-off events. For 550/596 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 10229 event pairs, 400 based on Foata normal form. 33/1238 useless extension candidates. Maximal degree in co-relation 2744. Up to 752 conditions per place. [2025-02-08 14:11:04,490 INFO L140 encePairwiseOnDemand]: 52/58 looper letters, 36 selfloop transitions, 2 changer transitions 14/80 dead transitions. [2025-02-08 14:11:04,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 80 transitions, 400 flow [2025-02-08 14:11:04,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 14:11:04,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 14:11:04,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 197 transitions. [2025-02-08 14:11:04,491 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6793103448275862 [2025-02-08 14:11:04,491 INFO L175 Difference]: Start difference. First operand has 80 places, 69 transitions, 261 flow. Second operand 5 states and 197 transitions. [2025-02-08 14:11:04,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 80 transitions, 400 flow [2025-02-08 14:11:04,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 80 transitions, 400 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 14:11:04,494 INFO L231 Difference]: Finished difference. Result has 86 places, 66 transitions, 254 flow [2025-02-08 14:11:04,494 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=254, PETRI_PLACES=86, PETRI_TRANSITIONS=66} [2025-02-08 14:11:04,495 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 30 predicate places. [2025-02-08 14:11:04,495 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 66 transitions, 254 flow [2025-02-08 14:11:04,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.4) internal successors, (162), 5 states have internal predecessors, (162), 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-02-08 14:11:04,495 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:11:04,495 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:11:04,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 14:11:04,496 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-02-08 14:11:04,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:11:04,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1287741053, now seen corresponding path program 1 times [2025-02-08 14:11:04,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:11:04,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165830086] [2025-02-08 14:11:04,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:11:04,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:11:04,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:11:04,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:11:04,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:11:04,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:11:04,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:11:04,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:11:04,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165830086] [2025-02-08 14:11:04,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165830086] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:11:04,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287290199] [2025-02-08 14:11:04,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:11:04,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:11:04,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:11:04,674 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:11:04,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 14:11:04,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:11:04,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:11:04,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:11:04,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:11:04,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-08 14:11:04,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:11:04,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 14:11:04,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-02-08 14:11:04,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:11:04,779 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:11:04,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2025-02-08 14:11:04,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2025-02-08 14:11:04,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:11:04,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1287290199] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:11:04,834 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:11:04,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-02-08 14:11:04,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664048263] [2025-02-08 14:11:04,835 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:11:04,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 14:11:04,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:11:04,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 14:11:04,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-02-08 14:11:04,894 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 58 [2025-02-08 14:11:04,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 66 transitions, 254 flow. Second operand has 12 states, 12 states have (on average 29.416666666666668) internal successors, (353), 12 states have internal predecessors, (353), 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-02-08 14:11:04,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:11:04,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 58 [2025-02-08 14:11:04,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:11:05,109 INFO L124 PetriNetUnfolderBase]: 501/1323 cut-off events. [2025-02-08 14:11:05,110 INFO L125 PetriNetUnfolderBase]: For 590/635 co-relation queries the response was YES. [2025-02-08 14:11:05,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2827 conditions, 1323 events. 501/1323 cut-off events. For 590/635 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 9621 event pairs, 139 based on Foata normal form. 29/1225 useless extension candidates. Maximal degree in co-relation 2797. Up to 625 conditions per place. [2025-02-08 14:11:05,117 INFO L140 encePairwiseOnDemand]: 50/58 looper letters, 53 selfloop transitions, 10 changer transitions 0/89 dead transitions. [2025-02-08 14:11:05,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 89 transitions, 466 flow [2025-02-08 14:11:05,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 14:11:05,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 14:11:05,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 275 transitions. [2025-02-08 14:11:05,119 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5926724137931034 [2025-02-08 14:11:05,119 INFO L175 Difference]: Start difference. First operand has 86 places, 66 transitions, 254 flow. Second operand 8 states and 275 transitions. [2025-02-08 14:11:05,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 89 transitions, 466 flow [2025-02-08 14:11:05,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 89 transitions, 438 flow, removed 12 selfloop flow, removed 6 redundant places. [2025-02-08 14:11:05,124 INFO L231 Difference]: Finished difference. Result has 82 places, 65 transitions, 256 flow [2025-02-08 14:11:05,124 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=256, PETRI_PLACES=82, PETRI_TRANSITIONS=65} [2025-02-08 14:11:05,126 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 26 predicate places. [2025-02-08 14:11:05,126 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 65 transitions, 256 flow [2025-02-08 14:11:05,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 29.416666666666668) internal successors, (353), 12 states have internal predecessors, (353), 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-02-08 14:11:05,126 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:11:05,126 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:11:05,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 14:11:05,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:11:05,327 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-02-08 14:11:05,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:11:05,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1265236636, now seen corresponding path program 1 times [2025-02-08 14:11:05,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:11:05,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110577573] [2025-02-08 14:11:05,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:11:05,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:11:05,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 14:11:05,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 14:11:05,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:11:05,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:11:05,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:11:05,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:11:05,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110577573] [2025-02-08 14:11:05,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110577573] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:11:05,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060533077] [2025-02-08 14:11:05,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:11:05,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:11:05,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:11:05,547 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:11:05,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 14:11:05,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 14:11:05,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 14:11:05,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:11:05,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:11:05,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-08 14:11:05,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:11:05,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 14:11:05,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-08 14:11:05,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:11:05,667 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:11:05,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2025-02-08 14:11:05,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2025-02-08 14:11:05,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:11:05,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1060533077] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:11:05,737 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:11:05,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-02-08 14:11:05,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508402870] [2025-02-08 14:11:05,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:11:05,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 14:11:05,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:11:05,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 14:11:05,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-02-08 14:11:05,779 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 58 [2025-02-08 14:11:05,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 65 transitions, 256 flow. Second operand has 13 states, 13 states have (on average 27.53846153846154) internal successors, (358), 13 states have internal predecessors, (358), 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-02-08 14:11:05,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:11:05,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 58 [2025-02-08 14:11:05,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:11:06,012 INFO L124 PetriNetUnfolderBase]: 574/1380 cut-off events. [2025-02-08 14:11:06,012 INFO L125 PetriNetUnfolderBase]: For 449/492 co-relation queries the response was YES. [2025-02-08 14:11:06,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2971 conditions, 1380 events. 574/1380 cut-off events. For 449/492 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 9738 event pairs, 53 based on Foata normal form. 49/1303 useless extension candidates. Maximal degree in co-relation 2935. Up to 756 conditions per place. [2025-02-08 14:11:06,019 INFO L140 encePairwiseOnDemand]: 50/58 looper letters, 55 selfloop transitions, 10 changer transitions 0/88 dead transitions. [2025-02-08 14:11:06,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 88 transitions, 458 flow [2025-02-08 14:11:06,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 14:11:06,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 14:11:06,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 260 transitions. [2025-02-08 14:11:06,021 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5603448275862069 [2025-02-08 14:11:06,021 INFO L175 Difference]: Start difference. First operand has 82 places, 65 transitions, 256 flow. Second operand 8 states and 260 transitions. [2025-02-08 14:11:06,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 88 transitions, 458 flow [2025-02-08 14:11:06,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 88 transitions, 439 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 14:11:06,025 INFO L231 Difference]: Finished difference. Result has 82 places, 64 transitions, 253 flow [2025-02-08 14:11:06,025 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=253, PETRI_PLACES=82, PETRI_TRANSITIONS=64} [2025-02-08 14:11:06,027 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 26 predicate places. [2025-02-08 14:11:06,027 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 64 transitions, 253 flow [2025-02-08 14:11:06,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 27.53846153846154) internal successors, (358), 13 states have internal predecessors, (358), 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-02-08 14:11:06,028 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:11:06,028 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:11:06,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 14:11:06,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-02-08 14:11:06,229 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-02-08 14:11:06,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:11:06,229 INFO L85 PathProgramCache]: Analyzing trace with hash -639736274, now seen corresponding path program 1 times [2025-02-08 14:11:06,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:11:06,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663123596] [2025-02-08 14:11:06,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:11:06,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:11:06,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 14:11:06,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:11:06,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:11:06,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:11:06,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:11:06,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:11:06,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663123596] [2025-02-08 14:11:06,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663123596] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:11:06,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852873856] [2025-02-08 14:11:06,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:11:06,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:11:06,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:11:06,423 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:11:06,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 14:11:06,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 14:11:06,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:11:06,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:11:06,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:11:06,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-08 14:11:06,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:11:06,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 14:11:06,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-08 14:11:06,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:11:06,537 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:11:06,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2025-02-08 14:11:06,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2025-02-08 14:11:06,597 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:11:06,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852873856] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:11:06,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:11:06,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-02-08 14:11:06,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194221255] [2025-02-08 14:11:06,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:11:06,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 14:11:06,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:11:06,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 14:11:06,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-02-08 14:11:06,646 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 58 [2025-02-08 14:11:06,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 64 transitions, 253 flow. Second operand has 12 states, 12 states have (on average 29.75) internal successors, (357), 12 states have internal predecessors, (357), 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-02-08 14:11:06,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:11:06,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 58 [2025-02-08 14:11:06,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:11:06,824 INFO L124 PetriNetUnfolderBase]: 498/1290 cut-off events. [2025-02-08 14:11:06,824 INFO L125 PetriNetUnfolderBase]: For 537/559 co-relation queries the response was YES. [2025-02-08 14:11:06,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2738 conditions, 1290 events. 498/1290 cut-off events. For 537/559 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 9327 event pairs, 72 based on Foata normal form. 22/1189 useless extension candidates. Maximal degree in co-relation 2702. Up to 586 conditions per place. [2025-02-08 14:11:06,831 INFO L140 encePairwiseOnDemand]: 50/58 looper letters, 51 selfloop transitions, 10 changer transitions 0/85 dead transitions. [2025-02-08 14:11:06,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 85 transitions, 457 flow [2025-02-08 14:11:06,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 14:11:06,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 14:11:06,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 273 transitions. [2025-02-08 14:11:06,832 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5883620689655172 [2025-02-08 14:11:06,832 INFO L175 Difference]: Start difference. First operand has 82 places, 64 transitions, 253 flow. Second operand 8 states and 273 transitions. [2025-02-08 14:11:06,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 85 transitions, 457 flow [2025-02-08 14:11:06,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 85 transitions, 428 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 14:11:06,835 INFO L231 Difference]: Finished difference. Result has 82 places, 63 transitions, 252 flow [2025-02-08 14:11:06,836 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=252, PETRI_PLACES=82, PETRI_TRANSITIONS=63} [2025-02-08 14:11:06,836 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 26 predicate places. [2025-02-08 14:11:06,836 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 63 transitions, 252 flow [2025-02-08 14:11:06,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 29.75) internal successors, (357), 12 states have internal predecessors, (357), 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-02-08 14:11:06,836 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:11:06,836 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:11:06,845 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-08 14:11:07,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-08 14:11:07,038 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-02-08 14:11:07,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:11:07,038 INFO L85 PathProgramCache]: Analyzing trace with hash 567629471, now seen corresponding path program 1 times [2025-02-08 14:11:07,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:11:07,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480320545] [2025-02-08 14:11:07,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:11:07,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:11:07,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 14:11:07,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:11:07,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:11:07,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:11:07,119 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 14:11:07,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:11:07,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480320545] [2025-02-08 14:11:07,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480320545] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:11:07,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:11:07,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:11:07,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688792738] [2025-02-08 14:11:07,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:11:07,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 14:11:07,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:11:07,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 14:11:07,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 14:11:07,146 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 58 [2025-02-08 14:11:07,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 63 transitions, 252 flow. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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-02-08 14:11:07,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:11:07,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 58 [2025-02-08 14:11:07,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:11:07,294 INFO L124 PetriNetUnfolderBase]: 623/1483 cut-off events. [2025-02-08 14:11:07,295 INFO L125 PetriNetUnfolderBase]: For 611/650 co-relation queries the response was YES. [2025-02-08 14:11:07,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3280 conditions, 1483 events. 623/1483 cut-off events. For 611/650 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 10465 event pairs, 271 based on Foata normal form. 49/1376 useless extension candidates. Maximal degree in co-relation 3244. Up to 507 conditions per place. [2025-02-08 14:11:07,301 INFO L140 encePairwiseOnDemand]: 52/58 looper letters, 64 selfloop transitions, 5 changer transitions 0/90 dead transitions. [2025-02-08 14:11:07,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 90 transitions, 484 flow [2025-02-08 14:11:07,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 14:11:07,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 14:11:07,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 191 transitions. [2025-02-08 14:11:07,303 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6586206896551724 [2025-02-08 14:11:07,303 INFO L175 Difference]: Start difference. First operand has 82 places, 63 transitions, 252 flow. Second operand 5 states and 191 transitions. [2025-02-08 14:11:07,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 90 transitions, 484 flow [2025-02-08 14:11:07,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 90 transitions, 455 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 14:11:07,305 INFO L231 Difference]: Finished difference. Result has 82 places, 64 transitions, 255 flow [2025-02-08 14:11:07,306 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=255, PETRI_PLACES=82, PETRI_TRANSITIONS=64} [2025-02-08 14:11:07,306 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 26 predicate places. [2025-02-08 14:11:07,306 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 64 transitions, 255 flow [2025-02-08 14:11:07,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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-02-08 14:11:07,306 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:11:07,306 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:11:07,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 14:11:07,306 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-02-08 14:11:07,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:11:07,307 INFO L85 PathProgramCache]: Analyzing trace with hash 567630464, now seen corresponding path program 1 times [2025-02-08 14:11:07,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:11:07,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829944736] [2025-02-08 14:11:07,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:11:07,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:11:07,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 14:11:07,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:11:07,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:11:07,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:11:07,355 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 14:11:07,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:11:07,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829944736] [2025-02-08 14:11:07,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829944736] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:11:07,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:11:07,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:11:07,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308401204] [2025-02-08 14:11:07,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:11:07,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:11:07,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:11:07,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:11:07,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:11:07,374 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 58 [2025-02-08 14:11:07,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 64 transitions, 255 flow. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:11:07,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:11:07,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 58 [2025-02-08 14:11:07,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:11:07,499 INFO L124 PetriNetUnfolderBase]: 544/1392 cut-off events. [2025-02-08 14:11:07,499 INFO L125 PetriNetUnfolderBase]: For 678/709 co-relation queries the response was YES. [2025-02-08 14:11:07,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3096 conditions, 1392 events. 544/1392 cut-off events. For 678/709 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 10077 event pairs, 263 based on Foata normal form. 45/1324 useless extension candidates. Maximal degree in co-relation 3060. Up to 508 conditions per place. [2025-02-08 14:11:07,506 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 64 selfloop transitions, 3 changer transitions 0/89 dead transitions. [2025-02-08 14:11:07,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 89 transitions, 465 flow [2025-02-08 14:11:07,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:11:07,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:11:07,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 154 transitions. [2025-02-08 14:11:07,507 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6637931034482759 [2025-02-08 14:11:07,507 INFO L175 Difference]: Start difference. First operand has 82 places, 64 transitions, 255 flow. Second operand 4 states and 154 transitions. [2025-02-08 14:11:07,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 89 transitions, 465 flow [2025-02-08 14:11:07,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 89 transitions, 459 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 14:11:07,510 INFO L231 Difference]: Finished difference. Result has 82 places, 63 transitions, 249 flow [2025-02-08 14:11:07,511 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=249, PETRI_PLACES=82, PETRI_TRANSITIONS=63} [2025-02-08 14:11:07,511 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 26 predicate places. [2025-02-08 14:11:07,512 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 63 transitions, 249 flow [2025-02-08 14:11:07,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:11:07,512 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:11:07,512 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:11:07,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 14:11:07,513 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-02-08 14:11:07,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:11:07,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1642981664, now seen corresponding path program 1 times [2025-02-08 14:11:07,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:11:07,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077220529] [2025-02-08 14:11:07,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:11:07,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:11:07,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 14:11:07,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 14:11:07,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:11:07,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:11:07,664 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:11:07,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:11:07,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077220529] [2025-02-08 14:11:07,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077220529] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:11:07,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249308810] [2025-02-08 14:11:07,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:11:07,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:11:07,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:11:07,666 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:11:07,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 14:11:07,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 14:11:07,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 14:11:07,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:11:07,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:11:07,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-08 14:11:07,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:11:07,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 14:11:07,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-02-08 14:11:07,769 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:11:07,769 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:11:07,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2025-02-08 14:11:07,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2025-02-08 14:11:07,831 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:11:07,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249308810] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:11:07,831 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:11:07,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-02-08 14:11:07,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528876447] [2025-02-08 14:11:07,832 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:11:07,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 14:11:07,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:11:07,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 14:11:07,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-02-08 14:11:07,880 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 58 [2025-02-08 14:11:07,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 63 transitions, 249 flow. Second operand has 13 states, 13 states have (on average 27.846153846153847) internal successors, (362), 13 states have internal predecessors, (362), 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-02-08 14:11:07,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:11:07,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 58 [2025-02-08 14:11:07,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:11:08,083 INFO L124 PetriNetUnfolderBase]: 570/1337 cut-off events. [2025-02-08 14:11:08,083 INFO L125 PetriNetUnfolderBase]: For 608/634 co-relation queries the response was YES. [2025-02-08 14:11:08,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3023 conditions, 1337 events. 570/1337 cut-off events. For 608/634 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 9217 event pairs, 74 based on Foata normal form. 51/1273 useless extension candidates. Maximal degree in co-relation 2988. Up to 735 conditions per place. [2025-02-08 14:11:08,088 INFO L140 encePairwiseOnDemand]: 50/58 looper letters, 53 selfloop transitions, 10 changer transitions 0/84 dead transitions. [2025-02-08 14:11:08,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 84 transitions, 457 flow [2025-02-08 14:11:08,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 14:11:08,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 14:11:08,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 258 transitions. [2025-02-08 14:11:08,089 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5560344827586207 [2025-02-08 14:11:08,090 INFO L175 Difference]: Start difference. First operand has 82 places, 63 transitions, 249 flow. Second operand 8 states and 258 transitions. [2025-02-08 14:11:08,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 84 transitions, 457 flow [2025-02-08 14:11:08,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 84 transitions, 444 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 14:11:08,092 INFO L231 Difference]: Finished difference. Result has 86 places, 62 transitions, 260 flow [2025-02-08 14:11:08,092 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=260, PETRI_PLACES=86, PETRI_TRANSITIONS=62} [2025-02-08 14:11:08,093 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 30 predicate places. [2025-02-08 14:11:08,093 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 62 transitions, 260 flow [2025-02-08 14:11:08,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 27.846153846153847) internal successors, (362), 13 states have internal predecessors, (362), 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-02-08 14:11:08,093 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:11:08,093 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:11:08,100 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-08 14:11:08,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-08 14:11:08,294 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-02-08 14:11:08,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:11:08,294 INFO L85 PathProgramCache]: Analyzing trace with hash 416644831, now seen corresponding path program 1 times [2025-02-08 14:11:08,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:11:08,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895949302] [2025-02-08 14:11:08,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:11:08,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:11:08,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 14:11:08,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 14:11:08,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:11:08,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:11:08,344 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 14:11:08,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:11:08,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895949302] [2025-02-08 14:11:08,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895949302] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:11:08,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:11:08,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 14:11:08,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656993038] [2025-02-08 14:11:08,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:11:08,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 14:11:08,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:11:08,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 14:11:08,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 14:11:08,378 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 58 [2025-02-08 14:11:08,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 62 transitions, 260 flow. Second operand has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 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-02-08 14:11:08,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:11:08,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 58 [2025-02-08 14:11:08,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:11:08,547 INFO L124 PetriNetUnfolderBase]: 785/1657 cut-off events. [2025-02-08 14:11:08,547 INFO L125 PetriNetUnfolderBase]: For 911/948 co-relation queries the response was YES. [2025-02-08 14:11:08,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3951 conditions, 1657 events. 785/1657 cut-off events. For 911/948 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 11236 event pairs, 96 based on Foata normal form. 89/1664 useless extension candidates. Maximal degree in co-relation 3913. Up to 512 conditions per place. [2025-02-08 14:11:08,554 INFO L140 encePairwiseOnDemand]: 51/58 looper letters, 74 selfloop transitions, 7 changer transitions 0/99 dead transitions. [2025-02-08 14:11:08,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 99 transitions, 555 flow [2025-02-08 14:11:08,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:11:08,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 14:11:08,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 204 transitions. [2025-02-08 14:11:08,555 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5862068965517241 [2025-02-08 14:11:08,556 INFO L175 Difference]: Start difference. First operand has 86 places, 62 transitions, 260 flow. Second operand 6 states and 204 transitions. [2025-02-08 14:11:08,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 99 transitions, 555 flow [2025-02-08 14:11:08,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 99 transitions, 518 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-02-08 14:11:08,558 INFO L231 Difference]: Finished difference. Result has 85 places, 61 transitions, 250 flow [2025-02-08 14:11:08,558 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=250, PETRI_PLACES=85, PETRI_TRANSITIONS=61} [2025-02-08 14:11:08,559 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 29 predicate places. [2025-02-08 14:11:08,559 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 61 transitions, 250 flow [2025-02-08 14:11:08,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 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-02-08 14:11:08,559 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:11:08,559 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:11:08,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 14:11:08,559 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-02-08 14:11:08,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:11:08,560 INFO L85 PathProgramCache]: Analyzing trace with hash -607176528, now seen corresponding path program 1 times [2025-02-08 14:11:08,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:11:08,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845105982] [2025-02-08 14:11:08,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:11:08,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:11:08,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 14:11:08,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 14:11:08,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:11:08,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:11:08,604 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 14:11:08,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:11:08,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845105982] [2025-02-08 14:11:08,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845105982] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:11:08,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:11:08,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:11:08,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740030074] [2025-02-08 14:11:08,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:11:08,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 14:11:08,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:11:08,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 14:11:08,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 14:11:08,632 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 58 [2025-02-08 14:11:08,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 61 transitions, 250 flow. Second operand has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 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-02-08 14:11:08,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:11:08,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 58 [2025-02-08 14:11:08,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:11:08,767 INFO L124 PetriNetUnfolderBase]: 687/1616 cut-off events. [2025-02-08 14:11:08,767 INFO L125 PetriNetUnfolderBase]: For 818/847 co-relation queries the response was YES. [2025-02-08 14:11:08,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3739 conditions, 1616 events. 687/1616 cut-off events. For 818/847 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 11646 event pairs, 326 based on Foata normal form. 58/1543 useless extension candidates. Maximal degree in co-relation 3703. Up to 601 conditions per place. [2025-02-08 14:11:08,773 INFO L140 encePairwiseOnDemand]: 52/58 looper letters, 62 selfloop transitions, 5 changer transitions 0/86 dead transitions. [2025-02-08 14:11:08,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 86 transitions, 480 flow [2025-02-08 14:11:08,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 14:11:08,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 14:11:08,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 189 transitions. [2025-02-08 14:11:08,775 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6517241379310345 [2025-02-08 14:11:08,775 INFO L175 Difference]: Start difference. First operand has 85 places, 61 transitions, 250 flow. Second operand 5 states and 189 transitions. [2025-02-08 14:11:08,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 86 transitions, 480 flow [2025-02-08 14:11:08,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 86 transitions, 452 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 14:11:08,778 INFO L231 Difference]: Finished difference. Result has 87 places, 62 transitions, 260 flow [2025-02-08 14:11:08,778 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=260, PETRI_PLACES=87, PETRI_TRANSITIONS=62} [2025-02-08 14:11:08,778 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 31 predicate places. [2025-02-08 14:11:08,779 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 62 transitions, 260 flow [2025-02-08 14:11:08,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 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-02-08 14:11:08,779 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:11:08,779 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:11:08,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 14:11:08,779 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-02-08 14:11:08,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:11:08,780 INFO L85 PathProgramCache]: Analyzing trace with hash -607175535, now seen corresponding path program 1 times [2025-02-08 14:11:08,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:11:08,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394603891] [2025-02-08 14:11:08,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:11:08,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:11:08,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 14:11:08,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 14:11:08,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:11:08,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:11:08,816 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 14:11:08,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:11:08,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394603891] [2025-02-08 14:11:08,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394603891] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:11:08,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:11:08,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:11:08,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88015914] [2025-02-08 14:11:08,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:11:08,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:11:08,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:11:08,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:11:08,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:11:08,842 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 58 [2025-02-08 14:11:08,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 62 transitions, 260 flow. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 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-02-08 14:11:08,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:11:08,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 58 [2025-02-08 14:11:08,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:11:09,020 INFO L124 PetriNetUnfolderBase]: 605/1505 cut-off events. [2025-02-08 14:11:09,020 INFO L125 PetriNetUnfolderBase]: For 681/706 co-relation queries the response was YES. [2025-02-08 14:11:09,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3496 conditions, 1505 events. 605/1505 cut-off events. For 681/706 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 11026 event pairs, 326 based on Foata normal form. 54/1486 useless extension candidates. Maximal degree in co-relation 3458. Up to 602 conditions per place. [2025-02-08 14:11:09,026 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 62 selfloop transitions, 3 changer transitions 0/85 dead transitions. [2025-02-08 14:11:09,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 85 transitions, 462 flow [2025-02-08 14:11:09,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:11:09,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:11:09,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 152 transitions. [2025-02-08 14:11:09,027 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6551724137931034 [2025-02-08 14:11:09,027 INFO L175 Difference]: Start difference. First operand has 87 places, 62 transitions, 260 flow. Second operand 4 states and 152 transitions. [2025-02-08 14:11:09,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 85 transitions, 462 flow [2025-02-08 14:11:09,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 85 transitions, 456 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 14:11:09,031 INFO L231 Difference]: Finished difference. Result has 87 places, 61 transitions, 254 flow [2025-02-08 14:11:09,031 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=254, PETRI_PLACES=87, PETRI_TRANSITIONS=61} [2025-02-08 14:11:09,031 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 31 predicate places. [2025-02-08 14:11:09,031 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 61 transitions, 254 flow [2025-02-08 14:11:09,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 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-02-08 14:11:09,031 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:11:09,032 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:11:09,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 14:11:09,032 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-02-08 14:11:09,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:11:09,032 INFO L85 PathProgramCache]: Analyzing trace with hash 949777222, now seen corresponding path program 1 times [2025-02-08 14:11:09,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:11:09,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604030867] [2025-02-08 14:11:09,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:11:09,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:11:09,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 14:11:09,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 14:11:09,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:11:09,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:11:09,075 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 14:11:09,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:11:09,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604030867] [2025-02-08 14:11:09,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604030867] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:11:09,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:11:09,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 14:11:09,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774805990] [2025-02-08 14:11:09,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:11:09,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 14:11:09,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:11:09,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 14:11:09,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 14:11:09,111 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 58 [2025-02-08 14:11:09,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 61 transitions, 254 flow. Second operand has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 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-02-08 14:11:09,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:11:09,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 58 [2025-02-08 14:11:09,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:11:09,274 INFO L124 PetriNetUnfolderBase]: 698/1558 cut-off events. [2025-02-08 14:11:09,274 INFO L125 PetriNetUnfolderBase]: For 716/745 co-relation queries the response was YES. [2025-02-08 14:11:09,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3812 conditions, 1558 events. 698/1558 cut-off events. For 716/745 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 10689 event pairs, 333 based on Foata normal form. 55/1567 useless extension candidates. Maximal degree in co-relation 3775. Up to 636 conditions per place. [2025-02-08 14:11:09,280 INFO L140 encePairwiseOnDemand]: 52/58 looper letters, 85 selfloop transitions, 7 changer transitions 2/112 dead transitions. [2025-02-08 14:11:09,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 112 transitions, 630 flow [2025-02-08 14:11:09,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:11:09,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 14:11:09,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 217 transitions. [2025-02-08 14:11:09,281 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6235632183908046 [2025-02-08 14:11:09,282 INFO L175 Difference]: Start difference. First operand has 87 places, 61 transitions, 254 flow. Second operand 6 states and 217 transitions. [2025-02-08 14:11:09,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 112 transitions, 630 flow [2025-02-08 14:11:09,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 112 transitions, 604 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-02-08 14:11:09,285 INFO L231 Difference]: Finished difference. Result has 89 places, 63 transitions, 272 flow [2025-02-08 14:11:09,285 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=272, PETRI_PLACES=89, PETRI_TRANSITIONS=63} [2025-02-08 14:11:09,286 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 33 predicate places. [2025-02-08 14:11:09,286 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 63 transitions, 272 flow [2025-02-08 14:11:09,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 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-02-08 14:11:09,286 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:11:09,286 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:11:09,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 14:11:09,286 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-02-08 14:11:09,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:11:09,287 INFO L85 PathProgramCache]: Analyzing trace with hash 949776229, now seen corresponding path program 1 times [2025-02-08 14:11:09,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:11:09,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799310822] [2025-02-08 14:11:09,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:11:09,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:11:09,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 14:11:09,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 14:11:09,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:11:09,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:11:09,326 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 14:11:09,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:11:09,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799310822] [2025-02-08 14:11:09,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799310822] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:11:09,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:11:09,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:11:09,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691101069] [2025-02-08 14:11:09,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:11:09,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:11:09,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:11:09,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:11:09,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:11:09,342 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 58 [2025-02-08 14:11:09,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 63 transitions, 272 flow. Second operand has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 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-02-08 14:11:09,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:11:09,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 58 [2025-02-08 14:11:09,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:11:09,499 INFO L124 PetriNetUnfolderBase]: 733/1575 cut-off events. [2025-02-08 14:11:09,499 INFO L125 PetriNetUnfolderBase]: For 890/925 co-relation queries the response was YES. [2025-02-08 14:11:09,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4058 conditions, 1575 events. 733/1575 cut-off events. For 890/925 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 10546 event pairs, 296 based on Foata normal form. 61/1590 useless extension candidates. Maximal degree in co-relation 4021. Up to 576 conditions per place. [2025-02-08 14:11:09,504 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 64 selfloop transitions, 3 changer transitions 2/87 dead transitions. [2025-02-08 14:11:09,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 87 transitions, 492 flow [2025-02-08 14:11:09,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:11:09,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:11:09,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2025-02-08 14:11:09,505 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6853448275862069 [2025-02-08 14:11:09,505 INFO L175 Difference]: Start difference. First operand has 89 places, 63 transitions, 272 flow. Second operand 4 states and 159 transitions. [2025-02-08 14:11:09,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 87 transitions, 492 flow [2025-02-08 14:11:09,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 87 transitions, 483 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-02-08 14:11:09,508 INFO L231 Difference]: Finished difference. Result has 89 places, 63 transitions, 271 flow [2025-02-08 14:11:09,508 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=271, PETRI_PLACES=89, PETRI_TRANSITIONS=63} [2025-02-08 14:11:09,509 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 33 predicate places. [2025-02-08 14:11:09,509 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 63 transitions, 271 flow [2025-02-08 14:11:09,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 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-02-08 14:11:09,509 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:11:09,509 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1] [2025-02-08 14:11:09,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 14:11:09,509 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-02-08 14:11:09,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:11:09,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1447324927, now seen corresponding path program 2 times [2025-02-08 14:11:09,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:11:09,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329191633] [2025-02-08 14:11:09,510 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:11:09,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:11:09,516 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-02-08 14:11:09,519 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 14:11:09,520 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:11:09,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:11:09,544 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 14:11:09,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:11:09,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329191633] [2025-02-08 14:11:09,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329191633] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:11:09,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1801292123] [2025-02-08 14:11:09,544 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:11:09,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:11:09,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:11:09,552 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:11:09,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 14:11:09,595 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-02-08 14:11:09,604 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 14:11:09,604 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:11:09,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:11:09,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 14:11:09,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:11:09,633 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 14:11:09,633 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:11:09,660 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 14:11:09,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1801292123] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:11:09,660 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:11:09,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 2 [2025-02-08 14:11:09,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306455835] [2025-02-08 14:11:09,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:11:09,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:11:09,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:11:09,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:11:09,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:11:09,665 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 58 [2025-02-08 14:11:09,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 63 transitions, 271 flow. Second operand has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 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-02-08 14:11:09,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:11:09,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 58 [2025-02-08 14:11:09,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:11:09,767 INFO L124 PetriNetUnfolderBase]: 493/1291 cut-off events. [2025-02-08 14:11:09,767 INFO L125 PetriNetUnfolderBase]: For 686/735 co-relation queries the response was YES. [2025-02-08 14:11:09,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3151 conditions, 1291 events. 493/1291 cut-off events. For 686/735 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9403 event pairs, 460 based on Foata normal form. 50/1259 useless extension candidates. Maximal degree in co-relation 3120. Up to 852 conditions per place. [2025-02-08 14:11:09,771 INFO L140 encePairwiseOnDemand]: 53/58 looper letters, 25 selfloop transitions, 15 changer transitions 0/62 dead transitions. [2025-02-08 14:11:09,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 62 transitions, 341 flow [2025-02-08 14:11:09,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:11:09,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:11:09,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 142 transitions. [2025-02-08 14:11:09,772 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6120689655172413 [2025-02-08 14:11:09,772 INFO L175 Difference]: Start difference. First operand has 89 places, 63 transitions, 271 flow. Second operand 4 states and 142 transitions. [2025-02-08 14:11:09,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 62 transitions, 341 flow [2025-02-08 14:11:09,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 62 transitions, 328 flow, removed 1 selfloop flow, removed 5 redundant places. [2025-02-08 14:11:09,774 INFO L231 Difference]: Finished difference. Result has 86 places, 62 transitions, 278 flow [2025-02-08 14:11:09,775 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=278, PETRI_PLACES=86, PETRI_TRANSITIONS=62} [2025-02-08 14:11:09,775 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 30 predicate places. [2025-02-08 14:11:09,775 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 62 transitions, 278 flow [2025-02-08 14:11:09,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 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-02-08 14:11:09,775 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:11:09,775 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:11:09,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-08 14:11:09,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:11:09,980 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-02-08 14:11:09,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:11:09,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1642602749, now seen corresponding path program 1 times [2025-02-08 14:11:09,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:11:09,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730612916] [2025-02-08 14:11:09,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:11:09,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:11:09,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 14:11:09,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 14:11:09,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:11:09,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:11:10,043 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 14:11:10,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:11:10,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730612916] [2025-02-08 14:11:10,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730612916] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:11:10,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:11:10,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 14:11:10,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518189998] [2025-02-08 14:11:10,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:11:10,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 14:11:10,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:11:10,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 14:11:10,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 14:11:10,088 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 58 [2025-02-08 14:11:10,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 62 transitions, 278 flow. Second operand has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 6 states have internal predecessors, (151), 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-02-08 14:11:10,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:11:10,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 58 [2025-02-08 14:11:10,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:11:10,319 INFO L124 PetriNetUnfolderBase]: 863/1801 cut-off events. [2025-02-08 14:11:10,320 INFO L125 PetriNetUnfolderBase]: For 979/1057 co-relation queries the response was YES. [2025-02-08 14:11:10,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4425 conditions, 1801 events. 863/1801 cut-off events. For 979/1057 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 12327 event pairs, 121 based on Foata normal form. 136/1861 useless extension candidates. Maximal degree in co-relation 4343. Up to 560 conditions per place. [2025-02-08 14:11:10,324 INFO L140 encePairwiseOnDemand]: 51/58 looper letters, 79 selfloop transitions, 7 changer transitions 0/102 dead transitions. [2025-02-08 14:11:10,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 102 transitions, 592 flow [2025-02-08 14:11:10,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:11:10,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 14:11:10,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 201 transitions. [2025-02-08 14:11:10,326 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5775862068965517 [2025-02-08 14:11:10,326 INFO L175 Difference]: Start difference. First operand has 86 places, 62 transitions, 278 flow. Second operand 6 states and 201 transitions. [2025-02-08 14:11:10,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 102 transitions, 592 flow [2025-02-08 14:11:10,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 102 transitions, 559 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 14:11:10,329 INFO L231 Difference]: Finished difference. Result has 88 places, 61 transitions, 257 flow [2025-02-08 14:11:10,329 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=257, PETRI_PLACES=88, PETRI_TRANSITIONS=61} [2025-02-08 14:11:10,329 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 32 predicate places. [2025-02-08 14:11:10,329 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 61 transitions, 257 flow [2025-02-08 14:11:10,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 6 states have internal predecessors, (151), 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-02-08 14:11:10,329 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:11:10,329 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:11:10,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 14:11:10,330 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-02-08 14:11:10,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:11:10,330 INFO L85 PathProgramCache]: Analyzing trace with hash 993373497, now seen corresponding path program 1 times [2025-02-08 14:11:10,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:11:10,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117980217] [2025-02-08 14:11:10,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:11:10,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:11:10,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 14:11:10,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 14:11:10,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:11:10,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:11:10,363 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 14:11:10,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:11:10,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117980217] [2025-02-08 14:11:10,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117980217] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:11:10,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:11:10,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:11:10,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959234301] [2025-02-08 14:11:10,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:11:10,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:11:10,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:11:10,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:11:10,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:11:10,381 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 58 [2025-02-08 14:11:10,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 61 transitions, 257 flow. Second operand has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 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-02-08 14:11:10,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:11:10,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 58 [2025-02-08 14:11:10,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:11:10,502 INFO L124 PetriNetUnfolderBase]: 702/1613 cut-off events. [2025-02-08 14:11:10,502 INFO L125 PetriNetUnfolderBase]: For 1165/1213 co-relation queries the response was YES. [2025-02-08 14:11:10,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4179 conditions, 1613 events. 702/1613 cut-off events. For 1165/1213 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 11360 event pairs, 446 based on Foata normal form. 78/1652 useless extension candidates. Maximal degree in co-relation 4111. Up to 806 conditions per place. [2025-02-08 14:11:10,508 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 59 selfloop transitions, 3 changer transitions 6/85 dead transitions. [2025-02-08 14:11:10,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 85 transitions, 485 flow [2025-02-08 14:11:10,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:11:10,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:11:10,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 160 transitions. [2025-02-08 14:11:10,509 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6896551724137931 [2025-02-08 14:11:10,509 INFO L175 Difference]: Start difference. First operand has 88 places, 61 transitions, 257 flow. Second operand 4 states and 160 transitions. [2025-02-08 14:11:10,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 85 transitions, 485 flow [2025-02-08 14:11:10,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 85 transitions, 452 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 14:11:10,513 INFO L231 Difference]: Finished difference. Result has 85 places, 59 transitions, 242 flow [2025-02-08 14:11:10,513 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=242, PETRI_PLACES=85, PETRI_TRANSITIONS=59} [2025-02-08 14:11:10,513 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 29 predicate places. [2025-02-08 14:11:10,513 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 59 transitions, 242 flow [2025-02-08 14:11:10,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 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-02-08 14:11:10,514 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:11:10,514 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:11:10,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 14:11:10,514 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-02-08 14:11:10,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:11:10,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1537610710, now seen corresponding path program 1 times [2025-02-08 14:11:10,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:11:10,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442510544] [2025-02-08 14:11:10,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:11:10,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:11:10,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 14:11:10,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 14:11:10,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:11:10,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:11:10,551 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 14:11:10,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:11:10,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442510544] [2025-02-08 14:11:10,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442510544] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:11:10,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:11:10,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:11:10,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140647379] [2025-02-08 14:11:10,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:11:10,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:11:10,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:11:10,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:11:10,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:11:10,572 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 58 [2025-02-08 14:11:10,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 59 transitions, 242 flow. Second operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 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-02-08 14:11:10,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:11:10,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 58 [2025-02-08 14:11:10,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:11:10,714 INFO L124 PetriNetUnfolderBase]: 658/1439 cut-off events. [2025-02-08 14:11:10,714 INFO L125 PetriNetUnfolderBase]: For 802/860 co-relation queries the response was YES. [2025-02-08 14:11:10,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3838 conditions, 1439 events. 658/1439 cut-off events. For 802/860 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9669 event pairs, 326 based on Foata normal form. 87/1500 useless extension candidates. Maximal degree in co-relation 3773. Up to 602 conditions per place. [2025-02-08 14:11:10,720 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 68 selfloop transitions, 3 changer transitions 2/88 dead transitions. [2025-02-08 14:11:10,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 88 transitions, 498 flow [2025-02-08 14:11:10,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:11:10,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:11:10,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 155 transitions. [2025-02-08 14:11:10,721 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6681034482758621 [2025-02-08 14:11:10,721 INFO L175 Difference]: Start difference. First operand has 85 places, 59 transitions, 242 flow. Second operand 4 states and 155 transitions. [2025-02-08 14:11:10,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 88 transitions, 498 flow [2025-02-08 14:11:10,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 88 transitions, 491 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-02-08 14:11:10,725 INFO L231 Difference]: Finished difference. Result has 84 places, 58 transitions, 241 flow [2025-02-08 14:11:10,725 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=241, PETRI_PLACES=84, PETRI_TRANSITIONS=58} [2025-02-08 14:11:10,726 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 28 predicate places. [2025-02-08 14:11:10,726 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 58 transitions, 241 flow [2025-02-08 14:11:10,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 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-02-08 14:11:10,726 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:11:10,726 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:11:10,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 14:11:10,726 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-02-08 14:11:10,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:11:10,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1537611703, now seen corresponding path program 1 times [2025-02-08 14:11:10,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:11:10,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139654010] [2025-02-08 14:11:10,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:11:10,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:11:10,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 14:11:10,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 14:11:10,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:11:10,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:11:10,765 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 14:11:10,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:11:10,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139654010] [2025-02-08 14:11:10,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139654010] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:11:10,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:11:10,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 14:11:10,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44967088] [2025-02-08 14:11:10,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:11:10,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 14:11:10,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:11:10,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 14:11:10,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 14:11:10,781 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 58 [2025-02-08 14:11:10,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 58 transitions, 241 flow. Second operand has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 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-02-08 14:11:10,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:11:10,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 58 [2025-02-08 14:11:10,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:11:10,931 INFO L124 PetriNetUnfolderBase]: 617/1284 cut-off events. [2025-02-08 14:11:10,931 INFO L125 PetriNetUnfolderBase]: For 680/734 co-relation queries the response was YES. [2025-02-08 14:11:10,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3581 conditions, 1284 events. 617/1284 cut-off events. For 680/734 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 8146 event pairs, 285 based on Foata normal form. 83/1347 useless extension candidates. Maximal degree in co-relation 3516. Up to 532 conditions per place. [2025-02-08 14:11:10,936 INFO L140 encePairwiseOnDemand]: 52/58 looper letters, 51 selfloop transitions, 2 changer transitions 50/116 dead transitions. [2025-02-08 14:11:10,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 116 transitions, 659 flow [2025-02-08 14:11:10,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:11:10,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 14:11:10,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 210 transitions. [2025-02-08 14:11:10,937 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.603448275862069 [2025-02-08 14:11:10,937 INFO L175 Difference]: Start difference. First operand has 84 places, 58 transitions, 241 flow. Second operand 6 states and 210 transitions. [2025-02-08 14:11:10,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 116 transitions, 659 flow [2025-02-08 14:11:10,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 116 transitions, 644 flow, removed 3 selfloop flow, removed 4 redundant places. [2025-02-08 14:11:10,942 INFO L231 Difference]: Finished difference. Result has 86 places, 52 transitions, 212 flow [2025-02-08 14:11:10,942 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=212, PETRI_PLACES=86, PETRI_TRANSITIONS=52} [2025-02-08 14:11:10,942 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 30 predicate places. [2025-02-08 14:11:10,942 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 52 transitions, 212 flow [2025-02-08 14:11:10,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 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-02-08 14:11:10,942 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:11:10,942 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:11:10,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 14:11:10,943 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-02-08 14:11:10,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:11:10,943 INFO L85 PathProgramCache]: Analyzing trace with hash 2036373245, now seen corresponding path program 1 times [2025-02-08 14:11:10,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:11:10,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743213636] [2025-02-08 14:11:10,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:11:10,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:11:10,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 14:11:10,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 14:11:10,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:11:10,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:11:10,971 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 14:11:10,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:11:10,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743213636] [2025-02-08 14:11:10,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743213636] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:11:10,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:11:10,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:11:10,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29312356] [2025-02-08 14:11:10,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:11:10,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:11:10,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:11:10,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:11:10,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:11:10,989 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 58 [2025-02-08 14:11:10,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 52 transitions, 212 flow. Second operand has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 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-02-08 14:11:10,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:11:10,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 58 [2025-02-08 14:11:10,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:11:11,085 INFO L124 PetriNetUnfolderBase]: 289/663 cut-off events. [2025-02-08 14:11:11,085 INFO L125 PetriNetUnfolderBase]: For 403/425 co-relation queries the response was YES. [2025-02-08 14:11:11,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1879 conditions, 663 events. 289/663 cut-off events. For 403/425 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3625 event pairs, 162 based on Foata normal form. 51/696 useless extension candidates. Maximal degree in co-relation 1867. Up to 322 conditions per place. [2025-02-08 14:11:11,087 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 0 selfloop transitions, 0 changer transitions 79/79 dead transitions. [2025-02-08 14:11:11,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 79 transitions, 446 flow [2025-02-08 14:11:11,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:11:11,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:11:11,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 152 transitions. [2025-02-08 14:11:11,088 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6551724137931034 [2025-02-08 14:11:11,088 INFO L175 Difference]: Start difference. First operand has 86 places, 52 transitions, 212 flow. Second operand 4 states and 152 transitions. [2025-02-08 14:11:11,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 79 transitions, 446 flow [2025-02-08 14:11:11,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 79 transitions, 433 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-02-08 14:11:11,090 INFO L231 Difference]: Finished difference. Result has 74 places, 0 transitions, 0 flow [2025-02-08 14:11:11,090 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=74, PETRI_TRANSITIONS=0} [2025-02-08 14:11:11,090 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 18 predicate places. [2025-02-08 14:11:11,090 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 0 transitions, 0 flow [2025-02-08 14:11:11,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 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-02-08 14:11:11,092 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 28 remaining) [2025-02-08 14:11:11,093 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 28 remaining) [2025-02-08 14:11:11,093 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 28 remaining) [2025-02-08 14:11:11,093 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 28 remaining) [2025-02-08 14:11:11,093 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 28 remaining) [2025-02-08 14:11:11,093 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 28 remaining) [2025-02-08 14:11:11,093 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 28 remaining) [2025-02-08 14:11:11,093 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 28 remaining) [2025-02-08 14:11:11,093 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 28 remaining) [2025-02-08 14:11:11,093 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 28 remaining) [2025-02-08 14:11:11,093 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 28 remaining) [2025-02-08 14:11:11,093 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 28 remaining) [2025-02-08 14:11:11,093 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 28 remaining) [2025-02-08 14:11:11,093 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 28 remaining) [2025-02-08 14:11:11,093 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 28 remaining) [2025-02-08 14:11:11,094 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 28 remaining) [2025-02-08 14:11:11,094 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 28 remaining) [2025-02-08 14:11:11,094 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 28 remaining) [2025-02-08 14:11:11,094 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 28 remaining) [2025-02-08 14:11:11,094 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 28 remaining) [2025-02-08 14:11:11,094 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 28 remaining) [2025-02-08 14:11:11,094 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 28 remaining) [2025-02-08 14:11:11,094 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 28 remaining) [2025-02-08 14:11:11,094 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 28 remaining) [2025-02-08 14:11:11,094 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 28 remaining) [2025-02-08 14:11:11,094 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 28 remaining) [2025-02-08 14:11:11,094 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 28 remaining) [2025-02-08 14:11:11,094 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 28 remaining) [2025-02-08 14:11:11,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-08 14:11:11,095 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:11:11,098 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 14:11:11,098 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 14:11:11,101 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 02:11:11 BasicIcfg [2025-02-08 14:11:11,102 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 14:11:11,102 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 14:11:11,102 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 14:11:11,102 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 14:11:11,103 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:11:01" (3/4) ... [2025-02-08 14:11:11,104 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 14:11:11,105 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 14:11:11,106 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 14:11:11,108 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 59 nodes and edges [2025-02-08 14:11:11,108 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2025-02-08 14:11:11,109 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-02-08 14:11:11,109 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 14:11:11,166 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 14:11:11,167 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 14:11:11,167 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 14:11:11,169 INFO L158 Benchmark]: Toolchain (without parser) took 10061.18ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 133.2MB in the beginning and 239.2MB in the end (delta: -106.0MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. [2025-02-08 14:11:11,170 INFO L158 Benchmark]: CDTParser took 1.02ms. Allocated memory is still 209.7MB. Free memory is still 124.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:11:11,170 INFO L158 Benchmark]: CACSL2BoogieTranslator took 179.76ms. Allocated memory is still 167.8MB. Free memory was 132.8MB in the beginning and 120.9MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 14:11:11,170 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.95ms. Allocated memory is still 167.8MB. Free memory was 120.9MB in the beginning and 119.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:11:11,171 INFO L158 Benchmark]: Boogie Preprocessor took 36.28ms. Allocated memory is still 167.8MB. Free memory was 119.2MB in the beginning and 117.5MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 14:11:11,171 INFO L158 Benchmark]: IcfgBuilder took 440.24ms. Allocated memory is still 167.8MB. Free memory was 117.5MB in the beginning and 79.5MB in the end (delta: 38.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-08 14:11:11,171 INFO L158 Benchmark]: TraceAbstraction took 9303.40ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 79.0MB in the beginning and 247.6MB in the end (delta: -168.5MB). Peak memory consumption was 119.8MB. Max. memory is 16.1GB. [2025-02-08 14:11:11,171 INFO L158 Benchmark]: Witness Printer took 65.62ms. Allocated memory is still 293.6MB. Free memory was 247.6MB in the beginning and 239.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 14:11:11,172 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.02ms. Allocated memory is still 209.7MB. Free memory is still 124.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 179.76ms. Allocated memory is still 167.8MB. Free memory was 132.8MB in the beginning and 120.9MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.95ms. Allocated memory is still 167.8MB. Free memory was 120.9MB in the beginning and 119.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.28ms. Allocated memory is still 167.8MB. Free memory was 119.2MB in the beginning and 117.5MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 440.24ms. Allocated memory is still 167.8MB. Free memory was 117.5MB in the beginning and 79.5MB in the end (delta: 38.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 9303.40ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 79.0MB in the beginning and 247.6MB in the end (delta: -168.5MB). Peak memory consumption was 119.8MB. Max. memory is 16.1GB. * Witness Printer took 65.62ms. Allocated memory is still 293.6MB. Free memory was 247.6MB in the beginning and 239.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 101]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 101]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 102]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 103]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 102]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 103]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 95]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 95]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 96]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 97]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 96]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 97]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 88]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 88]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 96 locations, 28 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: 9.2s, OverallIterations: 24, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1686 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1416 mSDsluCounter, 845 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 773 mSDsCounter, 95 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4113 IncrementalHoareTripleChecker+Invalid, 4208 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 95 mSolverCounterUnsat, 72 mSDtfsCounter, 4113 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 255 GetRequests, 122 SyntacticMatches, 1 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=278occurred in iteration=19, InterpolantAutomatonStates: 132, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 379 NumberOfCodeBlocks, 379 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 415 ConstructedInterpolants, 0 QuantifiedInterpolants, 1936 SizeOfPredicates, 53 NumberOfNonLiveVariables, 689 ConjunctsInSsa, 101 ConjunctsInUnsatCore, 37 InterpolantComputations, 18 PerfectInterpolantSequences, 125/172 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 14:11:11,185 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