./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/popl20-more-array-sum-alt.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-more-array-sum-alt.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 cd36b7f18dbd530fce94e0943ff58c16da276fcc41b96fdafde87c3c69036175 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:53:57,049 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:53:57,095 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 06:53:57,102 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:53:57,102 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:53:57,120 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:53:57,121 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:53:57,121 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:53:57,121 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:53:57,121 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:53:57,121 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:53:57,121 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:53:57,121 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:53:57,121 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:53:57,121 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:53:57,121 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:53:57,122 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:53:57,122 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:53:57,122 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:53:57,122 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:53:57,122 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:53:57,122 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:53:57,122 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:53:57,122 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:53:57,122 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:53:57,122 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:53:57,122 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:53:57,122 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:53:57,122 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:53:57,122 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:53:57,122 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:53:57,122 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:53:57,122 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:53:57,122 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:53:57,122 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:53:57,122 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:53:57,122 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:53:57,122 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:53:57,122 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:53:57,122 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:53:57,123 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:53:57,123 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:53:57,123 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:53:57,123 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:53:57,123 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:53:57,123 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:53:57,123 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:53:57,123 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:53:57,123 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:53:57,123 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:53:57,123 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 -> cd36b7f18dbd530fce94e0943ff58c16da276fcc41b96fdafde87c3c69036175 [2025-01-10 06:53:57,361 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:53:57,372 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:53:57,378 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:53:57,379 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:53:57,380 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:53:57,381 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-array-sum-alt.wvr.c [2025-01-10 06:53:58,540 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/36e923e01/38c4675dcf504003a3b69fe10cce31cf/FLAG201952a89 [2025-01-10 06:53:58,782 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:53:58,783 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-array-sum-alt.wvr.c [2025-01-10 06:53:58,791 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/36e923e01/38c4675dcf504003a3b69fe10cce31cf/FLAG201952a89 [2025-01-10 06:53:59,120 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/36e923e01/38c4675dcf504003a3b69fe10cce31cf [2025-01-10 06:53:59,122 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:53:59,123 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:53:59,124 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:53:59,124 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:53:59,127 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:53:59,127 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:53:59" (1/1) ... [2025-01-10 06:53:59,128 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35d7aaa7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:53:59, skipping insertion in model container [2025-01-10 06:53:59,128 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:53:59" (1/1) ... [2025-01-10 06:53:59,139 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:53:59,288 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:53:59,298 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:53:59,316 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:53:59,329 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:53:59,330 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:53:59 WrapperNode [2025-01-10 06:53:59,330 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:53:59,331 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:53:59,331 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:53:59,331 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:53:59,337 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:53:59" (1/1) ... [2025-01-10 06:53:59,342 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:53:59" (1/1) ... [2025-01-10 06:53:59,367 INFO L138 Inliner]: procedures = 22, calls = 25, calls flagged for inlining = 13, calls inlined = 17, statements flattened = 224 [2025-01-10 06:53:59,367 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:53:59,368 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:53:59,368 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:53:59,368 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:53:59,374 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:53:59" (1/1) ... [2025-01-10 06:53:59,375 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:53:59" (1/1) ... [2025-01-10 06:53:59,381 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:53:59" (1/1) ... [2025-01-10 06:53:59,395 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 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-01-10 06:53:59,395 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:53:59" (1/1) ... [2025-01-10 06:53:59,396 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:53:59" (1/1) ... [2025-01-10 06:53:59,400 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:53:59" (1/1) ... [2025-01-10 06:53:59,401 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:53:59" (1/1) ... [2025-01-10 06:53:59,403 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:53:59" (1/1) ... [2025-01-10 06:53:59,404 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:53:59" (1/1) ... [2025-01-10 06:53:59,405 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:53:59" (1/1) ... [2025-01-10 06:53:59,406 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:53:59,407 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:53:59,407 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:53:59,407 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:53:59,408 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:53:59" (1/1) ... [2025-01-10 06:53:59,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:53:59,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:53:59,435 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 06:53:59,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 06:53:59,454 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:53:59,454 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 06:53:59,454 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 06:53:59,454 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 06:53:59,454 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 06:53:59,454 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-10 06:53:59,454 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-10 06:53:59,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:53:59,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 06:53:59,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 06:53:59,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 06:53:59,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 06:53:59,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:53:59,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:53:59,455 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 06:53:59,455 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 06:53:59,456 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 06:53:59,529 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:53:59,531 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:53:59,839 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 06:53:59,839 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:53:59,977 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:53:59,977 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 06:53:59,977 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:53:59 BoogieIcfgContainer [2025-01-10 06:53:59,977 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:53:59,990 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:53:59,990 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:53:59,993 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:53:59,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:53:59" (1/3) ... [2025-01-10 06:53:59,994 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34483b4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:53:59, skipping insertion in model container [2025-01-10 06:53:59,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:53:59" (2/3) ... [2025-01-10 06:53:59,995 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34483b4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:53:59, skipping insertion in model container [2025-01-10 06:53:59,995 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:53:59" (3/3) ... [2025-01-10 06:53:59,996 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum-alt.wvr.c [2025-01-10 06:54:00,007 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:54:00,009 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-array-sum-alt.wvr.c that has 4 procedures, 90 locations, 1 initial locations, 4 loop locations, and 26 error locations. [2025-01-10 06:54:00,009 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 06:54:00,073 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-10 06:54:00,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 99 transitions, 219 flow [2025-01-10 06:54:00,140 INFO L124 PetriNetUnfolderBase]: 10/96 cut-off events. [2025-01-10 06:54:00,141 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-10 06:54:00,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 96 events. 10/96 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 356 event pairs, 0 based on Foata normal form. 0/60 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2025-01-10 06:54:00,149 INFO L82 GeneralOperation]: Start removeDead. Operand has 99 places, 99 transitions, 219 flow [2025-01-10 06:54:00,151 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 94 places, 94 transitions, 203 flow [2025-01-10 06:54:00,156 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:54:00,169 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;@39c486, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:54:00,170 INFO L334 AbstractCegarLoop]: Starting to check reachability of 53 error locations. [2025-01-10 06:54:00,174 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:54:00,174 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-01-10 06:54:00,175 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:54:00,175 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:54:00,176 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 06:54:00,176 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-01-10 06:54:00,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:54:00,182 INFO L85 PathProgramCache]: Analyzing trace with hash 698478, now seen corresponding path program 1 times [2025-01-10 06:54:00,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:54:00,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353150953] [2025-01-10 06:54:00,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:54:00,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:54:00,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 06:54:00,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 06:54:00,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:54:00,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:54:00,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:54:00,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:54:00,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353150953] [2025-01-10 06:54:00,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353150953] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:54:00,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:54:00,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:54:00,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319670628] [2025-01-10 06:54:00,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:54:00,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:54:00,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:54:00,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:54:00,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:54:00,388 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 99 [2025-01-10 06:54:00,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 94 transitions, 203 flow. Second operand has 4 states, 4 states have (on average 54.75) internal successors, (219), 4 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:54:00,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:54:00,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 99 [2025-01-10 06:54:00,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:54:01,334 INFO L124 PetriNetUnfolderBase]: 5176/10287 cut-off events. [2025-01-10 06:54:01,335 INFO L125 PetriNetUnfolderBase]: For 293/293 co-relation queries the response was YES. [2025-01-10 06:54:01,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17430 conditions, 10287 events. 5176/10287 cut-off events. For 293/293 co-relation queries the response was YES. Maximal size of possible extension queue 523. Compared 88440 event pairs, 3552 based on Foata normal form. 1/8375 useless extension candidates. Maximal degree in co-relation 16636. Up to 6885 conditions per place. [2025-01-10 06:54:01,427 INFO L140 encePairwiseOnDemand]: 94/99 looper letters, 38 selfloop transitions, 4 changer transitions 0/93 dead transitions. [2025-01-10 06:54:01,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 93 transitions, 285 flow [2025-01-10 06:54:01,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:54:01,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:54:01,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 259 transitions. [2025-01-10 06:54:01,444 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6540404040404041 [2025-01-10 06:54:01,445 INFO L175 Difference]: Start difference. First operand has 94 places, 94 transitions, 203 flow. Second operand 4 states and 259 transitions. [2025-01-10 06:54:01,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 93 transitions, 285 flow [2025-01-10 06:54:01,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 93 transitions, 276 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-10 06:54:01,456 INFO L231 Difference]: Finished difference. Result has 91 places, 93 transitions, 200 flow [2025-01-10 06:54:01,458 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=200, PETRI_PLACES=91, PETRI_TRANSITIONS=93} [2025-01-10 06:54:01,461 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, -3 predicate places. [2025-01-10 06:54:01,462 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 93 transitions, 200 flow [2025-01-10 06:54:01,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.75) internal successors, (219), 4 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:54:01,462 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:54:01,462 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 06:54:01,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:54:01,462 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-01-10 06:54:01,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:54:01,463 INFO L85 PathProgramCache]: Analyzing trace with hash 21653484, now seen corresponding path program 1 times [2025-01-10 06:54:01,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:54:01,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480348457] [2025-01-10 06:54:01,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:54:01,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:54:01,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 06:54:01,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 06:54:01,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:54:01,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:54:01,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:54:01,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:54:01,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480348457] [2025-01-10 06:54:01,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480348457] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:54:01,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:54:01,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:54:01,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913094972] [2025-01-10 06:54:01,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:54:01,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:54:01,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:54:01,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:54:01,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:54:01,564 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 99 [2025-01-10 06:54:01,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 93 transitions, 200 flow. Second operand has 4 states, 4 states have (on average 54.75) internal successors, (219), 4 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:54:01,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:54:01,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 99 [2025-01-10 06:54:01,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:54:02,274 INFO L124 PetriNetUnfolderBase]: 5177/10291 cut-off events. [2025-01-10 06:54:02,275 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2025-01-10 06:54:02,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17344 conditions, 10291 events. 5177/10291 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 522. Compared 88543 event pairs, 3552 based on Foata normal form. 1/8379 useless extension candidates. Maximal degree in co-relation 17316. Up to 6890 conditions per place. [2025-01-10 06:54:02,324 INFO L140 encePairwiseOnDemand]: 94/99 looper letters, 41 selfloop transitions, 4 changer transitions 0/96 dead transitions. [2025-01-10 06:54:02,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 96 transitions, 302 flow [2025-01-10 06:54:02,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:54:02,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:54:02,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 262 transitions. [2025-01-10 06:54:02,326 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6616161616161617 [2025-01-10 06:54:02,326 INFO L175 Difference]: Start difference. First operand has 91 places, 93 transitions, 200 flow. Second operand 4 states and 262 transitions. [2025-01-10 06:54:02,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 96 transitions, 302 flow [2025-01-10 06:54:02,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 96 transitions, 288 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:54:02,330 INFO L231 Difference]: Finished difference. Result has 93 places, 96 transitions, 219 flow [2025-01-10 06:54:02,330 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=219, PETRI_PLACES=93, PETRI_TRANSITIONS=96} [2025-01-10 06:54:02,331 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, -1 predicate places. [2025-01-10 06:54:02,331 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 96 transitions, 219 flow [2025-01-10 06:54:02,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.75) internal successors, (219), 4 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:54:02,331 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:54:02,331 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-01-10 06:54:02,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 06:54:02,331 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-01-10 06:54:02,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:54:02,332 INFO L85 PathProgramCache]: Analyzing trace with hash 834498273, now seen corresponding path program 1 times [2025-01-10 06:54:02,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:54:02,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871255534] [2025-01-10 06:54:02,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:54:02,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:54:02,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:54:02,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:54:02,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:54:02,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:54:02,441 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:54:02,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:54:02,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871255534] [2025-01-10 06:54:02,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871255534] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:54:02,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306597412] [2025-01-10 06:54:02,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:54:02,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:54:02,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:54:02,444 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-01-10 06:54:02,445 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-01-10 06:54:02,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:54:02,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:54:02,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:54:02,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:54:02,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:54:02,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:54:02,533 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:54:02,533 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:54:02,574 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:54:02,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [306597412] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:54:02,575 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:54:02,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-01-10 06:54:02,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649021264] [2025-01-10 06:54:02,575 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:54:02,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 06:54:02,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:54:02,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 06:54:02,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:54:02,590 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 99 [2025-01-10 06:54:02,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 96 transitions, 219 flow. Second operand has 10 states, 10 states have (on average 55.0) internal successors, (550), 10 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:54:02,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:54:02,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 99 [2025-01-10 06:54:02,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:54:03,303 INFO L124 PetriNetUnfolderBase]: 5180/10303 cut-off events. [2025-01-10 06:54:03,303 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2025-01-10 06:54:03,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17380 conditions, 10303 events. 5180/10303 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 522. Compared 88663 event pairs, 3552 based on Foata normal form. 0/8387 useless extension candidates. Maximal degree in co-relation 17323. Up to 6893 conditions per place. [2025-01-10 06:54:03,351 INFO L140 encePairwiseOnDemand]: 94/99 looper letters, 41 selfloop transitions, 13 changer transitions 0/105 dead transitions. [2025-01-10 06:54:03,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 105 transitions, 363 flow [2025-01-10 06:54:03,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 06:54:03,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 06:54:03,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 597 transitions. [2025-01-10 06:54:03,353 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.603030303030303 [2025-01-10 06:54:03,353 INFO L175 Difference]: Start difference. First operand has 93 places, 96 transitions, 219 flow. Second operand 10 states and 597 transitions. [2025-01-10 06:54:03,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 105 transitions, 363 flow [2025-01-10 06:54:03,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 105 transitions, 360 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:54:03,355 INFO L231 Difference]: Finished difference. Result has 104 places, 105 transitions, 296 flow [2025-01-10 06:54:03,355 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=296, PETRI_PLACES=104, PETRI_TRANSITIONS=105} [2025-01-10 06:54:03,357 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 10 predicate places. [2025-01-10 06:54:03,357 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 105 transitions, 296 flow [2025-01-10 06:54:03,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 55.0) internal successors, (550), 10 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:54:03,358 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:54:03,358 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:54:03,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-10 06:54:03,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:54:03,562 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-01-10 06:54:03,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:54:03,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1019984633, now seen corresponding path program 1 times [2025-01-10 06:54:03,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:54:03,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896292735] [2025-01-10 06:54:03,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:54:03,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:54:03,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:54:03,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:54:03,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:54:03,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:54:03,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:54:03,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:54:03,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896292735] [2025-01-10 06:54:03,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896292735] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:54:03,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:54:03,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:54:03,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051743868] [2025-01-10 06:54:03,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:54:03,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:54:03,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:54:03,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:54:03,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:54:03,673 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 99 [2025-01-10 06:54:03,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 105 transitions, 296 flow. Second operand has 4 states, 4 states have (on average 51.75) internal successors, (207), 4 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:54:03,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:54:03,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 99 [2025-01-10 06:54:03,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:54:04,803 INFO L124 PetriNetUnfolderBase]: 9902/17791 cut-off events. [2025-01-10 06:54:04,803 INFO L125 PetriNetUnfolderBase]: For 96/96 co-relation queries the response was YES. [2025-01-10 06:54:04,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31364 conditions, 17791 events. 9902/17791 cut-off events. For 96/96 co-relation queries the response was YES. Maximal size of possible extension queue 885. Compared 152446 event pairs, 3202 based on Foata normal form. 444/15065 useless extension candidates. Maximal degree in co-relation 31328. Up to 6304 conditions per place. [2025-01-10 06:54:04,901 INFO L140 encePairwiseOnDemand]: 91/99 looper letters, 107 selfloop transitions, 5 changer transitions 0/158 dead transitions. [2025-01-10 06:54:04,901 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 158 transitions, 632 flow [2025-01-10 06:54:04,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:54:04,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:54:04,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 303 transitions. [2025-01-10 06:54:04,903 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7651515151515151 [2025-01-10 06:54:04,903 INFO L175 Difference]: Start difference. First operand has 104 places, 105 transitions, 296 flow. Second operand 4 states and 303 transitions. [2025-01-10 06:54:04,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 158 transitions, 632 flow [2025-01-10 06:54:04,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 158 transitions, 602 flow, removed 11 selfloop flow, removed 3 redundant places. [2025-01-10 06:54:04,907 INFO L231 Difference]: Finished difference. Result has 106 places, 107 transitions, 300 flow [2025-01-10 06:54:04,907 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=300, PETRI_PLACES=106, PETRI_TRANSITIONS=107} [2025-01-10 06:54:04,908 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 12 predicate places. [2025-01-10 06:54:04,908 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 107 transitions, 300 flow [2025-01-10 06:54:04,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.75) internal successors, (207), 4 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:54:04,909 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:54:04,909 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:54:04,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 06:54:04,909 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-01-10 06:54:04,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:54:04,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1554753313, now seen corresponding path program 1 times [2025-01-10 06:54:04,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:54:04,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793117388] [2025-01-10 06:54:04,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:54:04,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:54:04,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:54:04,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:54:04,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:54:04,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:54:04,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:54:04,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:54:04,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793117388] [2025-01-10 06:54:04,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793117388] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:54:04,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:54:04,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:54:04,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418874645] [2025-01-10 06:54:04,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:54:04,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:54:04,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:54:04,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:54:04,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:54:04,986 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 99 [2025-01-10 06:54:04,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 107 transitions, 300 flow. Second operand has 5 states, 5 states have (on average 57.0) internal successors, (285), 5 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:54:04,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:54:04,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 99 [2025-01-10 06:54:04,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:54:05,833 INFO L124 PetriNetUnfolderBase]: 7920/15928 cut-off events. [2025-01-10 06:54:05,834 INFO L125 PetriNetUnfolderBase]: For 2613/2961 co-relation queries the response was YES. [2025-01-10 06:54:05,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28584 conditions, 15928 events. 7920/15928 cut-off events. For 2613/2961 co-relation queries the response was YES. Maximal size of possible extension queue 739. Compared 146967 event pairs, 5142 based on Foata normal form. 397/13704 useless extension candidates. Maximal degree in co-relation 28550. Up to 8301 conditions per place. [2025-01-10 06:54:05,936 INFO L140 encePairwiseOnDemand]: 93/99 looper letters, 105 selfloop transitions, 5 changer transitions 0/162 dead transitions. [2025-01-10 06:54:05,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 162 transitions, 639 flow [2025-01-10 06:54:05,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:54:05,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:54:05,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 380 transitions. [2025-01-10 06:54:05,937 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7676767676767676 [2025-01-10 06:54:05,937 INFO L175 Difference]: Start difference. First operand has 106 places, 107 transitions, 300 flow. Second operand 5 states and 380 transitions. [2025-01-10 06:54:05,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 162 transitions, 639 flow [2025-01-10 06:54:05,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 162 transitions, 639 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:54:05,956 INFO L231 Difference]: Finished difference. Result has 112 places, 109 transitions, 325 flow [2025-01-10 06:54:05,956 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=325, PETRI_PLACES=112, PETRI_TRANSITIONS=109} [2025-01-10 06:54:05,958 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 18 predicate places. [2025-01-10 06:54:05,958 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 109 transitions, 325 flow [2025-01-10 06:54:05,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 57.0) internal successors, (285), 5 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:54:05,958 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:54:05,959 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:54:05,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:54:05,959 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-01-10 06:54:05,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:54:05,959 INFO L85 PathProgramCache]: Analyzing trace with hash 796359088, now seen corresponding path program 1 times [2025-01-10 06:54:05,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:54:05,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614556892] [2025-01-10 06:54:05,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:54:05,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:54:05,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:54:05,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:54:05,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:54:05,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:54:06,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:54:06,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:54:06,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614556892] [2025-01-10 06:54:06,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614556892] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:54:06,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:54:06,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:54:06,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710985355] [2025-01-10 06:54:06,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:54:06,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:54:06,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:54:06,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:54:06,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:54:06,035 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 99 [2025-01-10 06:54:06,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 109 transitions, 325 flow. Second operand has 4 states, 4 states have (on average 52.25) internal successors, (209), 4 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:54:06,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:54:06,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 99 [2025-01-10 06:54:06,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:54:07,545 INFO L124 PetriNetUnfolderBase]: 14704/27614 cut-off events. [2025-01-10 06:54:07,545 INFO L125 PetriNetUnfolderBase]: For 8096/8564 co-relation queries the response was YES. [2025-01-10 06:54:07,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53890 conditions, 27614 events. 14704/27614 cut-off events. For 8096/8564 co-relation queries the response was YES. Maximal size of possible extension queue 1322. Compared 259513 event pairs, 5128 based on Foata normal form. 898/23886 useless extension candidates. Maximal degree in co-relation 53853. Up to 9949 conditions per place. [2025-01-10 06:54:07,804 INFO L140 encePairwiseOnDemand]: 91/99 looper letters, 115 selfloop transitions, 5 changer transitions 0/166 dead transitions. [2025-01-10 06:54:07,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 166 transitions, 749 flow [2025-01-10 06:54:07,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:54:07,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:54:07,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 299 transitions. [2025-01-10 06:54:07,806 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7550505050505051 [2025-01-10 06:54:07,806 INFO L175 Difference]: Start difference. First operand has 112 places, 109 transitions, 325 flow. Second operand 4 states and 299 transitions. [2025-01-10 06:54:07,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 166 transitions, 749 flow [2025-01-10 06:54:07,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 166 transitions, 744 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:54:07,825 INFO L231 Difference]: Finished difference. Result has 115 places, 111 transitions, 354 flow [2025-01-10 06:54:07,825 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=354, PETRI_PLACES=115, PETRI_TRANSITIONS=111} [2025-01-10 06:54:07,826 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 21 predicate places. [2025-01-10 06:54:07,826 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 111 transitions, 354 flow [2025-01-10 06:54:07,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.25) internal successors, (209), 4 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:54:07,826 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:54:07,826 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:54:07,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:54:07,826 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-01-10 06:54:07,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:54:07,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1082671261, now seen corresponding path program 1 times [2025-01-10 06:54:07,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:54:07,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482567763] [2025-01-10 06:54:07,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:54:07,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:54:07,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:54:07,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:54:07,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:54:07,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:54:07,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:54:07,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:54:07,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482567763] [2025-01-10 06:54:07,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482567763] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:54:07,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:54:07,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:54:07,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581087934] [2025-01-10 06:54:07,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:54:07,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:54:07,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:54:07,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:54:07,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:54:07,909 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 99 [2025-01-10 06:54:07,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 111 transitions, 354 flow. Second operand has 5 states, 5 states have (on average 57.4) internal successors, (287), 5 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:54:07,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:54:07,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 99 [2025-01-10 06:54:07,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:54:09,044 INFO L124 PetriNetUnfolderBase]: 8097/17109 cut-off events. [2025-01-10 06:54:09,044 INFO L125 PetriNetUnfolderBase]: For 7045/7826 co-relation queries the response was YES. [2025-01-10 06:54:09,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33593 conditions, 17109 events. 8097/17109 cut-off events. For 7045/7826 co-relation queries the response was YES. Maximal size of possible extension queue 871. Compared 166788 event pairs, 5664 based on Foata normal form. 471/14971 useless extension candidates. Maximal degree in co-relation 33554. Up to 10271 conditions per place. [2025-01-10 06:54:09,133 INFO L140 encePairwiseOnDemand]: 93/99 looper letters, 88 selfloop transitions, 5 changer transitions 2/147 dead transitions. [2025-01-10 06:54:09,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 147 transitions, 633 flow [2025-01-10 06:54:09,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:54:09,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:54:09,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 363 transitions. [2025-01-10 06:54:09,135 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2025-01-10 06:54:09,135 INFO L175 Difference]: Start difference. First operand has 115 places, 111 transitions, 354 flow. Second operand 5 states and 363 transitions. [2025-01-10 06:54:09,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 147 transitions, 633 flow [2025-01-10 06:54:09,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 147 transitions, 633 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:54:09,152 INFO L231 Difference]: Finished difference. Result has 121 places, 113 transitions, 379 flow [2025-01-10 06:54:09,153 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=379, PETRI_PLACES=121, PETRI_TRANSITIONS=113} [2025-01-10 06:54:09,153 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 27 predicate places. [2025-01-10 06:54:09,153 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 113 transitions, 379 flow [2025-01-10 06:54:09,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 57.4) internal successors, (287), 5 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:54:09,153 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:54:09,153 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:54:09,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 06:54:09,154 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-01-10 06:54:09,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:54:09,154 INFO L85 PathProgramCache]: Analyzing trace with hash -295811822, now seen corresponding path program 1 times [2025-01-10 06:54:09,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:54:09,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326827817] [2025-01-10 06:54:09,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:54:09,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:54:09,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:54:09,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:54:09,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:54:09,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:54:09,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:54:09,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:54:09,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326827817] [2025-01-10 06:54:09,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326827817] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:54:09,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:54:09,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:54:09,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535148968] [2025-01-10 06:54:09,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:54:09,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:54:09,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:54:09,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:54:09,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:54:09,232 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 99 [2025-01-10 06:54:09,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 113 transitions, 379 flow. Second operand has 4 states, 4 states have (on average 52.75) internal successors, (211), 4 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:54:09,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:54:09,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 99 [2025-01-10 06:54:09,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:54:10,776 INFO L124 PetriNetUnfolderBase]: 15068/28057 cut-off events. [2025-01-10 06:54:10,776 INFO L125 PetriNetUnfolderBase]: For 15042/16187 co-relation queries the response was YES. [2025-01-10 06:54:10,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60571 conditions, 28057 events. 15068/28057 cut-off events. For 15042/16187 co-relation queries the response was YES. Maximal size of possible extension queue 1448. Compared 262676 event pairs, 5913 based on Foata normal form. 1210/25627 useless extension candidates. Maximal degree in co-relation 60529. Up to 10889 conditions per place. [2025-01-10 06:54:10,974 INFO L140 encePairwiseOnDemand]: 91/99 looper letters, 125 selfloop transitions, 5 changer transitions 0/176 dead transitions. [2025-01-10 06:54:10,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 176 transitions, 897 flow [2025-01-10 06:54:10,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:54:10,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:54:10,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 297 transitions. [2025-01-10 06:54:10,975 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.75 [2025-01-10 06:54:10,975 INFO L175 Difference]: Start difference. First operand has 121 places, 113 transitions, 379 flow. Second operand 4 states and 297 transitions. [2025-01-10 06:54:10,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 176 transitions, 897 flow [2025-01-10 06:54:11,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 176 transitions, 892 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:54:11,045 INFO L231 Difference]: Finished difference. Result has 124 places, 115 transitions, 408 flow [2025-01-10 06:54:11,045 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=408, PETRI_PLACES=124, PETRI_TRANSITIONS=115} [2025-01-10 06:54:11,045 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 30 predicate places. [2025-01-10 06:54:11,045 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 115 transitions, 408 flow [2025-01-10 06:54:11,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.75) internal successors, (211), 4 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:54:11,046 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:54:11,046 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:54:11,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 06:54:11,046 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-01-10 06:54:11,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:54:11,046 INFO L85 PathProgramCache]: Analyzing trace with hash 2108173206, now seen corresponding path program 1 times [2025-01-10 06:54:11,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:54:11,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734526294] [2025-01-10 06:54:11,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:54:11,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:54:11,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:54:11,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:54:11,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:54:11,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:54:11,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:54:11,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:54:11,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734526294] [2025-01-10 06:54:11,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734526294] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:54:11,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530117804] [2025-01-10 06:54:11,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:54:11,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:54:11,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:54:11,306 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-01-10 06:54:11,308 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-01-10 06:54:11,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:54:11,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:54:11,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:54:11,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:54:11,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-10 06:54:11,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:54:11,399 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-01-10 06:54:11,461 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-01-10 06:54:11,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:54:11,473 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:54:11,535 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-01-10 06:54:11,538 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-01-10 06:54:11,550 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:54:11,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1530117804] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:54:11,550 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:54:11,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-01-10 06:54:11,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725205709] [2025-01-10 06:54:11,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:54:11,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 06:54:11,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:54:11,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 06:54:11,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-01-10 06:54:11,606 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 99 [2025-01-10 06:54:11,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 115 transitions, 408 flow. Second operand has 13 states, 13 states have (on average 54.38461538461539) internal successors, (707), 13 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:54:11,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:54:11,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 99 [2025-01-10 06:54:11,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:54:15,362 INFO L124 PetriNetUnfolderBase]: 22656/46049 cut-off events. [2025-01-10 06:54:15,362 INFO L125 PetriNetUnfolderBase]: For 29110/31256 co-relation queries the response was YES. [2025-01-10 06:54:15,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101459 conditions, 46049 events. 22656/46049 cut-off events. For 29110/31256 co-relation queries the response was YES. Maximal size of possible extension queue 1595. Compared 484394 event pairs, 5561 based on Foata normal form. 1136/42603 useless extension candidates. Maximal degree in co-relation 101415. Up to 10807 conditions per place. [2025-01-10 06:54:15,797 INFO L140 encePairwiseOnDemand]: 86/99 looper letters, 195 selfloop transitions, 19 changer transitions 1/265 dead transitions. [2025-01-10 06:54:15,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 265 transitions, 1368 flow [2025-01-10 06:54:15,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 06:54:15,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 06:54:15,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 713 transitions. [2025-01-10 06:54:15,799 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7202020202020202 [2025-01-10 06:54:15,799 INFO L175 Difference]: Start difference. First operand has 124 places, 115 transitions, 408 flow. Second operand 10 states and 713 transitions. [2025-01-10 06:54:15,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 265 transitions, 1368 flow [2025-01-10 06:54:15,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 265 transitions, 1368 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:54:15,935 INFO L231 Difference]: Finished difference. Result has 136 places, 124 transitions, 521 flow [2025-01-10 06:54:15,935 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=521, PETRI_PLACES=136, PETRI_TRANSITIONS=124} [2025-01-10 06:54:15,936 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 42 predicate places. [2025-01-10 06:54:15,936 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 124 transitions, 521 flow [2025-01-10 06:54:15,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 54.38461538461539) internal successors, (707), 13 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:54:15,936 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:54:15,936 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:54:15,943 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 06:54:16,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:54:16,137 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-01-10 06:54:16,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:54:16,138 INFO L85 PathProgramCache]: Analyzing trace with hash -580231076, now seen corresponding path program 1 times [2025-01-10 06:54:16,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:54:16,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148783440] [2025-01-10 06:54:16,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:54:16,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:54:16,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:54:16,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:54:16,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:54:16,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:54:16,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:54:16,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:54:16,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148783440] [2025-01-10 06:54:16,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148783440] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:54:16,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:54:16,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:54:16,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645822517] [2025-01-10 06:54:16,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:54:16,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:54:16,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:54:16,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:54:16,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:54:16,214 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 99 [2025-01-10 06:54:16,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 124 transitions, 521 flow. Second operand has 5 states, 5 states have (on average 57.8) internal successors, (289), 5 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:54:16,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:54:16,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 99 [2025-01-10 06:54:16,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:54:19,540 INFO L124 PetriNetUnfolderBase]: 19882/42420 cut-off events. [2025-01-10 06:54:19,540 INFO L125 PetriNetUnfolderBase]: For 44243/46690 co-relation queries the response was YES. [2025-01-10 06:54:19,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99608 conditions, 42420 events. 19882/42420 cut-off events. For 44243/46690 co-relation queries the response was YES. Maximal size of possible extension queue 1606. Compared 464469 event pairs, 14591 based on Foata normal form. 1158/39092 useless extension candidates. Maximal degree in co-relation 99559. Up to 26072 conditions per place. [2025-01-10 06:54:19,872 INFO L140 encePairwiseOnDemand]: 93/99 looper letters, 64 selfloop transitions, 2 changer transitions 22/141 dead transitions. [2025-01-10 06:54:19,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 141 transitions, 755 flow [2025-01-10 06:54:19,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:54:19,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:54:19,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 346 transitions. [2025-01-10 06:54:19,874 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6989898989898989 [2025-01-10 06:54:19,874 INFO L175 Difference]: Start difference. First operand has 136 places, 124 transitions, 521 flow. Second operand 5 states and 346 transitions. [2025-01-10 06:54:19,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 141 transitions, 755 flow [2025-01-10 06:54:20,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 141 transitions, 735 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-01-10 06:54:20,064 INFO L231 Difference]: Finished difference. Result has 138 places, 119 transitions, 484 flow [2025-01-10 06:54:20,065 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=503, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=484, PETRI_PLACES=138, PETRI_TRANSITIONS=119} [2025-01-10 06:54:20,065 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 44 predicate places. [2025-01-10 06:54:20,065 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 119 transitions, 484 flow [2025-01-10 06:54:20,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 57.8) internal successors, (289), 5 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:54:20,065 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:54:20,065 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:54:20,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 06:54:20,065 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-01-10 06:54:20,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:54:20,066 INFO L85 PathProgramCache]: Analyzing trace with hash 928828936, now seen corresponding path program 1 times [2025-01-10 06:54:20,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:54:20,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513799252] [2025-01-10 06:54:20,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:54:20,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:54:20,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:54:20,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:54:20,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:54:20,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:54:20,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:54:20,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:54:20,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513799252] [2025-01-10 06:54:20,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513799252] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:54:20,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983980095] [2025-01-10 06:54:20,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:54:20,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:54:20,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:54:20,215 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-01-10 06:54:20,217 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-01-10 06:54:20,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:54:20,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:54:20,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:54:20,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:54:20,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-10 06:54:20,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:54:20,285 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-01-10 06:54:20,325 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-01-10 06:54:20,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:54:20,332 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:54:20,386 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-01-10 06:54:20,389 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-01-10 06:54:20,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:54:20,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [983980095] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:54:20,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:54:20,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-01-10 06:54:20,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40187121] [2025-01-10 06:54:20,399 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:54:20,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 06:54:20,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:54:20,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 06:54:20,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-01-10 06:54:20,439 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 99 [2025-01-10 06:54:20,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 119 transitions, 484 flow. Second operand has 13 states, 13 states have (on average 52.53846153846154) internal successors, (683), 13 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:54:20,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:54:20,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 99 [2025-01-10 06:54:20,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:54:24,551 INFO L124 PetriNetUnfolderBase]: 27383/49864 cut-off events. [2025-01-10 06:54:24,552 INFO L125 PetriNetUnfolderBase]: For 50330/53064 co-relation queries the response was YES. [2025-01-10 06:54:24,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123257 conditions, 49864 events. 27383/49864 cut-off events. For 50330/53064 co-relation queries the response was YES. Maximal size of possible extension queue 1712. Compared 480676 event pairs, 7042 based on Foata normal form. 1746/47372 useless extension candidates. Maximal degree in co-relation 123218. Up to 14359 conditions per place. [2025-01-10 06:54:25,228 INFO L140 encePairwiseOnDemand]: 86/99 looper letters, 176 selfloop transitions, 18 changer transitions 0/241 dead transitions. [2025-01-10 06:54:25,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 241 transitions, 1328 flow [2025-01-10 06:54:25,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 06:54:25,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 06:54:25,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 670 transitions. [2025-01-10 06:54:25,230 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6767676767676768 [2025-01-10 06:54:25,230 INFO L175 Difference]: Start difference. First operand has 138 places, 119 transitions, 484 flow. Second operand 10 states and 670 transitions. [2025-01-10 06:54:25,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 241 transitions, 1328 flow [2025-01-10 06:54:25,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 241 transitions, 1260 flow, removed 32 selfloop flow, removed 7 redundant places. [2025-01-10 06:54:25,375 INFO L231 Difference]: Finished difference. Result has 136 places, 121 transitions, 526 flow [2025-01-10 06:54:25,375 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=458, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=526, PETRI_PLACES=136, PETRI_TRANSITIONS=121} [2025-01-10 06:54:25,375 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 42 predicate places. [2025-01-10 06:54:25,375 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 121 transitions, 526 flow [2025-01-10 06:54:25,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 52.53846153846154) internal successors, (683), 13 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:54:25,376 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:54:25,376 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:54:25,382 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-01-10 06:54:25,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:54:25,580 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-01-10 06:54:25,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:54:25,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1271074312, now seen corresponding path program 1 times [2025-01-10 06:54:25,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:54:25,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59173018] [2025-01-10 06:54:25,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:54:25,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:54:25,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:54:25,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:54:25,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:54:25,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:54:25,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:54:25,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:54:25,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59173018] [2025-01-10 06:54:25,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59173018] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:54:25,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:54:25,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:54:25,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019929954] [2025-01-10 06:54:25,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:54:25,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:54:25,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:54:25,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:54:25,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:54:25,670 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 99 [2025-01-10 06:54:25,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 121 transitions, 526 flow. Second operand has 5 states, 5 states have (on average 53.2) internal successors, (266), 5 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:54:25,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:54:25,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 99 [2025-01-10 06:54:25,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:54:29,638 INFO L124 PetriNetUnfolderBase]: 30395/54100 cut-off events. [2025-01-10 06:54:29,638 INFO L125 PetriNetUnfolderBase]: For 57236/60154 co-relation queries the response was YES. [2025-01-10 06:54:29,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135240 conditions, 54100 events. 30395/54100 cut-off events. For 57236/60154 co-relation queries the response was YES. Maximal size of possible extension queue 1897. Compared 517288 event pairs, 5368 based on Foata normal form. 2140/52975 useless extension candidates. Maximal degree in co-relation 135194. Up to 23055 conditions per place. [2025-01-10 06:54:30,304 INFO L140 encePairwiseOnDemand]: 91/99 looper letters, 190 selfloop transitions, 8 changer transitions 0/245 dead transitions. [2025-01-10 06:54:30,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 245 transitions, 1332 flow [2025-01-10 06:54:30,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:54:30,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:54:30,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 470 transitions. [2025-01-10 06:54:30,305 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7912457912457912 [2025-01-10 06:54:30,305 INFO L175 Difference]: Start difference. First operand has 136 places, 121 transitions, 526 flow. Second operand 6 states and 470 transitions. [2025-01-10 06:54:30,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 245 transitions, 1332 flow [2025-01-10 06:54:30,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 245 transitions, 1308 flow, removed 1 selfloop flow, removed 7 redundant places. [2025-01-10 06:54:30,644 INFO L231 Difference]: Finished difference. Result has 137 places, 122 transitions, 534 flow [2025-01-10 06:54:30,644 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=534, PETRI_PLACES=137, PETRI_TRANSITIONS=122} [2025-01-10 06:54:30,645 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 43 predicate places. [2025-01-10 06:54:30,645 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 122 transitions, 534 flow [2025-01-10 06:54:30,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 53.2) internal successors, (266), 5 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:54:30,645 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:54:30,645 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:54:30,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 06:54:30,645 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-01-10 06:54:30,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:54:30,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1822098792, now seen corresponding path program 1 times [2025-01-10 06:54:30,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:54:30,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570830590] [2025-01-10 06:54:30,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:54:30,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:54:30,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:54:30,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:54:30,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:54:30,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:54:30,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:54:30,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:54:30,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570830590] [2025-01-10 06:54:30,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570830590] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:54:30,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148281212] [2025-01-10 06:54:30,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:54:30,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:54:30,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:54:30,785 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-01-10 06:54:30,786 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-01-10 06:54:30,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:54:30,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:54:30,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:54:30,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:54:30,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-10 06:54:30,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:54:30,871 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-01-10 06:54:30,915 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-01-10 06:54:30,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:54:30,922 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:54:30,973 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-01-10 06:54:30,976 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-01-10 06:54:30,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:54:30,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148281212] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:54:30,986 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:54:30,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-01-10 06:54:30,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149214054] [2025-01-10 06:54:30,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:54:30,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 06:54:30,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:54:30,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 06:54:30,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-01-10 06:54:31,038 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 99 [2025-01-10 06:54:31,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 122 transitions, 534 flow. Second operand has 13 states, 13 states have (on average 54.69230769230769) internal successors, (711), 13 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:54:31,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:54:31,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 99 [2025-01-10 06:54:31,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:54:37,919 INFO L124 PetriNetUnfolderBase]: 44830/89510 cut-off events. [2025-01-10 06:54:37,919 INFO L125 PetriNetUnfolderBase]: For 109113/113385 co-relation queries the response was YES. [2025-01-10 06:54:38,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 214508 conditions, 89510 events. 44830/89510 cut-off events. For 109113/113385 co-relation queries the response was YES. Maximal size of possible extension queue 2563. Compared 989759 event pairs, 11782 based on Foata normal form. 2783/84283 useless extension candidates. Maximal degree in co-relation 214462. Up to 21920 conditions per place. [2025-01-10 06:54:38,887 INFO L140 encePairwiseOnDemand]: 86/99 looper letters, 205 selfloop transitions, 18 changer transitions 0/277 dead transitions. [2025-01-10 06:54:38,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 277 transitions, 1800 flow [2025-01-10 06:54:38,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 06:54:38,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 06:54:38,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 683 transitions. [2025-01-10 06:54:38,890 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6898989898989899 [2025-01-10 06:54:38,890 INFO L175 Difference]: Start difference. First operand has 137 places, 122 transitions, 534 flow. Second operand 10 states and 683 transitions. [2025-01-10 06:54:38,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 277 transitions, 1800 flow [2025-01-10 06:54:39,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 277 transitions, 1790 flow, removed 5 selfloop flow, removed 0 redundant places. [2025-01-10 06:54:39,570 INFO L231 Difference]: Finished difference. Result has 149 places, 131 transitions, 639 flow [2025-01-10 06:54:39,570 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=532, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=639, PETRI_PLACES=149, PETRI_TRANSITIONS=131} [2025-01-10 06:54:39,570 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 55 predicate places. [2025-01-10 06:54:39,570 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 131 transitions, 639 flow [2025-01-10 06:54:39,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 54.69230769230769) internal successors, (711), 13 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:54:39,571 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:54:39,571 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:54:39,577 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-01-10 06:54:39,771 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,SelfDestructingSolverStorable12 [2025-01-10 06:54:39,771 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-01-10 06:54:39,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:54:39,772 INFO L85 PathProgramCache]: Analyzing trace with hash -748597237, now seen corresponding path program 1 times [2025-01-10 06:54:39,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:54:39,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821583998] [2025-01-10 06:54:39,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:54:39,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:54:39,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:54:39,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:54:39,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:54:39,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:54:39,845 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:54:39,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:54:39,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821583998] [2025-01-10 06:54:39,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821583998] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:54:39,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:54:39,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:54:39,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129296909] [2025-01-10 06:54:39,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:54:39,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:54:39,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:54:39,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:54:39,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:54:39,861 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 99 [2025-01-10 06:54:39,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 131 transitions, 639 flow. Second operand has 6 states, 6 states have (on average 49.833333333333336) internal successors, (299), 6 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:54:39,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:54:39,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 99 [2025-01-10 06:54:39,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand