./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/chl-word-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-word-trans.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9cb2b0cbecf02e8cce2fd890595fb88c3204482a27ce7ac6f4ef6fb92949d747 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:51:00,299 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:51:00,357 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 06:51:00,362 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:51:00,363 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:51:00,387 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:51:00,388 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:51:00,388 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:51:00,389 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:51:00,389 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:51:00,389 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:51:00,389 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:51:00,389 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:51:00,389 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:51:00,389 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:51:00,389 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:51:00,389 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:51:00,390 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:51:00,390 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:51:00,390 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:51:00,390 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:51:00,390 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:51:00,390 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:51:00,390 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:51:00,390 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:51:00,390 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:51:00,390 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:51:00,390 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:51:00,390 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:51:00,390 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:51:00,390 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:51:00,390 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:51:00,390 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:51:00,390 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:51:00,390 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:51:00,390 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:51:00,390 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:51:00,391 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:51:00,391 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:51:00,391 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:51:00,391 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:51:00,391 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:51:00,391 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:51:00,391 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:51:00,391 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:51:00,391 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:51:00,391 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:51:00,391 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:51:00,391 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:51:00,391 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:51:00,391 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 -> 9cb2b0cbecf02e8cce2fd890595fb88c3204482a27ce7ac6f4ef6fb92949d747 [2025-01-10 06:51:00,622 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:51:00,629 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:51:00,631 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:51:00,632 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:51:00,632 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:51:00,633 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-word-trans.wvr.c [2025-01-10 06:51:01,815 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5e9d046b4/c76632baefa74231a501ec87e3390ae4/FLAG1429f8fd8 [2025-01-10 06:51:02,051 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:51:02,051 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-word-trans.wvr.c [2025-01-10 06:51:02,059 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5e9d046b4/c76632baefa74231a501ec87e3390ae4/FLAG1429f8fd8 [2025-01-10 06:51:02,075 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5e9d046b4/c76632baefa74231a501ec87e3390ae4 [2025-01-10 06:51:02,077 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:51:02,078 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:51:02,080 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:51:02,080 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:51:02,083 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:51:02,084 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:51:02" (1/1) ... [2025-01-10 06:51:02,084 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f3c20d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:51:02, skipping insertion in model container [2025-01-10 06:51:02,085 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:51:02" (1/1) ... [2025-01-10 06:51:02,100 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:51:02,240 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:51:02,247 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:51:02,275 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:51:02,287 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:51:02,289 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:51:02 WrapperNode [2025-01-10 06:51:02,289 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:51:02,290 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:51:02,290 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:51:02,290 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:51:02,294 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:51:02" (1/1) ... [2025-01-10 06:51:02,302 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:51:02" (1/1) ... [2025-01-10 06:51:02,319 INFO L138 Inliner]: procedures = 24, calls = 30, calls flagged for inlining = 9, calls inlined = 13, statements flattened = 164 [2025-01-10 06:51:02,322 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:51:02,323 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:51:02,323 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:51:02,324 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:51:02,329 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:51:02" (1/1) ... [2025-01-10 06:51:02,330 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:51:02" (1/1) ... [2025-01-10 06:51:02,332 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:51:02" (1/1) ... [2025-01-10 06:51:02,353 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [2, 15]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-01-10 06:51:02,353 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:51:02" (1/1) ... [2025-01-10 06:51:02,353 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:51:02" (1/1) ... [2025-01-10 06:51:02,362 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:51:02" (1/1) ... [2025-01-10 06:51:02,367 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:51:02" (1/1) ... [2025-01-10 06:51:02,369 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:51:02" (1/1) ... [2025-01-10 06:51:02,374 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:51:02" (1/1) ... [2025-01-10 06:51:02,375 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:51:02" (1/1) ... [2025-01-10 06:51:02,376 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:51:02,377 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:51:02,377 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:51:02,377 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:51:02,378 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:51:02" (1/1) ... [2025-01-10 06:51:02,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:51:02,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:51:02,405 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 06:51:02,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 06:51:02,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:51:02,426 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 06:51:02,426 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 06:51:02,426 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 06:51:02,426 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 06:51:02,427 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-10 06:51:02,427 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-10 06:51:02,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:51:02,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 06:51:02,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 06:51:02,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 06:51:02,427 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 06:51:02,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:51:02,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:51:02,427 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 06:51:02,427 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 06:51:02,429 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 06:51:02,507 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:51:02,509 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:51:02,842 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 06:51:02,843 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:51:03,091 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:51:03,091 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 06:51:03,091 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:51:03 BoogieIcfgContainer [2025-01-10 06:51:03,091 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:51:03,094 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:51:03,094 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:51:03,097 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:51:03,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:51:02" (1/3) ... [2025-01-10 06:51:03,098 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a0ded7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:51:03, skipping insertion in model container [2025-01-10 06:51:03,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:51:02" (2/3) ... [2025-01-10 06:51:03,099 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a0ded7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:51:03, skipping insertion in model container [2025-01-10 06:51:03,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:51:03" (3/3) ... [2025-01-10 06:51:03,100 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-word-trans.wvr.c [2025-01-10 06:51:03,109 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:51:03,110 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-word-trans.wvr.c that has 4 procedures, 75 locations, 1 initial locations, 6 loop locations, and 18 error locations. [2025-01-10 06:51:03,110 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 06:51:03,166 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-10 06:51:03,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 89 transitions, 199 flow [2025-01-10 06:51:03,227 INFO L124 PetriNetUnfolderBase]: 15/86 cut-off events. [2025-01-10 06:51:03,228 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-10 06:51:03,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 86 events. 15/86 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 260 event pairs, 0 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 66. Up to 3 conditions per place. [2025-01-10 06:51:03,234 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 89 transitions, 199 flow [2025-01-10 06:51:03,236 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 79 places, 84 transitions, 183 flow [2025-01-10 06:51:03,246 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:51:03,256 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;@1e9e52e2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:51:03,256 INFO L334 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2025-01-10 06:51:03,259 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:51:03,259 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-01-10 06:51:03,259 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:51:03,259 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:03,260 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 06:51:03,260 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2025-01-10 06:51:03,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:03,264 INFO L85 PathProgramCache]: Analyzing trace with hash 737308, now seen corresponding path program 1 times [2025-01-10 06:51:03,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:03,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320984476] [2025-01-10 06:51:03,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:03,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:03,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 06:51:03,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 06:51:03,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:03,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:03,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:51:03,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:03,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320984476] [2025-01-10 06:51:03,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320984476] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:03,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:03,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:51:03,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443798877] [2025-01-10 06:51:03,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:03,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:51:03,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:03,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:51:03,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:51:03,530 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 89 [2025-01-10 06:51:03,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 84 transitions, 183 flow. Second operand has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:51:03,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:03,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 89 [2025-01-10 06:51:03,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:04,140 INFO L124 PetriNetUnfolderBase]: 3619/6444 cut-off events. [2025-01-10 06:51:04,141 INFO L125 PetriNetUnfolderBase]: For 222/222 co-relation queries the response was YES. [2025-01-10 06:51:04,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11182 conditions, 6444 events. 3619/6444 cut-off events. For 222/222 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 44946 event pairs, 2208 based on Foata normal form. 3/4781 useless extension candidates. Maximal degree in co-relation 10537. Up to 4530 conditions per place. [2025-01-10 06:51:04,189 INFO L140 encePairwiseOnDemand]: 73/89 looper letters, 50 selfloop transitions, 10 changer transitions 0/93 dead transitions. [2025-01-10 06:51:04,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 93 transitions, 321 flow [2025-01-10 06:51:04,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:51:04,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:51:04,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 210 transitions. [2025-01-10 06:51:04,199 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5898876404494382 [2025-01-10 06:51:04,200 INFO L175 Difference]: Start difference. First operand has 79 places, 84 transitions, 183 flow. Second operand 4 states and 210 transitions. [2025-01-10 06:51:04,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 93 transitions, 321 flow [2025-01-10 06:51:04,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 93 transitions, 312 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-10 06:51:04,209 INFO L231 Difference]: Finished difference. Result has 80 places, 93 transitions, 262 flow [2025-01-10 06:51:04,211 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=262, PETRI_PLACES=80, PETRI_TRANSITIONS=93} [2025-01-10 06:51:04,213 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 1 predicate places. [2025-01-10 06:51:04,213 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 93 transitions, 262 flow [2025-01-10 06:51:04,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:51:04,214 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:04,214 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-01-10 06:51:04,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:51:04,214 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2025-01-10 06:51:04,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:04,215 INFO L85 PathProgramCache]: Analyzing trace with hash 491064598, now seen corresponding path program 1 times [2025-01-10 06:51:04,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:04,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245610673] [2025-01-10 06:51:04,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:04,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:04,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:51:04,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:51:04,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:04,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:04,372 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:51:04,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:04,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245610673] [2025-01-10 06:51:04,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245610673] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:51:04,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [21017709] [2025-01-10 06:51:04,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:04,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:51:04,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:51:04,376 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:51:04,377 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:51:04,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:51:04,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:51:04,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:04,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:04,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:51:04,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:51:04,488 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:51:04,488 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:51:04,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [21017709] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:04,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:51:04,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-01-10 06:51:04,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167961597] [2025-01-10 06:51:04,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:04,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:51:04,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:04,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:51:04,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:51:04,509 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 89 [2025-01-10 06:51:04,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 93 transitions, 262 flow. Second operand has 6 states, 6 states have (on average 36.833333333333336) internal successors, (221), 6 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:51:04,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:04,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 89 [2025-01-10 06:51:04,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:05,031 INFO L124 PetriNetUnfolderBase]: 3619/6441 cut-off events. [2025-01-10 06:51:05,032 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2025-01-10 06:51:05,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11136 conditions, 6441 events. 3619/6441 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 44925 event pairs, 2208 based on Foata normal form. 3/4783 useless extension candidates. Maximal degree in co-relation 11063. Up to 4515 conditions per place. [2025-01-10 06:51:05,076 INFO L140 encePairwiseOnDemand]: 76/89 looper letters, 40 selfloop transitions, 17 changer transitions 0/90 dead transitions. [2025-01-10 06:51:05,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 90 transitions, 364 flow [2025-01-10 06:51:05,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:51:05,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:51:05,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 276 transitions. [2025-01-10 06:51:05,080 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5168539325842697 [2025-01-10 06:51:05,080 INFO L175 Difference]: Start difference. First operand has 80 places, 93 transitions, 262 flow. Second operand 6 states and 276 transitions. [2025-01-10 06:51:05,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 90 transitions, 364 flow [2025-01-10 06:51:05,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 90 transitions, 364 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:51:05,084 INFO L231 Difference]: Finished difference. Result has 82 places, 90 transitions, 284 flow [2025-01-10 06:51:05,084 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=284, PETRI_PLACES=82, PETRI_TRANSITIONS=90} [2025-01-10 06:51:05,084 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 3 predicate places. [2025-01-10 06:51:05,085 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 90 transitions, 284 flow [2025-01-10 06:51:05,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 36.833333333333336) internal successors, (221), 6 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:51:05,085 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:05,085 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-01-10 06:51:05,094 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 06:51:05,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:51:05,286 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2025-01-10 06:51:05,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:05,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1956865882, now seen corresponding path program 1 times [2025-01-10 06:51:05,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:05,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142151840] [2025-01-10 06:51:05,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:05,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:05,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:51:05,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:51:05,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:05,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:05,389 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:51:05,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:05,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142151840] [2025-01-10 06:51:05,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142151840] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:51:05,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284656360] [2025-01-10 06:51:05,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:05,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:51:05,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:51:05,392 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:51:05,394 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:51:05,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:51:05,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:51:05,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:05,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:05,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:51:05,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:51:05,473 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:51:05,474 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:51:05,512 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:51:05,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284656360] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:51:05,512 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:51:05,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-01-10 06:51:05,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205834996] [2025-01-10 06:51:05,513 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:51:05,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 06:51:05,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:05,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 06:51:05,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-10 06:51:05,563 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 89 [2025-01-10 06:51:05,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 90 transitions, 284 flow. Second operand has 12 states, 12 states have (on average 37.083333333333336) internal successors, (445), 12 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:51:05,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:05,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 89 [2025-01-10 06:51:05,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:06,077 INFO L124 PetriNetUnfolderBase]: 3628/6477 cut-off events. [2025-01-10 06:51:06,077 INFO L125 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2025-01-10 06:51:06,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11277 conditions, 6477 events. 3628/6477 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 45307 event pairs, 2208 based on Foata normal form. 9/4825 useless extension candidates. Maximal degree in co-relation 11065. Up to 4530 conditions per place. [2025-01-10 06:51:06,113 INFO L140 encePairwiseOnDemand]: 76/89 looper letters, 47 selfloop transitions, 37 changer transitions 0/117 dead transitions. [2025-01-10 06:51:06,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 117 transitions, 626 flow [2025-01-10 06:51:06,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 06:51:06,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 06:51:06,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 453 transitions. [2025-01-10 06:51:06,116 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5089887640449439 [2025-01-10 06:51:06,116 INFO L175 Difference]: Start difference. First operand has 82 places, 90 transitions, 284 flow. Second operand 10 states and 453 transitions. [2025-01-10 06:51:06,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 117 transitions, 626 flow [2025-01-10 06:51:06,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 117 transitions, 543 flow, removed 16 selfloop flow, removed 5 redundant places. [2025-01-10 06:51:06,121 INFO L231 Difference]: Finished difference. Result has 89 places, 117 transitions, 499 flow [2025-01-10 06:51:06,121 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=499, PETRI_PLACES=89, PETRI_TRANSITIONS=117} [2025-01-10 06:51:06,122 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 10 predicate places. [2025-01-10 06:51:06,122 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 117 transitions, 499 flow [2025-01-10 06:51:06,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 37.083333333333336) internal successors, (445), 12 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:51:06,122 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:06,122 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:06,130 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:51:06,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:51:06,323 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2025-01-10 06:51:06,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:06,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1611609222, now seen corresponding path program 1 times [2025-01-10 06:51:06,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:06,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656272702] [2025-01-10 06:51:06,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:06,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:06,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:51:06,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:51:06,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:06,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:06,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:51:06,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:06,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656272702] [2025-01-10 06:51:06,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656272702] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:06,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:06,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:51:06,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55136995] [2025-01-10 06:51:06,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:06,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:51:06,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:06,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:51:06,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:51:06,416 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 89 [2025-01-10 06:51:06,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 117 transitions, 499 flow. Second operand has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:51:06,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:06,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 89 [2025-01-10 06:51:06,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:07,079 INFO L124 PetriNetUnfolderBase]: 6605/10634 cut-off events. [2025-01-10 06:51:07,079 INFO L125 PetriNetUnfolderBase]: For 166/166 co-relation queries the response was YES. [2025-01-10 06:51:07,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19461 conditions, 10634 events. 6605/10634 cut-off events. For 166/166 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 68488 event pairs, 3248 based on Foata normal form. 146/8256 useless extension candidates. Maximal degree in co-relation 19363. Up to 6583 conditions per place. [2025-01-10 06:51:07,134 INFO L140 encePairwiseOnDemand]: 83/89 looper letters, 131 selfloop transitions, 4 changer transitions 0/168 dead transitions. [2025-01-10 06:51:07,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 168 transitions, 877 flow [2025-01-10 06:51:07,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:51:07,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:51:07,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 257 transitions. [2025-01-10 06:51:07,135 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7219101123595506 [2025-01-10 06:51:07,135 INFO L175 Difference]: Start difference. First operand has 89 places, 117 transitions, 499 flow. Second operand 4 states and 257 transitions. [2025-01-10 06:51:07,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 168 transitions, 877 flow [2025-01-10 06:51:07,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 168 transitions, 840 flow, removed 9 selfloop flow, removed 2 redundant places. [2025-01-10 06:51:07,140 INFO L231 Difference]: Finished difference. Result has 92 places, 120 transitions, 491 flow [2025-01-10 06:51:07,140 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=491, PETRI_PLACES=92, PETRI_TRANSITIONS=120} [2025-01-10 06:51:07,141 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 13 predicate places. [2025-01-10 06:51:07,141 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 120 transitions, 491 flow [2025-01-10 06:51:07,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:51:07,141 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:07,141 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:07,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 06:51:07,141 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2025-01-10 06:51:07,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:07,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1579751711, now seen corresponding path program 1 times [2025-01-10 06:51:07,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:07,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432091915] [2025-01-10 06:51:07,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:07,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:07,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:51:07,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:51:07,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:07,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:07,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:51:07,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:07,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432091915] [2025-01-10 06:51:07,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432091915] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:07,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:07,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:51:07,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170970109] [2025-01-10 06:51:07,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:07,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:51:07,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:07,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:51:07,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:51:07,324 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 89 [2025-01-10 06:51:07,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 120 transitions, 491 flow. Second operand has 5 states, 5 states have (on average 41.6) internal successors, (208), 5 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:51:07,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:07,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 89 [2025-01-10 06:51:07,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:08,379 INFO L124 PetriNetUnfolderBase]: 12414/21860 cut-off events. [2025-01-10 06:51:08,379 INFO L125 PetriNetUnfolderBase]: For 2488/2504 co-relation queries the response was YES. [2025-01-10 06:51:08,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40170 conditions, 21860 events. 12414/21860 cut-off events. For 2488/2504 co-relation queries the response was YES. Maximal size of possible extension queue 1112. Compared 180350 event pairs, 7206 based on Foata normal form. 304/17174 useless extension candidates. Maximal degree in co-relation 40046. Up to 7814 conditions per place. [2025-01-10 06:51:08,521 INFO L140 encePairwiseOnDemand]: 81/89 looper letters, 127 selfloop transitions, 11 changer transitions 0/173 dead transitions. [2025-01-10 06:51:08,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 173 transitions, 956 flow [2025-01-10 06:51:08,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:51:08,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:51:08,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 333 transitions. [2025-01-10 06:51:08,523 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6235955056179775 [2025-01-10 06:51:08,523 INFO L175 Difference]: Start difference. First operand has 92 places, 120 transitions, 491 flow. Second operand 6 states and 333 transitions. [2025-01-10 06:51:08,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 173 transitions, 956 flow [2025-01-10 06:51:08,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 173 transitions, 951 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:51:08,532 INFO L231 Difference]: Finished difference. Result has 99 places, 123 transitions, 541 flow [2025-01-10 06:51:08,534 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=541, PETRI_PLACES=99, PETRI_TRANSITIONS=123} [2025-01-10 06:51:08,534 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 20 predicate places. [2025-01-10 06:51:08,535 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 123 transitions, 541 flow [2025-01-10 06:51:08,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.6) internal successors, (208), 5 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:51:08,536 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:08,536 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:08,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:51:08,536 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2025-01-10 06:51:08,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:08,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1184112462, now seen corresponding path program 1 times [2025-01-10 06:51:08,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:08,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922429438] [2025-01-10 06:51:08,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:08,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:08,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:51:08,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:51:08,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:08,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:08,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:51:08,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:08,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922429438] [2025-01-10 06:51:08,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922429438] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:08,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:08,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:51:08,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852424252] [2025-01-10 06:51:08,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:08,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:51:08,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:08,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:51:08,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:51:08,634 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 89 [2025-01-10 06:51:08,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 123 transitions, 541 flow. Second operand has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:51:08,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:08,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 89 [2025-01-10 06:51:08,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:10,111 INFO L124 PetriNetUnfolderBase]: 19844/31572 cut-off events. [2025-01-10 06:51:10,111 INFO L125 PetriNetUnfolderBase]: For 3717/4129 co-relation queries the response was YES. [2025-01-10 06:51:10,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61328 conditions, 31572 events. 19844/31572 cut-off events. For 3717/4129 co-relation queries the response was YES. Maximal size of possible extension queue 1109. Compared 232062 event pairs, 9872 based on Foata normal form. 448/26531 useless extension candidates. Maximal degree in co-relation 61201. Up to 19570 conditions per place. [2025-01-10 06:51:10,375 INFO L140 encePairwiseOnDemand]: 83/89 looper letters, 137 selfloop transitions, 4 changer transitions 0/176 dead transitions. [2025-01-10 06:51:10,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 176 transitions, 959 flow [2025-01-10 06:51:10,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:51:10,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:51:10,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 255 transitions. [2025-01-10 06:51:10,377 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7162921348314607 [2025-01-10 06:51:10,377 INFO L175 Difference]: Start difference. First operand has 99 places, 123 transitions, 541 flow. Second operand 4 states and 255 transitions. [2025-01-10 06:51:10,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 176 transitions, 959 flow [2025-01-10 06:51:10,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 176 transitions, 951 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-10 06:51:10,384 INFO L231 Difference]: Finished difference. Result has 103 places, 126 transitions, 562 flow [2025-01-10 06:51:10,384 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=533, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=562, PETRI_PLACES=103, PETRI_TRANSITIONS=126} [2025-01-10 06:51:10,386 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 24 predicate places. [2025-01-10 06:51:10,386 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 126 transitions, 562 flow [2025-01-10 06:51:10,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:51:10,387 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:10,387 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:10,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:51:10,387 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2025-01-10 06:51:10,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:10,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1727661977, now seen corresponding path program 1 times [2025-01-10 06:51:10,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:10,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815049369] [2025-01-10 06:51:10,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:10,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:10,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:51:10,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:51:10,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:10,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:10,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:51:10,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:10,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815049369] [2025-01-10 06:51:10,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815049369] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:10,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:10,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:51:10,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31453260] [2025-01-10 06:51:10,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:10,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:51:10,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:10,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:51:10,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:51:10,511 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 89 [2025-01-10 06:51:10,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 126 transitions, 562 flow. Second operand has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:51:10,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:10,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 89 [2025-01-10 06:51:10,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:13,888 INFO L124 PetriNetUnfolderBase]: 35308/63632 cut-off events. [2025-01-10 06:51:13,889 INFO L125 PetriNetUnfolderBase]: For 18485/18663 co-relation queries the response was YES. [2025-01-10 06:51:14,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125921 conditions, 63632 events. 35308/63632 cut-off events. For 18485/18663 co-relation queries the response was YES. Maximal size of possible extension queue 2501. Compared 609653 event pairs, 20812 based on Foata normal form. 856/55092 useless extension candidates. Maximal degree in co-relation 125706. Up to 21617 conditions per place. [2025-01-10 06:51:14,308 INFO L140 encePairwiseOnDemand]: 81/89 looper letters, 156 selfloop transitions, 7 changer transitions 0/199 dead transitions. [2025-01-10 06:51:14,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 199 transitions, 1224 flow [2025-01-10 06:51:14,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:51:14,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:51:14,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 299 transitions. [2025-01-10 06:51:14,310 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6719101123595506 [2025-01-10 06:51:14,310 INFO L175 Difference]: Start difference. First operand has 103 places, 126 transitions, 562 flow. Second operand 5 states and 299 transitions. [2025-01-10 06:51:14,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 199 transitions, 1224 flow [2025-01-10 06:51:14,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 199 transitions, 1219 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:51:14,353 INFO L231 Difference]: Finished difference. Result has 109 places, 130 transitions, 630 flow [2025-01-10 06:51:14,353 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=559, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=630, PETRI_PLACES=109, PETRI_TRANSITIONS=130} [2025-01-10 06:51:14,353 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 30 predicate places. [2025-01-10 06:51:14,353 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 130 transitions, 630 flow [2025-01-10 06:51:14,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:51:14,354 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:14,354 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:14,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 06:51:14,354 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2025-01-10 06:51:14,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:14,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1947249364, now seen corresponding path program 1 times [2025-01-10 06:51:14,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:14,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806112855] [2025-01-10 06:51:14,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:14,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:14,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:51:14,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:51:14,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:14,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:14,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:51:14,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:14,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806112855] [2025-01-10 06:51:14,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806112855] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:14,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:14,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:51:14,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147660177] [2025-01-10 06:51:14,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:14,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:51:14,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:14,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:51:14,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:51:14,462 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 89 [2025-01-10 06:51:14,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 130 transitions, 630 flow. Second operand has 5 states, 5 states have (on average 42.0) internal successors, (210), 5 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:51:14,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:14,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 89 [2025-01-10 06:51:14,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:21,020 INFO L124 PetriNetUnfolderBase]: 74500/131096 cut-off events. [2025-01-10 06:51:21,020 INFO L125 PetriNetUnfolderBase]: For 23452/23812 co-relation queries the response was YES. [2025-01-10 06:51:21,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 253289 conditions, 131096 events. 74500/131096 cut-off events. For 23452/23812 co-relation queries the response was YES. Maximal size of possible extension queue 5177. Compared 1341317 event pairs, 43464 based on Foata normal form. 1584/110065 useless extension candidates. Maximal degree in co-relation 253072. Up to 46472 conditions per place. [2025-01-10 06:51:21,972 INFO L140 encePairwiseOnDemand]: 83/89 looper letters, 115 selfloop transitions, 17 changer transitions 0/170 dead transitions. [2025-01-10 06:51:21,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 170 transitions, 1004 flow [2025-01-10 06:51:21,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:51:21,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:51:21,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 287 transitions. [2025-01-10 06:51:21,974 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6449438202247191 [2025-01-10 06:51:21,974 INFO L175 Difference]: Start difference. First operand has 109 places, 130 transitions, 630 flow. Second operand 5 states and 287 transitions. [2025-01-10 06:51:21,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 170 transitions, 1004 flow [2025-01-10 06:51:22,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 170 transitions, 1002 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-01-10 06:51:22,072 INFO L231 Difference]: Finished difference. Result has 115 places, 131 transitions, 686 flow [2025-01-10 06:51:22,072 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=628, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=686, PETRI_PLACES=115, PETRI_TRANSITIONS=131} [2025-01-10 06:51:22,073 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 36 predicate places. [2025-01-10 06:51:22,073 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 131 transitions, 686 flow [2025-01-10 06:51:22,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.0) internal successors, (210), 5 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:51:22,073 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:22,073 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:22,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 06:51:22,073 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2025-01-10 06:51:22,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:22,074 INFO L85 PathProgramCache]: Analyzing trace with hash 2123904540, now seen corresponding path program 1 times [2025-01-10 06:51:22,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:22,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655283479] [2025-01-10 06:51:22,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:22,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:22,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:51:22,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:51:22,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:22,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:22,368 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:51:22,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:22,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655283479] [2025-01-10 06:51:22,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655283479] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:51:22,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971180033] [2025-01-10 06:51:22,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:22,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:51:22,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:51:22,370 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:51:22,373 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:51:22,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:51:22,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:51:22,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:22,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:22,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:51:22,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:51:22,511 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:51:22,511 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:51:22,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1971180033] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:22,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:51:22,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [5] total 6 [2025-01-10 06:51:22,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547283206] [2025-01-10 06:51:22,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:22,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:51:22,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:22,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:51:22,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:51:22,527 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 89 [2025-01-10 06:51:22,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 131 transitions, 686 flow. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:51:22,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:22,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 89 [2025-01-10 06:51:22,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:28,902 INFO L124 PetriNetUnfolderBase]: 65028/118644 cut-off events. [2025-01-10 06:51:28,902 INFO L125 PetriNetUnfolderBase]: For 32774/32934 co-relation queries the response was YES. [2025-01-10 06:51:29,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 229904 conditions, 118644 events. 65028/118644 cut-off events. For 32774/32934 co-relation queries the response was YES. Maximal size of possible extension queue 4445. Compared 1239936 event pairs, 39960 based on Foata normal form. 1960/103408 useless extension candidates. Maximal degree in co-relation 229679. Up to 79658 conditions per place. [2025-01-10 06:51:29,985 INFO L140 encePairwiseOnDemand]: 87/89 looper letters, 89 selfloop transitions, 1 changer transitions 0/129 dead transitions. [2025-01-10 06:51:29,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 129 transitions, 852 flow [2025-01-10 06:51:29,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:51:29,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:51:29,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 169 transitions. [2025-01-10 06:51:29,987 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6329588014981273 [2025-01-10 06:51:29,987 INFO L175 Difference]: Start difference. First operand has 115 places, 131 transitions, 686 flow. Second operand 3 states and 169 transitions. [2025-01-10 06:51:29,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 129 transitions, 852 flow [2025-01-10 06:51:30,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 129 transitions, 820 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-10 06:51:30,086 INFO L231 Difference]: Finished difference. Result has 111 places, 129 transitions, 642 flow [2025-01-10 06:51:30,086 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=640, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=642, PETRI_PLACES=111, PETRI_TRANSITIONS=129} [2025-01-10 06:51:30,087 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 32 predicate places. [2025-01-10 06:51:30,087 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 129 transitions, 642 flow [2025-01-10 06:51:30,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:51:30,087 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:30,087 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:30,093 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 06:51:30,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:51:30,288 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2025-01-10 06:51:30,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:30,289 INFO L85 PathProgramCache]: Analyzing trace with hash -235187313, now seen corresponding path program 1 times [2025-01-10 06:51:30,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:30,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196394330] [2025-01-10 06:51:30,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:30,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:30,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:51:30,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:51:30,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:30,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:30,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:51:30,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:30,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196394330] [2025-01-10 06:51:30,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196394330] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:30,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:30,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:51:30,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396859412] [2025-01-10 06:51:30,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:30,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:51:30,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:30,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:51:30,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:51:30,419 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 89 [2025-01-10 06:51:30,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 129 transitions, 642 flow. Second operand has 5 states, 5 states have (on average 42.0) internal successors, (210), 5 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:51:30,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:30,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 89 [2025-01-10 06:51:30,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:37,300 INFO L124 PetriNetUnfolderBase]: 71357/126981 cut-off events. [2025-01-10 06:51:37,300 INFO L125 PetriNetUnfolderBase]: For 33733/33977 co-relation queries the response was YES. [2025-01-10 06:51:37,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 250653 conditions, 126981 events. 71357/126981 cut-off events. For 33733/33977 co-relation queries the response was YES. Maximal size of possible extension queue 4978. Compared 1308140 event pairs, 42190 based on Foata normal form. 1048/109009 useless extension candidates. Maximal degree in co-relation 250629. Up to 44286 conditions per place. [2025-01-10 06:51:38,240 INFO L140 encePairwiseOnDemand]: 82/89 looper letters, 129 selfloop transitions, 17 changer transitions 0/182 dead transitions. [2025-01-10 06:51:38,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 182 transitions, 1127 flow [2025-01-10 06:51:38,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:51:38,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:51:38,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 333 transitions. [2025-01-10 06:51:38,241 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6235955056179775 [2025-01-10 06:51:38,241 INFO L175 Difference]: Start difference. First operand has 111 places, 129 transitions, 642 flow. Second operand 6 states and 333 transitions. [2025-01-10 06:51:38,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 182 transitions, 1127 flow [2025-01-10 06:51:38,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 182 transitions, 1126 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:51:38,345 INFO L231 Difference]: Finished difference. Result has 118 places, 134 transitions, 734 flow [2025-01-10 06:51:38,345 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=641, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=734, PETRI_PLACES=118, PETRI_TRANSITIONS=134} [2025-01-10 06:51:38,345 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 39 predicate places. [2025-01-10 06:51:38,345 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 134 transitions, 734 flow [2025-01-10 06:51:38,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.0) internal successors, (210), 5 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:51:38,346 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:38,346 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:38,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 06:51:38,346 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2025-01-10 06:51:38,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:38,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1868577902, now seen corresponding path program 1 times [2025-01-10 06:51:38,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:38,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356808289] [2025-01-10 06:51:38,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:38,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:38,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:51:38,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:51:38,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:38,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:38,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:51:38,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:38,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356808289] [2025-01-10 06:51:38,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356808289] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:38,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:38,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:51:38,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586685521] [2025-01-10 06:51:38,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:38,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:51:38,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:38,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:51:38,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:51:38,399 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 89 [2025-01-10 06:51:38,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 134 transitions, 734 flow. Second operand has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:51:38,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:38,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 89 [2025-01-10 06:51:38,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand