./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/chl-array-int-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-array-int-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 5bb11505151393f96d52a572beff0352326876d897656a8082ae272a8f39e0b4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 14:07:33,456 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 14:07:33,491 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-08 14:07:33,494 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 14:07:33,495 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 14:07:33,508 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 14:07:33,509 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 14:07:33,509 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 14:07:33,509 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 14:07:33,509 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 14:07:33,509 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 14:07:33,509 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 14:07:33,509 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 14:07:33,509 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 14:07:33,509 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 14:07:33,509 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 14:07:33,510 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 14:07:33,510 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 14:07:33,510 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 14:07:33,510 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 14:07:33,510 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 14:07:33,510 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 14:07:33,510 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 14:07:33,510 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 14:07:33,510 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 14:07:33,510 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 14:07:33,510 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 14:07:33,510 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 14:07:33,510 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 14:07:33,510 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 14:07:33,510 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 14:07:33,510 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 14:07:33,510 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 14:07:33,510 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 14:07:33,511 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 14:07:33,511 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 14:07:33,511 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 14:07:33,511 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 14:07:33,511 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 14:07:33,511 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 14:07:33,511 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 14:07:33,511 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 14:07:33,511 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 14:07:33,511 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 14:07:33,511 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 14:07:33,511 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 -> 5bb11505151393f96d52a572beff0352326876d897656a8082ae272a8f39e0b4 [2025-02-08 14:07:33,743 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 14:07:33,752 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 14:07:33,754 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 14:07:33,755 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 14:07:33,755 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 14:07:33,756 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-array-int-trans.wvr.c [2025-02-08 14:07:35,047 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/98a949aaf/b9e352a81c72419b886b2c0427f4f7cd/FLAGc2317837b [2025-02-08 14:07:35,239 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 14:07:35,240 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-array-int-trans.wvr.c [2025-02-08 14:07:35,248 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/98a949aaf/b9e352a81c72419b886b2c0427f4f7cd/FLAGc2317837b [2025-02-08 14:07:35,277 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/98a949aaf/b9e352a81c72419b886b2c0427f4f7cd [2025-02-08 14:07:35,287 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 14:07:35,289 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 14:07:35,289 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 14:07:35,290 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 14:07:35,294 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 14:07:35,297 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:07:35" (1/1) ... [2025-02-08 14:07:35,299 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@649a78e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:07:35, skipping insertion in model container [2025-02-08 14:07:35,299 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:07:35" (1/1) ... [2025-02-08 14:07:35,314 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 14:07:35,463 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:07:35,472 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 14:07:35,499 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:07:35,517 INFO L204 MainTranslator]: Completed translation [2025-02-08 14:07:35,519 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:07:35 WrapperNode [2025-02-08 14:07:35,519 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 14:07:35,520 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 14:07:35,520 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 14:07:35,520 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 14:07:35,525 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:07:35" (1/1) ... [2025-02-08 14:07:35,533 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:07:35" (1/1) ... [2025-02-08 14:07:35,561 INFO L138 Inliner]: procedures = 25, calls = 35, calls flagged for inlining = 14, calls inlined = 22, statements flattened = 314 [2025-02-08 14:07:35,562 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 14:07:35,562 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 14:07:35,562 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 14:07:35,563 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 14:07:35,571 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:07:35" (1/1) ... [2025-02-08 14:07:35,572 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:07:35" (1/1) ... [2025-02-08 14:07:35,574 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:07:35" (1/1) ... [2025-02-08 14:07:35,591 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-02-08 14:07:35,591 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:07:35" (1/1) ... [2025-02-08 14:07:35,591 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:07:35" (1/1) ... [2025-02-08 14:07:35,597 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:07:35" (1/1) ... [2025-02-08 14:07:35,598 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:07:35" (1/1) ... [2025-02-08 14:07:35,599 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:07:35" (1/1) ... [2025-02-08 14:07:35,600 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:07:35" (1/1) ... [2025-02-08 14:07:35,602 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 14:07:35,603 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 14:07:35,603 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 14:07:35,603 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 14:07:35,604 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:07:35" (1/1) ... [2025-02-08 14:07:35,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 14:07:35,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:07:35,632 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 14:07:35,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 14:07:35,658 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 14:07:35,658 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 14:07:35,658 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 14:07:35,658 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 14:07:35,659 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 14:07:35,659 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 14:07:35,659 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 14:07:35,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 14:07:35,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 14:07:35,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 14:07:35,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 14:07:35,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 14:07:35,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 14:07:35,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 14:07:35,659 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 14:07:35,659 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 14:07:35,660 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 14:07:35,734 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 14:07:35,735 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 14:07:35,841 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52: havoc #t~ret5#1; [2025-02-08 14:07:35,841 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-1: havoc #t~mem4#1; [2025-02-08 14:07:35,841 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-2: havoc #t~mem3#1; [2025-02-08 14:07:35,842 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-3: ~res1~0 := #t~ret5#1; [2025-02-08 14:07:35,842 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-4: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647; [2025-02-08 14:07:35,842 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-5: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 14:07:35,842 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-6: havoc minus_#t~short34#1, minus_#t~short35#1, minus_~a#1, minus_~b#1; [2025-02-08 14:07:35,842 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-7: #t~ret5#1 := minus_#res#1; [2025-02-08 14:07:35,904 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66: havoc #t~ret11#1; [2025-02-08 14:07:35,904 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-1: havoc #t~mem10#1; [2025-02-08 14:07:35,904 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-2: havoc #t~mem9#1; [2025-02-08 14:07:35,904 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-3: ~res2~0 := #t~ret11#1; [2025-02-08 14:07:35,904 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-4: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret11#1 && #t~ret11#1 <= 2147483647; [2025-02-08 14:07:35,904 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-5: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 14:07:35,904 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-6: havoc minus_#t~short34#1, minus_#t~short35#1, minus_~a#1, minus_~b#1; [2025-02-08 14:07:35,904 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-7: #t~ret11#1 := minus_#res#1; [2025-02-08 14:07:35,962 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L80: havoc #t~ret17#1; [2025-02-08 14:07:35,962 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L80-1: havoc #t~mem16#1; [2025-02-08 14:07:35,962 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L80-2: havoc #t~mem15#1; [2025-02-08 14:07:35,962 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L80-3: ~res3~0 := #t~ret17#1; [2025-02-08 14:07:35,962 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L80-4: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret17#1 && #t~ret17#1 <= 2147483647; [2025-02-08 14:07:35,962 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L80-5: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 14:07:35,962 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L80-6: havoc minus_#t~short34#1, minus_#t~short35#1, minus_~a#1, minus_~b#1; [2025-02-08 14:07:35,962 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L80-7: #t~ret17#1 := minus_#res#1; [2025-02-08 14:07:36,081 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 14:07:36,081 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 14:07:36,290 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 14:07:36,292 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 14:07:36,292 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:07:36 BoogieIcfgContainer [2025-02-08 14:07:36,292 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 14:07:36,294 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 14:07:36,295 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 14:07:36,298 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 14:07:36,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 02:07:35" (1/3) ... [2025-02-08 14:07:36,299 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@419c2ce1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 02:07:36, skipping insertion in model container [2025-02-08 14:07:36,299 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:07:35" (2/3) ... [2025-02-08 14:07:36,299 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@419c2ce1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 02:07:36, skipping insertion in model container [2025-02-08 14:07:36,299 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:07:36" (3/3) ... [2025-02-08 14:07:36,300 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-array-int-trans.wvr.c [2025-02-08 14:07:36,312 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 14:07:36,313 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-array-int-trans.wvr.c that has 4 procedures, 114 locations, 1 initial locations, 6 loop locations, and 36 error locations. [2025-02-08 14:07:36,313 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 14:07:36,382 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 14:07:36,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 125 transitions, 271 flow [2025-02-08 14:07:36,450 INFO L124 PetriNetUnfolderBase]: 12/122 cut-off events. [2025-02-08 14:07:36,452 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 14:07:36,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135 conditions, 122 events. 12/122 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 511 event pairs, 0 based on Foata normal form. 0/71 useless extension candidates. Maximal degree in co-relation 102. Up to 2 conditions per place. [2025-02-08 14:07:36,459 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 125 transitions, 271 flow [2025-02-08 14:07:36,464 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 120 transitions, 255 flow [2025-02-08 14:07:36,470 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 14:07:36,481 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;@6b832d0e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 14:07:36,482 INFO L334 AbstractCegarLoop]: Starting to check reachability of 69 error locations. [2025-02-08 14:07:36,485 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 14:07:36,485 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-02-08 14:07:36,485 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 14:07:36,485 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:07:36,485 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 14:07:36,486 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 66 more)] === [2025-02-08 14:07:36,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:07:36,489 INFO L85 PathProgramCache]: Analyzing trace with hash 873497, now seen corresponding path program 1 times [2025-02-08 14:07:36,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:07:36,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397700047] [2025-02-08 14:07:36,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:07:36,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:07:36,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:07:36,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:07:36,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:07:36,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:07:36,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:07:36,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:07:36,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397700047] [2025-02-08 14:07:36,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397700047] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:07:36,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:07:36,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:07:36,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66746341] [2025-02-08 14:07:36,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:07:36,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:07:36,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:07:36,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:07:36,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:07:36,706 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 125 [2025-02-08 14:07:36,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 120 transitions, 255 flow. Second operand has 4 states, 4 states have (on average 63.75) internal successors, (255), 4 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:07:36,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:07:36,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 125 [2025-02-08 14:07:36,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:07:38,305 INFO L124 PetriNetUnfolderBase]: 9328/18514 cut-off events. [2025-02-08 14:07:38,305 INFO L125 PetriNetUnfolderBase]: For 458/458 co-relation queries the response was YES. [2025-02-08 14:07:38,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31423 conditions, 18514 events. 9328/18514 cut-off events. For 458/458 co-relation queries the response was YES. Maximal size of possible extension queue 876. Compared 171082 event pairs, 6776 based on Foata normal form. 3/14128 useless extension candidates. Maximal degree in co-relation 30307. Up to 12517 conditions per place. [2025-02-08 14:07:38,486 INFO L140 encePairwiseOnDemand]: 114/125 looper letters, 49 selfloop transitions, 8 changer transitions 0/117 dead transitions. [2025-02-08 14:07:38,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 117 transitions, 363 flow [2025-02-08 14:07:38,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:07:38,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:07:38,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 312 transitions. [2025-02-08 14:07:38,499 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.624 [2025-02-08 14:07:38,500 INFO L175 Difference]: Start difference. First operand has 118 places, 120 transitions, 255 flow. Second operand 4 states and 312 transitions. [2025-02-08 14:07:38,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 117 transitions, 363 flow [2025-02-08 14:07:38,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 117 transitions, 354 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 14:07:38,508 INFO L231 Difference]: Finished difference. Result has 113 places, 117 transitions, 256 flow [2025-02-08 14:07:38,510 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=256, PETRI_PLACES=113, PETRI_TRANSITIONS=117} [2025-02-08 14:07:38,512 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, -5 predicate places. [2025-02-08 14:07:38,512 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 117 transitions, 256 flow [2025-02-08 14:07:38,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.75) internal successors, (255), 4 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:07:38,513 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:07:38,513 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-08 14:07:38,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 14:07:38,513 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 66 more)] === [2025-02-08 14:07:38,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:07:38,514 INFO L85 PathProgramCache]: Analyzing trace with hash 27079161, now seen corresponding path program 1 times [2025-02-08 14:07:38,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:07:38,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49742719] [2025-02-08 14:07:38,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:07:38,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:07:38,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:07:38,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:07:38,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:07:38,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:07:38,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:07:38,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:07:38,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49742719] [2025-02-08 14:07:38,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49742719] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:07:38,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:07:38,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:07:38,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311802368] [2025-02-08 14:07:38,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:07:38,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:07:38,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:07:38,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:07:38,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:07:38,615 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 125 [2025-02-08 14:07:38,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 117 transitions, 256 flow. Second operand has 4 states, 4 states have (on average 63.75) internal successors, (255), 4 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:07:38,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:07:38,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 125 [2025-02-08 14:07:38,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:07:39,702 INFO L124 PetriNetUnfolderBase]: 9331/18526 cut-off events. [2025-02-08 14:07:39,702 INFO L125 PetriNetUnfolderBase]: For 113/113 co-relation queries the response was YES. [2025-02-08 14:07:39,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31320 conditions, 18526 events. 9331/18526 cut-off events. For 113/113 co-relation queries the response was YES. Maximal size of possible extension queue 876. Compared 170987 event pairs, 6776 based on Foata normal form. 3/14144 useless extension candidates. Maximal degree in co-relation 31252. Up to 12530 conditions per place. [2025-02-08 14:07:39,852 INFO L140 encePairwiseOnDemand]: 112/125 looper letters, 56 selfloop transitions, 10 changer transitions 0/126 dead transitions. [2025-02-08 14:07:39,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 126 transitions, 420 flow [2025-02-08 14:07:39,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:07:39,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:07:39,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 321 transitions. [2025-02-08 14:07:39,854 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.642 [2025-02-08 14:07:39,854 INFO L175 Difference]: Start difference. First operand has 113 places, 117 transitions, 256 flow. Second operand 4 states and 321 transitions. [2025-02-08 14:07:39,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 126 transitions, 420 flow [2025-02-08 14:07:39,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 126 transitions, 390 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 14:07:39,858 INFO L231 Difference]: Finished difference. Result has 116 places, 126 transitions, 322 flow [2025-02-08 14:07:39,858 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=322, PETRI_PLACES=116, PETRI_TRANSITIONS=126} [2025-02-08 14:07:39,859 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, -2 predicate places. [2025-02-08 14:07:39,859 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 126 transitions, 322 flow [2025-02-08 14:07:39,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.75) internal successors, (255), 4 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:07:39,859 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:07:39,859 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-02-08 14:07:39,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 14:07:39,859 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 66 more)] === [2025-02-08 14:07:39,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:07:39,860 INFO L85 PathProgramCache]: Analyzing trace with hash -737733007, now seen corresponding path program 1 times [2025-02-08 14:07:39,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:07:39,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192044593] [2025-02-08 14:07:39,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:07:39,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:07:39,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:07:39,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:07:39,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:07:39,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:07:39,918 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:07:39,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:07:39,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192044593] [2025-02-08 14:07:39,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192044593] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:07:39,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1443790820] [2025-02-08 14:07:39,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:07:39,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:07:39,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:07:39,920 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:07:39,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 14:07:39,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:07:39,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:07:39,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:07:39,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:07:39,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 14:07:39,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:07:40,004 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:07:40,004 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:07:40,036 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:07:40,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1443790820] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:07:40,037 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:07:40,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-02-08 14:07:40,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712258551] [2025-02-08 14:07:40,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:07:40,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 14:07:40,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:07:40,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 14:07:40,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-02-08 14:07:40,065 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 125 [2025-02-08 14:07:40,066 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 126 transitions, 322 flow. Second operand has 10 states, 10 states have (on average 64.0) internal successors, (640), 10 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:07:40,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:07:40,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 125 [2025-02-08 14:07:40,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:07:41,578 INFO L124 PetriNetUnfolderBase]: 9340/18562 cut-off events. [2025-02-08 14:07:41,578 INFO L125 PetriNetUnfolderBase]: For 136/136 co-relation queries the response was YES. [2025-02-08 14:07:41,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31435 conditions, 18562 events. 9340/18562 cut-off events. For 136/136 co-relation queries the response was YES. Maximal size of possible extension queue 876. Compared 171340 event pairs, 6776 based on Foata normal form. 0/14172 useless extension candidates. Maximal degree in co-relation 31266. Up to 12533 conditions per place. [2025-02-08 14:07:41,692 INFO L140 encePairwiseOnDemand]: 112/125 looper letters, 56 selfloop transitions, 37 changer transitions 0/153 dead transitions. [2025-02-08 14:07:41,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 153 transitions, 628 flow [2025-02-08 14:07:41,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 14:07:41,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 14:07:41,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 732 transitions. [2025-02-08 14:07:41,695 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5856 [2025-02-08 14:07:41,695 INFO L175 Difference]: Start difference. First operand has 116 places, 126 transitions, 322 flow. Second operand 10 states and 732 transitions. [2025-02-08 14:07:41,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 153 transitions, 628 flow [2025-02-08 14:07:41,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 153 transitions, 628 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 14:07:41,698 INFO L231 Difference]: Finished difference. Result has 128 places, 153 transitions, 566 flow [2025-02-08 14:07:41,698 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=566, PETRI_PLACES=128, PETRI_TRANSITIONS=153} [2025-02-08 14:07:41,699 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 10 predicate places. [2025-02-08 14:07:41,699 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 153 transitions, 566 flow [2025-02-08 14:07:41,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 64.0) internal successors, (640), 10 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:07:41,700 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:07:41,700 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:07:41,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 14:07:41,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:07:41,904 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 66 more)] === [2025-02-08 14:07:41,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:07:41,905 INFO L85 PathProgramCache]: Analyzing trace with hash -719686806, now seen corresponding path program 1 times [2025-02-08 14:07:41,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:07:41,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817606132] [2025-02-08 14:07:41,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:07:41,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:07:41,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:07:41,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:07:41,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:07:41,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:07:42,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:07:42,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:07:42,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817606132] [2025-02-08 14:07:42,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817606132] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:07:42,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:07:42,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:07:42,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689253620] [2025-02-08 14:07:42,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:07:42,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 14:07:42,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:07:42,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 14:07:42,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 14:07:42,127 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 125 [2025-02-08 14:07:42,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 153 transitions, 566 flow. Second operand has 5 states, 5 states have (on average 68.4) internal successors, (342), 5 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:07:42,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:07:42,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 125 [2025-02-08 14:07:42,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:07:45,586 INFO L124 PetriNetUnfolderBase]: 20319/40281 cut-off events. [2025-02-08 14:07:45,587 INFO L125 PetriNetUnfolderBase]: For 335/335 co-relation queries the response was YES. [2025-02-08 14:07:45,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68218 conditions, 40281 events. 20319/40281 cut-off events. For 335/335 co-relation queries the response was YES. Maximal size of possible extension queue 1837. Compared 413553 event pairs, 14676 based on Foata normal form. 250/30964 useless extension candidates. Maximal degree in co-relation 68095. Up to 13729 conditions per place. [2025-02-08 14:07:45,863 INFO L140 encePairwiseOnDemand]: 117/125 looper letters, 141 selfloop transitions, 11 changer transitions 0/213 dead transitions. [2025-02-08 14:07:45,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 213 transitions, 1068 flow [2025-02-08 14:07:45,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:07:45,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 14:07:45,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 513 transitions. [2025-02-08 14:07:45,869 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.684 [2025-02-08 14:07:45,869 INFO L175 Difference]: Start difference. First operand has 128 places, 153 transitions, 566 flow. Second operand 6 states and 513 transitions. [2025-02-08 14:07:45,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 213 transitions, 1068 flow [2025-02-08 14:07:45,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 213 transitions, 943 flow, removed 36 selfloop flow, removed 4 redundant places. [2025-02-08 14:07:45,878 INFO L231 Difference]: Finished difference. Result has 132 places, 156 transitions, 523 flow [2025-02-08 14:07:45,880 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=471, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=523, PETRI_PLACES=132, PETRI_TRANSITIONS=156} [2025-02-08 14:07:45,880 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 14 predicate places. [2025-02-08 14:07:45,880 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 156 transitions, 523 flow [2025-02-08 14:07:45,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 68.4) internal successors, (342), 5 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:07:45,881 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:07:45,881 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:07:45,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 14:07:45,881 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 66 more)] === [2025-02-08 14:07:45,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:07:45,881 INFO L85 PathProgramCache]: Analyzing trace with hash -835453673, now seen corresponding path program 1 times [2025-02-08 14:07:45,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:07:45,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703703350] [2025-02-08 14:07:45,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:07:45,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:07:45,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:07:45,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:07:45,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:07:45,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:07:46,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:07:46,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:07:46,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703703350] [2025-02-08 14:07:46,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703703350] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:07:46,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:07:46,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:07:46,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919302034] [2025-02-08 14:07:46,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:07:46,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:07:46,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:07:46,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:07:46,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:07:46,025 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 125 [2025-02-08 14:07:46,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 156 transitions, 523 flow. Second operand has 4 states, 4 states have (on average 68.75) internal successors, (275), 4 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:07:46,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:07:46,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 125 [2025-02-08 14:07:46,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:07:50,541 INFO L124 PetriNetUnfolderBase]: 39232/77580 cut-off events. [2025-02-08 14:07:50,541 INFO L125 PetriNetUnfolderBase]: For 3070/3070 co-relation queries the response was YES. [2025-02-08 14:07:50,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132609 conditions, 77580 events. 39232/77580 cut-off events. For 3070/3070 co-relation queries the response was YES. Maximal size of possible extension queue 3288. Compared 862139 event pairs, 28228 based on Foata normal form. 498/60589 useless extension candidates. Maximal degree in co-relation 132427. Up to 26289 conditions per place. [2025-02-08 14:07:51,122 INFO L140 encePairwiseOnDemand]: 120/125 looper letters, 168 selfloop transitions, 4 changer transitions 0/233 dead transitions. [2025-02-08 14:07:51,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 233 transitions, 1141 flow [2025-02-08 14:07:51,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:07:51,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:07:51,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 379 transitions. [2025-02-08 14:07:51,124 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.758 [2025-02-08 14:07:51,124 INFO L175 Difference]: Start difference. First operand has 132 places, 156 transitions, 523 flow. Second operand 4 states and 379 transitions. [2025-02-08 14:07:51,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 233 transitions, 1141 flow [2025-02-08 14:07:51,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 233 transitions, 1131 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-02-08 14:07:51,132 INFO L231 Difference]: Finished difference. Result has 136 places, 157 transitions, 538 flow [2025-02-08 14:07:51,133 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=515, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=538, PETRI_PLACES=136, PETRI_TRANSITIONS=157} [2025-02-08 14:07:51,134 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 18 predicate places. [2025-02-08 14:07:51,135 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 157 transitions, 538 flow [2025-02-08 14:07:51,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 68.75) internal successors, (275), 4 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:07:51,136 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:07:51,136 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:07:51,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 14:07:51,136 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 66 more)] === [2025-02-08 14:07:51,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:07:51,137 INFO L85 PathProgramCache]: Analyzing trace with hash -130565285, now seen corresponding path program 1 times [2025-02-08 14:07:51,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:07:51,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860231466] [2025-02-08 14:07:51,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:07:51,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:07:51,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 14:07:51,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 14:07:51,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:07:51,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:07:51,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:07:51,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:07:51,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860231466] [2025-02-08 14:07:51,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860231466] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:07:51,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:07:51,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 14:07:51,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645001119] [2025-02-08 14:07:51,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:07:51,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 14:07:51,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:07:51,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 14:07:51,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 14:07:51,262 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 125 [2025-02-08 14:07:51,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 157 transitions, 538 flow. Second operand has 5 states, 5 states have (on average 68.8) internal successors, (344), 5 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:07:51,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:07:51,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 125 [2025-02-08 14:07:51,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:08:00,022 INFO L124 PetriNetUnfolderBase]: 81808/160836 cut-off events. [2025-02-08 14:08:00,022 INFO L125 PetriNetUnfolderBase]: For 1083/1083 co-relation queries the response was YES. [2025-02-08 14:08:00,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 272740 conditions, 160836 events. 81808/160836 cut-off events. For 1083/1083 co-relation queries the response was YES. Maximal size of possible extension queue 6655. Compared 1937358 event pairs, 59128 based on Foata normal form. 1096/123793 useless extension candidates. Maximal degree in co-relation 272556. Up to 55296 conditions per place. [2025-02-08 14:08:01,051 INFO L140 encePairwiseOnDemand]: 119/125 looper letters, 124 selfloop transitions, 15 changer transitions 0/202 dead transitions. [2025-02-08 14:08:01,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 202 transitions, 912 flow [2025-02-08 14:08:01,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 14:08:01,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 14:08:01,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 440 transitions. [2025-02-08 14:08:01,054 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.704 [2025-02-08 14:08:01,054 INFO L175 Difference]: Start difference. First operand has 136 places, 157 transitions, 538 flow. Second operand 5 states and 440 transitions. [2025-02-08 14:08:01,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 202 transitions, 912 flow [2025-02-08 14:08:01,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 202 transitions, 910 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-02-08 14:08:01,058 INFO L231 Difference]: Finished difference. Result has 142 places, 158 transitions, 588 flow [2025-02-08 14:08:01,058 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=588, PETRI_PLACES=142, PETRI_TRANSITIONS=158} [2025-02-08 14:08:01,058 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 24 predicate places. [2025-02-08 14:08:01,058 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 158 transitions, 588 flow [2025-02-08 14:08:01,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 68.8) internal successors, (344), 5 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:08:01,059 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:08:01,059 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:08:01,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 14:08:01,059 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 66 more)] === [2025-02-08 14:08:01,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:08:01,059 INFO L85 PathProgramCache]: Analyzing trace with hash 247444325, now seen corresponding path program 1 times [2025-02-08 14:08:01,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:08:01,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332200271] [2025-02-08 14:08:01,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:08:01,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:08:01,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 14:08:01,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 14:08:01,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:08:01,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:08:01,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:08:01,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:08:01,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332200271] [2025-02-08 14:08:01,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332200271] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:08:01,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:08:01,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:08:01,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553460687] [2025-02-08 14:08:01,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:08:01,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:08:01,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:08:01,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:08:01,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:08:01,168 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 125 [2025-02-08 14:08:01,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 158 transitions, 588 flow. Second operand has 4 states, 4 states have (on average 69.25) internal successors, (277), 4 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:08:01,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:08:01,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 125 [2025-02-08 14:08:01,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:08:10,464 INFO L124 PetriNetUnfolderBase]: 79755/157237 cut-off events. [2025-02-08 14:08:10,465 INFO L125 PetriNetUnfolderBase]: For 6593/6593 co-relation queries the response was YES. [2025-02-08 14:08:10,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 269304 conditions, 157237 events. 79755/157237 cut-off events. For 6593/6593 co-relation queries the response was YES. Maximal size of possible extension queue 6575. Compared 1896232 event pairs, 57368 based on Foata normal form. 1068/122965 useless extension candidates. Maximal degree in co-relation 269112. Up to 54252 conditions per place. [2025-02-08 14:08:11,488 INFO L140 encePairwiseOnDemand]: 118/125 looper letters, 143 selfloop transitions, 10 changer transitions 0/216 dead transitions. [2025-02-08 14:08:11,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 216 transitions, 1053 flow [2025-02-08 14:08:11,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 14:08:11,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 14:08:11,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 446 transitions. [2025-02-08 14:08:11,490 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7136 [2025-02-08 14:08:11,490 INFO L175 Difference]: Start difference. First operand has 142 places, 158 transitions, 588 flow. Second operand 5 states and 446 transitions. [2025-02-08 14:08:11,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 216 transitions, 1053 flow [2025-02-08 14:08:11,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 216 transitions, 1033 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 14:08:11,498 INFO L231 Difference]: Finished difference. Result has 146 places, 159 transitions, 608 flow [2025-02-08 14:08:11,498 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=568, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=608, PETRI_PLACES=146, PETRI_TRANSITIONS=159} [2025-02-08 14:08:11,498 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 28 predicate places. [2025-02-08 14:08:11,499 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 159 transitions, 608 flow [2025-02-08 14:08:11,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.25) internal successors, (277), 4 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:08:11,499 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:08:11,499 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:08:11,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 14:08:11,499 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 66 more)] === [2025-02-08 14:08:11,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:08:11,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1436162396, now seen corresponding path program 1 times [2025-02-08 14:08:11,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:08:11,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825119936] [2025-02-08 14:08:11,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:08:11,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:08:11,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 14:08:11,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 14:08:11,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:08:11,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:08:11,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:08:11,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:08:11,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825119936] [2025-02-08 14:08:11,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825119936] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:08:11,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710098690] [2025-02-08 14:08:11,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:08:11,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:08:11,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:08:11,628 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:08:11,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 14:08:11,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 14:08:11,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 14:08:11,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:08:11,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:08:11,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 14:08:11,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:08:11,757 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 14:08:11,757 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 14:08:11,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [710098690] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:08:11,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 14:08:11,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [5] total 6 [2025-02-08 14:08:11,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361028021] [2025-02-08 14:08:11,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:08:11,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 14:08:11,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:08:11,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:08:11,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-08 14:08:11,768 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 125 [2025-02-08 14:08:11,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 159 transitions, 608 flow. Second operand has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:08:11,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:08:11,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 125 [2025-02-08 14:08:11,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand