./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/popl20-more-array-sum-alt.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-more-array-sum-alt.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cd36b7f18dbd530fce94e0943ff58c16da276fcc41b96fdafde87c3c69036175 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 14:11:51,511 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 14:11:51,550 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:11:51,554 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 14:11:51,554 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 14:11:51,568 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 14:11:51,569 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 14:11:51,569 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 14:11:51,569 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 14:11:51,569 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 14:11:51,569 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 14:11:51,569 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 14:11:51,569 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 14:11:51,569 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 14:11:51,569 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 14:11:51,569 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 14:11:51,569 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 14:11:51,569 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 14:11:51,570 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 14:11:51,570 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 14:11:51,570 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 14:11:51,570 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 14:11:51,570 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 14:11:51,570 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 14:11:51,570 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 14:11:51,570 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 14:11:51,570 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 14:11:51,570 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 14:11:51,570 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 14:11:51,570 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 14:11:51,570 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 14:11:51,570 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 14:11:51,570 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 14:11:51,570 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 14:11:51,570 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 14:11:51,570 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 14:11:51,571 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 14:11:51,571 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 14:11:51,571 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 14:11:51,571 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 14:11:51,571 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 14:11:51,571 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 14:11:51,571 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 14:11:51,571 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 14:11:51,571 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 14:11:51,571 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cd36b7f18dbd530fce94e0943ff58c16da276fcc41b96fdafde87c3c69036175 [2025-02-08 14:11:51,768 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 14:11:51,773 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 14:11:51,775 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 14:11:51,775 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 14:11:51,775 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 14:11:51,779 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-array-sum-alt.wvr.c [2025-02-08 14:11:53,045 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dd01558e5/5805f079bd02460e9bfd38f3a9228f54/FLAGe03b9e549 [2025-02-08 14:11:53,259 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 14:11:53,260 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-array-sum-alt.wvr.c [2025-02-08 14:11:53,285 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dd01558e5/5805f079bd02460e9bfd38f3a9228f54/FLAGe03b9e549 [2025-02-08 14:11:53,607 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dd01558e5/5805f079bd02460e9bfd38f3a9228f54 [2025-02-08 14:11:53,609 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 14:11:53,611 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 14:11:53,612 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 14:11:53,612 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 14:11:53,615 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 14:11:53,616 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:11:53" (1/1) ... [2025-02-08 14:11:53,616 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e89d5f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:11:53, skipping insertion in model container [2025-02-08 14:11:53,617 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:11:53" (1/1) ... [2025-02-08 14:11:53,630 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 14:11:53,761 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:11:53,768 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 14:11:53,786 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:11:53,796 INFO L204 MainTranslator]: Completed translation [2025-02-08 14:11:53,797 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:11:53 WrapperNode [2025-02-08 14:11:53,797 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 14:11:53,798 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 14:11:53,798 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 14:11:53,798 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 14:11:53,803 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:11:53" (1/1) ... [2025-02-08 14:11:53,809 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:11:53" (1/1) ... [2025-02-08 14:11:53,833 INFO L138 Inliner]: procedures = 22, calls = 25, calls flagged for inlining = 13, calls inlined = 17, statements flattened = 224 [2025-02-08 14:11:53,836 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 14:11:53,836 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 14:11:53,836 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 14:11:53,836 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 14:11:53,843 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:11:53" (1/1) ... [2025-02-08 14:11:53,844 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:11:53" (1/1) ... [2025-02-08 14:11:53,847 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:11:53" (1/1) ... [2025-02-08 14:11:53,870 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-02-08 14:11:53,871 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:11:53" (1/1) ... [2025-02-08 14:11:53,871 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:11:53" (1/1) ... [2025-02-08 14:11:53,875 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:11:53" (1/1) ... [2025-02-08 14:11:53,876 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:11:53" (1/1) ... [2025-02-08 14:11:53,877 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:11:53" (1/1) ... [2025-02-08 14:11:53,878 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:11:53" (1/1) ... [2025-02-08 14:11:53,879 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 14:11:53,880 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 14:11:53,880 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 14:11:53,880 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 14:11:53,881 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:11:53" (1/1) ... [2025-02-08 14:11:53,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 14:11:53,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:11:53,908 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 14:11:53,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 14:11:53,926 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 14:11:53,926 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 14:11:53,926 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 14:11:53,926 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 14:11:53,926 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 14:11:53,926 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 14:11:53,926 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 14:11:53,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 14:11:53,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 14:11:53,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 14:11:53,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 14:11:53,927 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 14:11:53,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 14:11:53,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 14:11:53,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 14:11:53,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 14:11:53,928 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 14:11:54,000 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 14:11:54,001 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 14:11:54,130 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48: ~res1~0 := ~tmp~0#1; [2025-02-08 14:11:54,131 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L46-1: havoc #t~post3#1; [2025-02-08 14:11:54,131 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L46-2: assume 1 + #t~post3#1 <= 2147483647; [2025-02-08 14:11:54,131 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L46-2: assume !(1 + #t~post3#1 <= 2147483647); [2025-02-08 14:11:54,131 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L46-3: ~i~0#1 := 1 + #t~post3#1; [2025-02-08 14:11:54,131 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L46-4: assume 1 + #t~post3#1 >= -2147483648; [2025-02-08 14:11:54,131 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L46-4: assume !(1 + #t~post3#1 >= -2147483648); [2025-02-08 14:11:54,131 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L46-5: #t~post3#1 := ~i~0#1; [2025-02-08 14:11:54,131 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L46-6: havoc ~tmp~0#1; [2025-02-08 14:11:54,131 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47: havoc #t~ret2#1; [2025-02-08 14:11:54,131 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-1: havoc #t~mem1#1; [2025-02-08 14:11:54,131 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-2: ~tmp~0#1 := #t~ret2#1; [2025-02-08 14:11:54,131 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-3: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret2#1 && #t~ret2#1 <= 2147483647; [2025-02-08 14:11:54,131 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-4: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 14:11:54,131 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-5: havoc plus_#t~short22#1, plus_#t~short23#1, plus_~a#1, plus_~b#1; [2025-02-08 14:11:54,132 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-6: #t~ret2#1 := plus_#res#1; [2025-02-08 14:11:54,213 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56: havoc #t~ret5#1; [2025-02-08 14:11:54,213 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-1: havoc #t~mem4#1; [2025-02-08 14:11:54,213 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-2: ~tmp~1#1 := #t~ret5#1; [2025-02-08 14:11:54,214 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-3: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647; [2025-02-08 14:11:54,214 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-4: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 14:11:54,214 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-5: havoc plus_#t~short22#1, plus_#t~short23#1, plus_~a#1, plus_~b#1; [2025-02-08 14:11:54,214 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-6: #t~ret5#1 := plus_#res#1; [2025-02-08 14:11:54,215 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L57: [2025-02-08 14:11:54,215 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L57-1: ~res2~0 := ~tmp~1#1; [2025-02-08 14:11:54,215 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-1: havoc #t~post6#1; [2025-02-08 14:11:54,215 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-2: assume 1 + #t~post6#1 <= 2147483647; [2025-02-08 14:11:54,215 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-2: assume !(1 + #t~post6#1 <= 2147483647); [2025-02-08 14:11:54,215 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-3: ~i~1#1 := 1 + #t~post6#1; [2025-02-08 14:11:54,215 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-4: assume 1 + #t~post6#1 >= -2147483648; [2025-02-08 14:11:54,215 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-4: assume !(1 + #t~post6#1 >= -2147483648); [2025-02-08 14:11:54,215 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-5: #t~post6#1 := ~i~1#1; [2025-02-08 14:11:54,215 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-6: havoc ~tmp~1#1; [2025-02-08 14:11:54,270 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64-1: havoc #t~post9#1; [2025-02-08 14:11:54,270 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64-2: assume 1 + #t~post9#1 <= 2147483647; [2025-02-08 14:11:54,270 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64-2: assume !(1 + #t~post9#1 <= 2147483647); [2025-02-08 14:11:54,270 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64-3: ~i~2#1 := 1 + #t~post9#1; [2025-02-08 14:11:54,270 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64-4: assume 1 + #t~post9#1 >= -2147483648; [2025-02-08 14:11:54,271 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64-4: assume !(1 + #t~post9#1 >= -2147483648); [2025-02-08 14:11:54,271 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64-5: #t~post9#1 := ~i~2#1; [2025-02-08 14:11:54,271 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64-6: havoc ~tmp~2#1; [2025-02-08 14:11:54,271 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65: havoc #t~ret8#1; [2025-02-08 14:11:54,271 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-1: havoc #t~mem7#1; [2025-02-08 14:11:54,271 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-2: ~tmp~2#1 := #t~ret8#1; [2025-02-08 14:11:54,271 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-3: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret8#1 && #t~ret8#1 <= 2147483647; [2025-02-08 14:11:54,271 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-4: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 14:11:54,271 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-5: havoc plus_#t~short22#1, plus_#t~short23#1, plus_~a#1, plus_~b#1; [2025-02-08 14:11:54,271 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-6: #t~ret8#1 := plus_#res#1; [2025-02-08 14:11:54,271 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66: [2025-02-08 14:11:54,271 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-1: ~res2~0 := ~tmp~2#1; [2025-02-08 14:11:54,344 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 14:11:54,348 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 14:11:54,479 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 14:11:54,479 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 14:11:54,479 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:11:54 BoogieIcfgContainer [2025-02-08 14:11:54,479 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 14:11:54,481 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 14:11:54,481 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 14:11:54,484 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 14:11:54,485 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 02:11:53" (1/3) ... [2025-02-08 14:11:54,485 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c1f2c80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 02:11:54, skipping insertion in model container [2025-02-08 14:11:54,485 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:11:53" (2/3) ... [2025-02-08 14:11:54,485 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c1f2c80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 02:11:54, skipping insertion in model container [2025-02-08 14:11:54,485 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:11:54" (3/3) ... [2025-02-08 14:11:54,490 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum-alt.wvr.c [2025-02-08 14:11:54,501 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 14:11:54,502 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-array-sum-alt.wvr.c that has 4 procedures, 77 locations, 1 initial locations, 4 loop locations, and 26 error locations. [2025-02-08 14:11:54,502 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 14:11:54,562 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 14:11:54,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 86 places, 83 transitions, 187 flow [2025-02-08 14:11:54,612 INFO L124 PetriNetUnfolderBase]: 7/80 cut-off events. [2025-02-08 14:11:54,613 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 14:11:54,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 80 events. 7/80 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 306 event pairs, 0 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2025-02-08 14:11:54,617 INFO L82 GeneralOperation]: Start removeDead. Operand has 86 places, 83 transitions, 187 flow [2025-02-08 14:11:54,619 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 81 places, 78 transitions, 171 flow [2025-02-08 14:11:54,624 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 14:11:54,632 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;@59d2df14, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 14:11:54,632 INFO L334 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2025-02-08 14:11:54,635 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 14:11:54,635 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-02-08 14:11:54,635 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 14:11:54,635 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:11:54,636 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 14:11:54,636 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-02-08 14:11:54,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:11:54,640 INFO L85 PathProgramCache]: Analyzing trace with hash 594784, now seen corresponding path program 1 times [2025-02-08 14:11:54,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:11:54,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300751098] [2025-02-08 14:11:54,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:11:54,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:11:54,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:11:54,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:11:54,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:11:54,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:11:54,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:11:54,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:11:54,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300751098] [2025-02-08 14:11:54,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300751098] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:11:54,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:11:54,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:11:54,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673346220] [2025-02-08 14:11:54,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:11:54,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:11:54,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:11:54,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:11:54,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:11:54,853 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 83 [2025-02-08 14:11:54,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 78 transitions, 171 flow. Second operand has 4 states, 4 states have (on average 43.75) internal successors, (175), 4 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:11:54,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:11:54,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 83 [2025-02-08 14:11:54,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:11:55,547 INFO L124 PetriNetUnfolderBase]: 3667/7501 cut-off events. [2025-02-08 14:11:55,548 INFO L125 PetriNetUnfolderBase]: For 247/247 co-relation queries the response was YES. [2025-02-08 14:11:55,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12737 conditions, 7501 events. 3667/7501 cut-off events. For 247/247 co-relation queries the response was YES. Maximal size of possible extension queue 458. Compared 64816 event pairs, 2736 based on Foata normal form. 1/5888 useless extension candidates. Maximal degree in co-relation 12121. Up to 5014 conditions per place. [2025-02-08 14:11:55,594 INFO L140 encePairwiseOnDemand]: 78/83 looper letters, 33 selfloop transitions, 4 changer transitions 0/77 dead transitions. [2025-02-08 14:11:55,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 77 transitions, 243 flow [2025-02-08 14:11:55,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:11:55,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:11:55,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 210 transitions. [2025-02-08 14:11:55,604 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6325301204819277 [2025-02-08 14:11:55,605 INFO L175 Difference]: Start difference. First operand has 81 places, 78 transitions, 171 flow. Second operand 4 states and 210 transitions. [2025-02-08 14:11:55,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 77 transitions, 243 flow [2025-02-08 14:11:55,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 77 transitions, 234 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 14:11:55,612 INFO L231 Difference]: Finished difference. Result has 78 places, 77 transitions, 168 flow [2025-02-08 14:11:55,613 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=168, PETRI_PLACES=78, PETRI_TRANSITIONS=77} [2025-02-08 14:11:55,615 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, -3 predicate places. [2025-02-08 14:11:55,615 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 77 transitions, 168 flow [2025-02-08 14:11:55,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.75) internal successors, (175), 4 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:11:55,616 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:11:55,616 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-08 14:11:55,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 14:11:55,616 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-02-08 14:11:55,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:11:55,617 INFO L85 PathProgramCache]: Analyzing trace with hash 18438802, now seen corresponding path program 1 times [2025-02-08 14:11:55,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:11:55,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656652313] [2025-02-08 14:11:55,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:11:55,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:11:55,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:11:55,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:11:55,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:11:55,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:11:55,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:11:55,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:11:55,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656652313] [2025-02-08 14:11:55,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656652313] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:11:55,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:11:55,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:11:55,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469059671] [2025-02-08 14:11:55,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:11:55,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:11:55,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:11:55,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:11:55,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:11:55,681 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 83 [2025-02-08 14:11:55,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 77 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 43.75) internal successors, (175), 4 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:11:55,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:11:55,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 83 [2025-02-08 14:11:55,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:11:56,205 INFO L124 PetriNetUnfolderBase]: 3668/7505 cut-off events. [2025-02-08 14:11:56,206 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2025-02-08 14:11:56,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12669 conditions, 7505 events. 3668/7505 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 458. Compared 64813 event pairs, 2736 based on Foata normal form. 1/5892 useless extension candidates. Maximal degree in co-relation 12641. Up to 5019 conditions per place. [2025-02-08 14:11:56,250 INFO L140 encePairwiseOnDemand]: 78/83 looper letters, 36 selfloop transitions, 4 changer transitions 0/80 dead transitions. [2025-02-08 14:11:56,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 80 transitions, 260 flow [2025-02-08 14:11:56,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:11:56,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:11:56,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 213 transitions. [2025-02-08 14:11:56,252 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.641566265060241 [2025-02-08 14:11:56,252 INFO L175 Difference]: Start difference. First operand has 78 places, 77 transitions, 168 flow. Second operand 4 states and 213 transitions. [2025-02-08 14:11:56,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 80 transitions, 260 flow [2025-02-08 14:11:56,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 80 transitions, 246 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 14:11:56,257 INFO L231 Difference]: Finished difference. Result has 80 places, 80 transitions, 187 flow [2025-02-08 14:11:56,257 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=187, PETRI_PLACES=80, PETRI_TRANSITIONS=80} [2025-02-08 14:11:56,257 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, -1 predicate places. [2025-02-08 14:11:56,257 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 80 transitions, 187 flow [2025-02-08 14:11:56,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.75) internal successors, (175), 4 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:11:56,258 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:11:56,258 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-02-08 14:11:56,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 14:11:56,258 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-02-08 14:11:56,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:11:56,258 INFO L85 PathProgramCache]: Analyzing trace with hash -444869513, now seen corresponding path program 1 times [2025-02-08 14:11:56,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:11:56,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83047783] [2025-02-08 14:11:56,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:11:56,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:11:56,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:11:56,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:11:56,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:11:56,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:11:56,355 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:11:56,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:11:56,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83047783] [2025-02-08 14:11:56,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83047783] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:11:56,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518049104] [2025-02-08 14:11:56,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:11:56,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:11:56,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:11:56,359 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:11:56,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 14:11:56,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:11:56,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:11:56,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:11:56,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:11:56,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 14:11:56,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:11:56,444 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:11:56,444 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:11:56,478 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:11:56,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [518049104] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:11:56,479 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:11:56,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-02-08 14:11:56,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80162456] [2025-02-08 14:11:56,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:11:56,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 14:11:56,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:11:56,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 14:11:56,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-02-08 14:11:56,488 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 83 [2025-02-08 14:11:56,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 80 transitions, 187 flow. Second operand has 10 states, 10 states have (on average 44.0) internal successors, (440), 10 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:11:56,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:11:56,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 83 [2025-02-08 14:11:56,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:11:56,951 INFO L124 PetriNetUnfolderBase]: 3671/7517 cut-off events. [2025-02-08 14:11:56,951 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2025-02-08 14:11:56,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12705 conditions, 7517 events. 3671/7517 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 458. Compared 64984 event pairs, 2736 based on Foata normal form. 0/5900 useless extension candidates. Maximal degree in co-relation 12648. Up to 5022 conditions per place. [2025-02-08 14:11:56,972 INFO L140 encePairwiseOnDemand]: 78/83 looper letters, 36 selfloop transitions, 13 changer transitions 0/89 dead transitions. [2025-02-08 14:11:56,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 89 transitions, 321 flow [2025-02-08 14:11:56,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 14:11:56,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 14:11:56,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 482 transitions. [2025-02-08 14:11:56,974 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5807228915662651 [2025-02-08 14:11:56,974 INFO L175 Difference]: Start difference. First operand has 80 places, 80 transitions, 187 flow. Second operand 10 states and 482 transitions. [2025-02-08 14:11:56,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 89 transitions, 321 flow [2025-02-08 14:11:56,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 89 transitions, 318 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:11:56,976 INFO L231 Difference]: Finished difference. Result has 91 places, 89 transitions, 264 flow [2025-02-08 14:11:56,976 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=264, PETRI_PLACES=91, PETRI_TRANSITIONS=89} [2025-02-08 14:11:56,977 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, 10 predicate places. [2025-02-08 14:11:56,977 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 89 transitions, 264 flow [2025-02-08 14:11:56,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 44.0) internal successors, (440), 10 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:11:56,977 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:11:56,977 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:11:56,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 14:11:57,182 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:11:57,182 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-02-08 14:11:57,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:11:57,183 INFO L85 PathProgramCache]: Analyzing trace with hash -283258415, now seen corresponding path program 1 times [2025-02-08 14:11:57,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:11:57,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006282211] [2025-02-08 14:11:57,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:11:57,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:11:57,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:11:57,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:11:57,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:11:57,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:11:57,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:11:57,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:11:57,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006282211] [2025-02-08 14:11:57,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006282211] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:11:57,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:11:57,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:11:57,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673537435] [2025-02-08 14:11:57,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:11:57,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:11:57,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:11:57,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:11:57,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:11:57,302 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 83 [2025-02-08 14:11:57,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 89 transitions, 264 flow. Second operand has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:11:57,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:11:57,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 83 [2025-02-08 14:11:57,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:11:58,093 INFO L124 PetriNetUnfolderBase]: 7629/13962 cut-off events. [2025-02-08 14:11:58,093 INFO L125 PetriNetUnfolderBase]: For 82/82 co-relation queries the response was YES. [2025-02-08 14:11:58,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24787 conditions, 13962 events. 7629/13962 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 812. Compared 120521 event pairs, 2475 based on Foata normal form. 364/11621 useless extension candidates. Maximal degree in co-relation 24751. Up to 4781 conditions per place. [2025-02-08 14:11:58,153 INFO L140 encePairwiseOnDemand]: 76/83 looper letters, 95 selfloop transitions, 4 changer transitions 0/134 dead transitions. [2025-02-08 14:11:58,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 134 transitions, 558 flow [2025-02-08 14:11:58,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:11:58,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:11:58,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 246 transitions. [2025-02-08 14:11:58,154 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7409638554216867 [2025-02-08 14:11:58,155 INFO L175 Difference]: Start difference. First operand has 91 places, 89 transitions, 264 flow. Second operand 4 states and 246 transitions. [2025-02-08 14:11:58,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 134 transitions, 558 flow [2025-02-08 14:11:58,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 134 transitions, 528 flow, removed 11 selfloop flow, removed 3 redundant places. [2025-02-08 14:11:58,157 INFO L231 Difference]: Finished difference. Result has 93 places, 90 transitions, 260 flow [2025-02-08 14:11:58,157 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=260, PETRI_PLACES=93, PETRI_TRANSITIONS=90} [2025-02-08 14:11:58,158 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, 12 predicate places. [2025-02-08 14:11:58,158 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 90 transitions, 260 flow [2025-02-08 14:11:58,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:11:58,158 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:11:58,158 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:11:58,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 14:11:58,158 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-02-08 14:11:58,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:11:58,159 INFO L85 PathProgramCache]: Analyzing trace with hash -191075703, now seen corresponding path program 1 times [2025-02-08 14:11:58,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:11:58,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533654098] [2025-02-08 14:11:58,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:11:58,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:11:58,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:11:58,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:11:58,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:11:58,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:11:58,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:11:58,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:11:58,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533654098] [2025-02-08 14:11:58,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533654098] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:11:58,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:11:58,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 14:11:58,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646363045] [2025-02-08 14:11:58,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:11:58,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 14:11:58,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:11:58,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 14:11:58,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 14:11:58,258 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 83 [2025-02-08 14:11:58,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 90 transitions, 260 flow. Second operand has 5 states, 5 states have (on average 46.0) internal successors, (230), 5 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:11:58,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:11:58,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 83 [2025-02-08 14:11:58,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:11:58,999 INFO L124 PetriNetUnfolderBase]: 5924/12540 cut-off events. [2025-02-08 14:11:58,999 INFO L125 PetriNetUnfolderBase]: For 1631/1903 co-relation queries the response was YES. [2025-02-08 14:11:59,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21986 conditions, 12540 events. 5924/12540 cut-off events. For 1631/1903 co-relation queries the response was YES. Maximal size of possible extension queue 686. Compared 118801 event pairs, 4226 based on Foata normal form. 291/10509 useless extension candidates. Maximal degree in co-relation 21952. Up to 6483 conditions per place. [2025-02-08 14:11:59,182 INFO L140 encePairwiseOnDemand]: 77/83 looper letters, 91 selfloop transitions, 5 changer transitions 0/137 dead transitions. [2025-02-08 14:11:59,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 137 transitions, 555 flow [2025-02-08 14:11:59,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 14:11:59,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 14:11:59,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 312 transitions. [2025-02-08 14:11:59,184 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7518072289156627 [2025-02-08 14:11:59,184 INFO L175 Difference]: Start difference. First operand has 93 places, 90 transitions, 260 flow. Second operand 5 states and 312 transitions. [2025-02-08 14:11:59,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 137 transitions, 555 flow [2025-02-08 14:11:59,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 137 transitions, 555 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 14:11:59,189 INFO L231 Difference]: Finished difference. Result has 99 places, 92 transitions, 285 flow [2025-02-08 14:11:59,189 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=285, PETRI_PLACES=99, PETRI_TRANSITIONS=92} [2025-02-08 14:11:59,189 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, 18 predicate places. [2025-02-08 14:11:59,189 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 92 transitions, 285 flow [2025-02-08 14:11:59,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.0) internal successors, (230), 5 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:11:59,190 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:11:59,190 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:11:59,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 14:11:59,190 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-02-08 14:11:59,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:11:59,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1624162506, now seen corresponding path program 1 times [2025-02-08 14:11:59,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:11:59,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322081101] [2025-02-08 14:11:59,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:11:59,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:11:59,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 14:11:59,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 14:11:59,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:11:59,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:11:59,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:11:59,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:11:59,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322081101] [2025-02-08 14:11:59,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322081101] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:11:59,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:11:59,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:11:59,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404665890] [2025-02-08 14:11:59,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:11:59,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:11:59,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:11:59,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:11:59,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:11:59,268 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 83 [2025-02-08 14:11:59,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 92 transitions, 285 flow. Second operand has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:11:59,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:11:59,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 83 [2025-02-08 14:11:59,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:12:00,532 INFO L124 PetriNetUnfolderBase]: 12616/23418 cut-off events. [2025-02-08 14:12:00,532 INFO L125 PetriNetUnfolderBase]: For 6038/6466 co-relation queries the response was YES. [2025-02-08 14:12:00,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45974 conditions, 23418 events. 12616/23418 cut-off events. For 6038/6466 co-relation queries the response was YES. Maximal size of possible extension queue 1190. Compared 214679 event pairs, 4601 based on Foata normal form. 858/20346 useless extension candidates. Maximal degree in co-relation 45937. Up to 7975 conditions per place. [2025-02-08 14:12:00,638 INFO L140 encePairwiseOnDemand]: 76/83 looper letters, 102 selfloop transitions, 4 changer transitions 0/141 dead transitions. [2025-02-08 14:12:00,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 141 transitions, 653 flow [2025-02-08 14:12:00,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:12:00,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:12:00,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 244 transitions. [2025-02-08 14:12:00,639 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7349397590361446 [2025-02-08 14:12:00,639 INFO L175 Difference]: Start difference. First operand has 99 places, 92 transitions, 285 flow. Second operand 4 states and 244 transitions. [2025-02-08 14:12:00,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 141 transitions, 653 flow [2025-02-08 14:12:00,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 141 transitions, 648 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 14:12:00,649 INFO L231 Difference]: Finished difference. Result has 102 places, 93 transitions, 306 flow [2025-02-08 14:12:00,649 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=306, PETRI_PLACES=102, PETRI_TRANSITIONS=93} [2025-02-08 14:12:00,650 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, 21 predicate places. [2025-02-08 14:12:00,650 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 93 transitions, 306 flow [2025-02-08 14:12:00,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 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:12:00,651 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:12:00,651 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:12:00,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 14:12:00,651 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-02-08 14:12:00,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:12:00,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1190570457, now seen corresponding path program 1 times [2025-02-08 14:12:00,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:12:00,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869420582] [2025-02-08 14:12:00,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:12:00,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:12:00,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 14:12:00,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 14:12:00,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:12:00,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:12:00,778 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:12:00,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:12:00,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869420582] [2025-02-08 14:12:00,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869420582] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:12:00,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:12:00,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 14:12:00,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355326256] [2025-02-08 14:12:00,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:12:00,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 14:12:00,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:12:00,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 14:12:00,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 14:12:00,779 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 83 [2025-02-08 14:12:00,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 93 transitions, 306 flow. Second operand has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 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:12:00,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:12:00,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 83 [2025-02-08 14:12:00,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:12:01,814 INFO L124 PetriNetUnfolderBase]: 7022/14961 cut-off events. [2025-02-08 14:12:01,814 INFO L125 PetriNetUnfolderBase]: For 4854/5549 co-relation queries the response was YES. [2025-02-08 14:12:01,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28993 conditions, 14961 events. 7022/14961 cut-off events. For 4854/5549 co-relation queries the response was YES. Maximal size of possible extension queue 853. Compared 146933 event pairs, 5778 based on Foata normal form. 428/13086 useless extension candidates. Maximal degree in co-relation 28954. Up to 9318 conditions per place. [2025-02-08 14:12:01,900 INFO L140 encePairwiseOnDemand]: 77/83 looper letters, 75 selfloop transitions, 5 changer transitions 4/125 dead transitions. [2025-02-08 14:12:01,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 125 transitions, 555 flow [2025-02-08 14:12:01,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 14:12:01,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 14:12:01,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 299 transitions. [2025-02-08 14:12:01,902 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7204819277108434 [2025-02-08 14:12:01,902 INFO L175 Difference]: Start difference. First operand has 102 places, 93 transitions, 306 flow. Second operand 5 states and 299 transitions. [2025-02-08 14:12:01,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 125 transitions, 555 flow [2025-02-08 14:12:01,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 125 transitions, 555 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 14:12:01,915 INFO L231 Difference]: Finished difference. Result has 108 places, 95 transitions, 331 flow [2025-02-08 14:12:01,915 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=331, PETRI_PLACES=108, PETRI_TRANSITIONS=95} [2025-02-08 14:12:01,916 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, 27 predicate places. [2025-02-08 14:12:01,918 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 95 transitions, 331 flow [2025-02-08 14:12:01,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 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:12:01,918 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:12:01,918 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:12:01,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 14:12:01,919 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-02-08 14:12:01,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:12:01,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1917490706, now seen corresponding path program 1 times [2025-02-08 14:12:01,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:12:01,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299556970] [2025-02-08 14:12:01,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:12:01,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:12:01,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:12:01,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:12:01,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:12:01,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:12:02,146 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:12:02,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:12:02,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299556970] [2025-02-08 14:12:02,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299556970] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:12:02,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317428811] [2025-02-08 14:12:02,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:12:02,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:12:02,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:12:02,149 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:12:02,151 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:12:02,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:12:02,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:12:02,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:12:02,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:12:02,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-08 14:12:02,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:12:02,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 14:12:02,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-02-08 14:12:02,285 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:12:02,285 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:12:02,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2025-02-08 14:12:02,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2025-02-08 14:12:02,351 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:12:02,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317428811] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:12:02,352 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:12:02,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-02-08 14:12:02,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029521387] [2025-02-08 14:12:02,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:12:02,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 14:12:02,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:12:02,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 14:12:02,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-02-08 14:12:02,419 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 83 [2025-02-08 14:12:02,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 95 transitions, 331 flow. Second operand has 13 states, 13 states have (on average 43.38461538461539) internal successors, (564), 13 states have internal predecessors, (564), 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:12:02,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:12:02,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 83 [2025-02-08 14:12:02,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:12:03,459 INFO L124 PetriNetUnfolderBase]: 8070/15559 cut-off events. [2025-02-08 14:12:03,459 INFO L125 PetriNetUnfolderBase]: For 6435/6926 co-relation queries the response was YES. [2025-02-08 14:12:03,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33068 conditions, 15559 events. 8070/15559 cut-off events. For 6435/6926 co-relation queries the response was YES. Maximal size of possible extension queue 826. Compared 139160 event pairs, 1479 based on Foata normal form. 271/14249 useless extension candidates. Maximal degree in co-relation 33026. Up to 8086 conditions per place. [2025-02-08 14:12:03,568 INFO L140 encePairwiseOnDemand]: 75/83 looper letters, 102 selfloop transitions, 11 changer transitions 2/154 dead transitions. [2025-02-08 14:12:03,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 154 transitions, 727 flow [2025-02-08 14:12:03,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 14:12:03,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 14:12:03,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 439 transitions. [2025-02-08 14:12:03,570 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.661144578313253 [2025-02-08 14:12:03,570 INFO L175 Difference]: Start difference. First operand has 108 places, 95 transitions, 331 flow. Second operand 8 states and 439 transitions. [2025-02-08 14:12:03,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 154 transitions, 727 flow [2025-02-08 14:12:03,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 154 transitions, 722 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 14:12:03,616 INFO L231 Difference]: Finished difference. Result has 112 places, 94 transitions, 346 flow [2025-02-08 14:12:03,616 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=346, PETRI_PLACES=112, PETRI_TRANSITIONS=94} [2025-02-08 14:12:03,616 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, 31 predicate places. [2025-02-08 14:12:03,616 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 94 transitions, 346 flow [2025-02-08 14:12:03,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 43.38461538461539) internal successors, (564), 13 states have internal predecessors, (564), 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:12:03,617 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:12:03,617 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:12:03,626 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-02-08 14:12:03,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:12:03,821 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-02-08 14:12:03,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:12:03,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1672971780, now seen corresponding path program 1 times [2025-02-08 14:12:03,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:12:03,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151692518] [2025-02-08 14:12:03,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:12:03,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:12:03,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:12:03,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:12:03,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:12:03,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:12:03,860 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:12:03,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:12:03,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151692518] [2025-02-08 14:12:03,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151692518] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:12:03,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:12:03,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:12:03,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253242030] [2025-02-08 14:12:03,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:12:03,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:12:03,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:12:03,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:12:03,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:12:03,879 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 83 [2025-02-08 14:12:03,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 94 transitions, 346 flow. Second operand has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:12:03,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:12:03,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 83 [2025-02-08 14:12:03,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:12:05,286 INFO L124 PetriNetUnfolderBase]: 13935/26239 cut-off events. [2025-02-08 14:12:05,286 INFO L125 PetriNetUnfolderBase]: For 15517/16774 co-relation queries the response was YES. [2025-02-08 14:12:05,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57061 conditions, 26239 events. 13935/26239 cut-off events. For 15517/16774 co-relation queries the response was YES. Maximal size of possible extension queue 1435. Compared 249661 event pairs, 5787 based on Foata normal form. 1313/24216 useless extension candidates. Maximal degree in co-relation 57018. Up to 9171 conditions per place. [2025-02-08 14:12:05,453 INFO L140 encePairwiseOnDemand]: 76/83 looper letters, 109 selfloop transitions, 4 changer transitions 0/147 dead transitions. [2025-02-08 14:12:05,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 147 transitions, 798 flow [2025-02-08 14:12:05,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:12:05,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:12:05,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 242 transitions. [2025-02-08 14:12:05,455 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7289156626506024 [2025-02-08 14:12:05,455 INFO L175 Difference]: Start difference. First operand has 112 places, 94 transitions, 346 flow. Second operand 4 states and 242 transitions. [2025-02-08 14:12:05,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 147 transitions, 798 flow [2025-02-08 14:12:05,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 147 transitions, 745 flow, removed 9 selfloop flow, removed 6 redundant places. [2025-02-08 14:12:05,513 INFO L231 Difference]: Finished difference. Result has 111 places, 95 transitions, 349 flow [2025-02-08 14:12:05,513 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=349, PETRI_PLACES=111, PETRI_TRANSITIONS=95} [2025-02-08 14:12:05,514 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, 30 predicate places. [2025-02-08 14:12:05,514 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 95 transitions, 349 flow [2025-02-08 14:12:05,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:12:05,515 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:12:05,515 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:12:05,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 14:12:05,515 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread3Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-02-08 14:12:05,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:12:05,515 INFO L85 PathProgramCache]: Analyzing trace with hash 322518240, now seen corresponding path program 1 times [2025-02-08 14:12:05,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:12:05,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085891200] [2025-02-08 14:12:05,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:12:05,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:12:05,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 14:12:05,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 14:12:05,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:12:05,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:12:05,588 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:12:05,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:12:05,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085891200] [2025-02-08 14:12:05,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085891200] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:12:05,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:12:05,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 14:12:05,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007546036] [2025-02-08 14:12:05,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:12:05,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 14:12:05,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:12:05,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 14:12:05,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 14:12:05,590 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 83 [2025-02-08 14:12:05,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 95 transitions, 349 flow. Second operand has 5 states, 5 states have (on average 46.8) internal successors, (234), 5 states have internal predecessors, (234), 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:12:05,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:12:05,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 83 [2025-02-08 14:12:05,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:12:06,847 INFO L124 PetriNetUnfolderBase]: 9341/20106 cut-off events. [2025-02-08 14:12:06,847 INFO L125 PetriNetUnfolderBase]: For 8979/10251 co-relation queries the response was YES. [2025-02-08 14:12:06,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42128 conditions, 20106 events. 9341/20106 cut-off events. For 8979/10251 co-relation queries the response was YES. Maximal size of possible extension queue 1179. Compared 209111 event pairs, 8206 based on Foata normal form. 692/18653 useless extension candidates. Maximal degree in co-relation 42085. Up to 12767 conditions per place. [2025-02-08 14:12:06,982 INFO L140 encePairwiseOnDemand]: 77/83 looper letters, 48 selfloop transitions, 2 changer transitions 22/112 dead transitions. [2025-02-08 14:12:06,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 112 transitions, 545 flow [2025-02-08 14:12:06,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 14:12:06,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 14:12:06,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 286 transitions. [2025-02-08 14:12:06,984 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.689156626506024 [2025-02-08 14:12:06,984 INFO L175 Difference]: Start difference. First operand has 111 places, 95 transitions, 349 flow. Second operand 5 states and 286 transitions. [2025-02-08 14:12:06,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 112 transitions, 545 flow [2025-02-08 14:12:07,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 112 transitions, 545 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 14:12:07,036 INFO L231 Difference]: Finished difference. Result has 117 places, 90 transitions, 334 flow [2025-02-08 14:12:07,036 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=349, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=334, PETRI_PLACES=117, PETRI_TRANSITIONS=90} [2025-02-08 14:12:07,036 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, 36 predicate places. [2025-02-08 14:12:07,036 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 90 transitions, 334 flow [2025-02-08 14:12:07,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.8) internal successors, (234), 5 states have internal predecessors, (234), 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:12:07,037 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:12:07,037 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:12:07,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 14:12:07,037 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-02-08 14:12:07,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:12:07,037 INFO L85 PathProgramCache]: Analyzing trace with hash 687300080, now seen corresponding path program 1 times [2025-02-08 14:12:07,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:12:07,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904824429] [2025-02-08 14:12:07,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:12:07,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:12:07,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 14:12:07,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 14:12:07,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:12:07,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:12:07,288 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:12:07,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:12:07,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904824429] [2025-02-08 14:12:07,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904824429] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:12:07,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [851906583] [2025-02-08 14:12:07,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:12:07,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:12:07,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:12:07,293 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:12:07,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 14:12:07,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 14:12:07,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 14:12:07,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:12:07,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:12:07,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-08 14:12:07,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:12:07,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 14:12:07,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-08 14:12:07,430 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:12:07,431 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:12:07,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2025-02-08 14:12:07,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2025-02-08 14:12:07,511 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:12:07,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [851906583] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:12:07,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:12:07,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-02-08 14:12:07,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916566412] [2025-02-08 14:12:07,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:12:07,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 14:12:07,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:12:07,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 14:12:07,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-02-08 14:12:07,569 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 83 [2025-02-08 14:12:07,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 90 transitions, 334 flow. Second operand has 13 states, 13 states have (on average 41.53846153846154) internal successors, (540), 13 states have internal predecessors, (540), 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:12:07,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:12:07,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 83 [2025-02-08 14:12:07,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:12:08,957 INFO L124 PetriNetUnfolderBase]: 11366/21303 cut-off events. [2025-02-08 14:12:08,958 INFO L125 PetriNetUnfolderBase]: For 12181/13478 co-relation queries the response was YES. [2025-02-08 14:12:09,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48347 conditions, 21303 events. 11366/21303 cut-off events. For 12181/13478 co-relation queries the response was YES. Maximal size of possible extension queue 1149. Compared 197409 event pairs, 1383 based on Foata normal form. 1012/20656 useless extension candidates. Maximal degree in co-relation 48312. Up to 12625 conditions per place. [2025-02-08 14:12:09,172 INFO L140 encePairwiseOnDemand]: 75/83 looper letters, 89 selfloop transitions, 10 changer transitions 0/135 dead transitions. [2025-02-08 14:12:09,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 135 transitions, 698 flow [2025-02-08 14:12:09,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 14:12:09,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 14:12:09,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 403 transitions. [2025-02-08 14:12:09,174 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6069277108433735 [2025-02-08 14:12:09,174 INFO L175 Difference]: Start difference. First operand has 117 places, 90 transitions, 334 flow. Second operand 8 states and 403 transitions. [2025-02-08 14:12:09,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 135 transitions, 698 flow [2025-02-08 14:12:09,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 135 transitions, 652 flow, removed 18 selfloop flow, removed 7 redundant places. [2025-02-08 14:12:09,247 INFO L231 Difference]: Finished difference. Result has 110 places, 89 transitions, 328 flow [2025-02-08 14:12:09,248 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=328, PETRI_PLACES=110, PETRI_TRANSITIONS=89} [2025-02-08 14:12:09,248 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, 29 predicate places. [2025-02-08 14:12:09,248 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 89 transitions, 328 flow [2025-02-08 14:12:09,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 41.53846153846154) internal successors, (540), 13 states have internal predecessors, (540), 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:12:09,249 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:12:09,249 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:12:09,259 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-02-08 14:12:09,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:12:09,450 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-02-08 14:12:09,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:12:09,451 INFO L85 PathProgramCache]: Analyzing trace with hash -36871170, now seen corresponding path program 1 times [2025-02-08 14:12:09,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:12:09,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357868684] [2025-02-08 14:12:09,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:12:09,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:12:09,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 14:12:09,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:12:09,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:12:09,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:12:09,633 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:12:09,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:12:09,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357868684] [2025-02-08 14:12:09,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357868684] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:12:09,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [952910322] [2025-02-08 14:12:09,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:12:09,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:12:09,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:12:09,636 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:12:09,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 14:12:09,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 14:12:09,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:12:09,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:12:09,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:12:09,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-08 14:12:09,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:12:09,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 14:12:09,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-02-08 14:12:09,752 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:12:09,752 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:12:09,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2025-02-08 14:12:09,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2025-02-08 14:12:09,839 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:12:09,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [952910322] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:12:09,839 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:12:09,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-02-08 14:12:09,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386863561] [2025-02-08 14:12:09,839 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:12:09,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 14:12:09,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:12:09,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 14:12:09,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-02-08 14:12:09,950 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 83 [2025-02-08 14:12:09,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 89 transitions, 328 flow. Second operand has 13 states, 13 states have (on average 43.69230769230769) internal successors, (568), 13 states have internal predecessors, (568), 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:12:09,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:12:09,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 83 [2025-02-08 14:12:09,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:12:11,001 INFO L124 PetriNetUnfolderBase]: 9857/19697 cut-off events. [2025-02-08 14:12:11,002 INFO L125 PetriNetUnfolderBase]: For 8848/9636 co-relation queries the response was YES. [2025-02-08 14:12:11,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42473 conditions, 19697 events. 9857/19697 cut-off events. For 8848/9636 co-relation queries the response was YES. Maximal size of possible extension queue 1098. Compared 192153 event pairs, 1266 based on Foata normal form. 569/18745 useless extension candidates. Maximal degree in co-relation 42432. Up to 10437 conditions per place. [2025-02-08 14:12:11,185 INFO L140 encePairwiseOnDemand]: 75/83 looper letters, 85 selfloop transitions, 10 changer transitions 0/132 dead transitions. [2025-02-08 14:12:11,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 132 transitions, 672 flow [2025-02-08 14:12:11,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 14:12:11,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 14:12:11,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 416 transitions. [2025-02-08 14:12:11,187 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6265060240963856 [2025-02-08 14:12:11,187 INFO L175 Difference]: Start difference. First operand has 110 places, 89 transitions, 328 flow. Second operand 8 states and 416 transitions. [2025-02-08 14:12:11,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 132 transitions, 672 flow [2025-02-08 14:12:11,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 132 transitions, 643 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 14:12:11,300 INFO L231 Difference]: Finished difference. Result has 110 places, 88 transitions, 327 flow [2025-02-08 14:12:11,300 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=327, PETRI_PLACES=110, PETRI_TRANSITIONS=88} [2025-02-08 14:12:11,301 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, 29 predicate places. [2025-02-08 14:12:11,301 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 88 transitions, 327 flow [2025-02-08 14:12:11,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 43.69230769230769) internal successors, (568), 13 states have internal predecessors, (568), 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:12:11,301 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:12:11,301 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:12:11,308 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 14:12:11,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-08 14:12:11,502 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-02-08 14:12:11,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:12:11,502 INFO L85 PathProgramCache]: Analyzing trace with hash -168533423, now seen corresponding path program 1 times [2025-02-08 14:12:11,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:12:11,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123805873] [2025-02-08 14:12:11,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:12:11,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:12:11,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 14:12:11,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:12:11,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:12:11,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:12:11,533 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:12:11,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:12:11,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123805873] [2025-02-08 14:12:11,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123805873] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:12:11,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:12:11,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:12:11,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011781230] [2025-02-08 14:12:11,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:12:11,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:12:11,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:12:11,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:12:11,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:12:11,548 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 83 [2025-02-08 14:12:11,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 88 transitions, 327 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-02-08 14:12:11,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:12:11,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 83 [2025-02-08 14:12:11,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:12:12,972 INFO L124 PetriNetUnfolderBase]: 10846/21978 cut-off events. [2025-02-08 14:12:12,972 INFO L125 PetriNetUnfolderBase]: For 10530/11487 co-relation queries the response was YES. [2025-02-08 14:12:13,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47269 conditions, 21978 events. 10846/21978 cut-off events. For 10530/11487 co-relation queries the response was YES. Maximal size of possible extension queue 1201. Compared 220673 event pairs, 5364 based on Foata normal form. 838/20743 useless extension candidates. Maximal degree in co-relation 47228. Up to 8301 conditions per place. [2025-02-08 14:12:13,100 INFO L140 encePairwiseOnDemand]: 79/83 looper letters, 98 selfloop transitions, 3 changer transitions 0/135 dead transitions. [2025-02-08 14:12:13,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 135 transitions, 685 flow [2025-02-08 14:12:13,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:12:13,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:12:13,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 241 transitions. [2025-02-08 14:12:13,102 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7259036144578314 [2025-02-08 14:12:13,103 INFO L175 Difference]: Start difference. First operand has 110 places, 88 transitions, 327 flow. Second operand 4 states and 241 transitions. [2025-02-08 14:12:13,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 135 transitions, 685 flow [2025-02-08 14:12:13,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 135 transitions, 654 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-02-08 14:12:13,166 INFO L231 Difference]: Finished difference. Result has 106 places, 87 transitions, 306 flow [2025-02-08 14:12:13,166 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=306, PETRI_PLACES=106, PETRI_TRANSITIONS=87} [2025-02-08 14:12:13,167 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, 25 predicate places. [2025-02-08 14:12:13,167 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 87 transitions, 306 flow [2025-02-08 14:12:13,167 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-02-08 14:12:13,167 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:12:13,167 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:12:13,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 14:12:13,168 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-02-08 14:12:13,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:12:13,168 INFO L85 PathProgramCache]: Analyzing trace with hash -168534416, now seen corresponding path program 1 times [2025-02-08 14:12:13,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:12:13,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793995369] [2025-02-08 14:12:13,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:12:13,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:12:13,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 14:12:13,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:12:13,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:12:13,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:12:13,219 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:12:13,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:12:13,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793995369] [2025-02-08 14:12:13,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793995369] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:12:13,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:12:13,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:12:13,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211488682] [2025-02-08 14:12:13,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:12:13,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 14:12:13,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:12:13,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 14:12:13,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 14:12:13,241 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 83 [2025-02-08 14:12:13,241 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 87 transitions, 306 flow. Second operand has 5 states, 5 states have (on average 42.2) internal successors, (211), 5 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:12:13,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:12:13,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 83 [2025-02-08 14:12:13,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:12:14,246 INFO L124 PetriNetUnfolderBase]: 11598/22845 cut-off events. [2025-02-08 14:12:14,246 INFO L125 PetriNetUnfolderBase]: For 8554/9591 co-relation queries the response was YES. [2025-02-08 14:12:14,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49456 conditions, 22845 events. 11598/22845 cut-off events. For 8554/9591 co-relation queries the response was YES. Maximal size of possible extension queue 1217. Compared 224563 event pairs, 6066 based on Foata normal form. 888/21887 useless extension candidates. Maximal degree in co-relation 49419. Up to 9366 conditions per place. [2025-02-08 14:12:14,388 INFO L140 encePairwiseOnDemand]: 78/83 looper letters, 98 selfloop transitions, 4 changer transitions 0/135 dead transitions. [2025-02-08 14:12:14,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 135 transitions, 662 flow [2025-02-08 14:12:14,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 14:12:14,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 14:12:14,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 286 transitions. [2025-02-08 14:12:14,389 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.689156626506024 [2025-02-08 14:12:14,389 INFO L175 Difference]: Start difference. First operand has 106 places, 87 transitions, 306 flow. Second operand 5 states and 286 transitions. [2025-02-08 14:12:14,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 135 transitions, 662 flow [2025-02-08 14:12:14,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 135 transitions, 657 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 14:12:14,459 INFO L231 Difference]: Finished difference. Result has 109 places, 87 transitions, 312 flow [2025-02-08 14:12:14,459 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=312, PETRI_PLACES=109, PETRI_TRANSITIONS=87} [2025-02-08 14:12:14,459 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, 28 predicate places. [2025-02-08 14:12:14,459 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 87 transitions, 312 flow [2025-02-08 14:12:14,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.2) internal successors, (211), 5 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:12:14,460 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:12:14,460 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:12:14,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 14:12:14,460 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-02-08 14:12:14,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:12:14,460 INFO L85 PathProgramCache]: Analyzing trace with hash -929599021, now seen corresponding path program 1 times [2025-02-08 14:12:14,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:12:14,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209092042] [2025-02-08 14:12:14,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:12:14,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:12:14,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 14:12:14,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 14:12:14,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:12:14,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:12:14,507 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:12:14,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:12:14,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209092042] [2025-02-08 14:12:14,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209092042] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:12:14,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:12:14,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 14:12:14,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722503928] [2025-02-08 14:12:14,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:12:14,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 14:12:14,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:12:14,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 14:12:14,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-08 14:12:14,525 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 83 [2025-02-08 14:12:14,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 87 transitions, 312 flow. Second operand has 6 states, 6 states have (on average 38.833333333333336) internal successors, (233), 6 states have internal predecessors, (233), 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:12:14,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:12:14,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 83 [2025-02-08 14:12:14,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:12:16,215 INFO L124 PetriNetUnfolderBase]: 16053/26898 cut-off events. [2025-02-08 14:12:16,216 INFO L125 PetriNetUnfolderBase]: For 11364/13312 co-relation queries the response was YES. [2025-02-08 14:12:16,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62098 conditions, 26898 events. 16053/26898 cut-off events. For 11364/13312 co-relation queries the response was YES. Maximal size of possible extension queue 1389. Compared 232115 event pairs, 2083 based on Foata normal form. 1000/26415 useless extension candidates. Maximal degree in co-relation 62059. Up to 8672 conditions per place. [2025-02-08 14:12:16,436 INFO L140 encePairwiseOnDemand]: 76/83 looper letters, 119 selfloop transitions, 7 changer transitions 0/158 dead transitions. [2025-02-08 14:12:16,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 158 transitions, 790 flow [2025-02-08 14:12:16,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:12:16,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 14:12:16,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 329 transitions. [2025-02-08 14:12:16,437 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6606425702811245 [2025-02-08 14:12:16,437 INFO L175 Difference]: Start difference. First operand has 109 places, 87 transitions, 312 flow. Second operand 6 states and 329 transitions. [2025-02-08 14:12:16,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 158 transitions, 790 flow [2025-02-08 14:12:16,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 158 transitions, 783 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 14:12:16,525 INFO L231 Difference]: Finished difference. Result has 112 places, 87 transitions, 323 flow [2025-02-08 14:12:16,526 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=323, PETRI_PLACES=112, PETRI_TRANSITIONS=87} [2025-02-08 14:12:16,526 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, 31 predicate places. [2025-02-08 14:12:16,526 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 87 transitions, 323 flow [2025-02-08 14:12:16,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.833333333333336) internal successors, (233), 6 states have internal predecessors, (233), 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:12:16,526 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:12:16,526 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:12:16,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 14:12:16,527 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-02-08 14:12:16,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:12:16,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1143036427, now seen corresponding path program 1 times [2025-02-08 14:12:16,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:12:16,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074871718] [2025-02-08 14:12:16,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:12:16,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:12:16,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 14:12:16,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 14:12:16,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:12:16,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:12:16,661 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:12:16,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:12:16,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074871718] [2025-02-08 14:12:16,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074871718] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:12:16,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296136644] [2025-02-08 14:12:16,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:12:16,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:12:16,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:12:16,667 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:12:16,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 14:12:16,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 14:12:16,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 14:12:16,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:12:16,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:12:16,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-08 14:12:16,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:12:16,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 14:12:16,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-08 14:12:16,816 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:12:16,816 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:12:16,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2025-02-08 14:12:16,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2025-02-08 14:12:16,888 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:12:16,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [296136644] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:12:16,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:12:16,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-02-08 14:12:16,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688800397] [2025-02-08 14:12:16,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:12:16,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 14:12:16,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:12:16,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 14:12:16,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-02-08 14:12:16,936 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 83 [2025-02-08 14:12:16,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 87 transitions, 323 flow. Second operand has 13 states, 13 states have (on average 41.84615384615385) internal successors, (544), 13 states have internal predecessors, (544), 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:12:16,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:12:16,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 83 [2025-02-08 14:12:16,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:12:18,771 INFO L124 PetriNetUnfolderBase]: 13202/25199 cut-off events. [2025-02-08 14:12:18,771 INFO L125 PetriNetUnfolderBase]: For 12131/13259 co-relation queries the response was YES. [2025-02-08 14:12:18,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55751 conditions, 25199 events. 13202/25199 cut-off events. For 12131/13259 co-relation queries the response was YES. Maximal size of possible extension queue 1303. Compared 241533 event pairs, 2819 based on Foata normal form. 1213/24529 useless extension candidates. Maximal degree in co-relation 55711. Up to 15188 conditions per place. [2025-02-08 14:12:19,015 INFO L140 encePairwiseOnDemand]: 75/83 looper letters, 87 selfloop transitions, 10 changer transitions 0/130 dead transitions. [2025-02-08 14:12:19,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 130 transitions, 671 flow [2025-02-08 14:12:19,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 14:12:19,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 14:12:19,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 401 transitions. [2025-02-08 14:12:19,017 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6039156626506024 [2025-02-08 14:12:19,017 INFO L175 Difference]: Start difference. First operand has 112 places, 87 transitions, 323 flow. Second operand 8 states and 401 transitions. [2025-02-08 14:12:19,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 130 transitions, 671 flow [2025-02-08 14:12:19,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 130 transitions, 643 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 14:12:19,135 INFO L231 Difference]: Finished difference. Result has 114 places, 86 transitions, 327 flow [2025-02-08 14:12:19,135 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=327, PETRI_PLACES=114, PETRI_TRANSITIONS=86} [2025-02-08 14:12:19,136 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, 33 predicate places. [2025-02-08 14:12:19,136 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 86 transitions, 327 flow [2025-02-08 14:12:19,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 41.84615384615385) internal successors, (544), 13 states have internal predecessors, (544), 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:12:19,136 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:12:19,136 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:12:19,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-08 14:12:19,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-08 14:12:19,337 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-02-08 14:12:19,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:12:19,337 INFO L85 PathProgramCache]: Analyzing trace with hash -2129077354, now seen corresponding path program 1 times [2025-02-08 14:12:19,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:12:19,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302459965] [2025-02-08 14:12:19,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:12:19,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:12:19,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 14:12:19,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 14:12:19,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:12:19,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:12:19,381 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:12:19,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:12:19,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302459965] [2025-02-08 14:12:19,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302459965] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:12:19,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:12:19,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:12:19,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931350035] [2025-02-08 14:12:19,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:12:19,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:12:19,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:12:19,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:12:19,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:12:19,401 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 83 [2025-02-08 14:12:19,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 86 transitions, 327 flow. Second operand has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 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:12:19,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:12:19,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 83 [2025-02-08 14:12:19,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:12:21,127 INFO L124 PetriNetUnfolderBase]: 15047/27672 cut-off events. [2025-02-08 14:12:21,127 INFO L125 PetriNetUnfolderBase]: For 13414/14350 co-relation queries the response was YES. [2025-02-08 14:12:21,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63238 conditions, 27672 events. 15047/27672 cut-off events. For 13414/14350 co-relation queries the response was YES. Maximal size of possible extension queue 1509. Compared 263407 event pairs, 6068 based on Foata normal form. 1062/27158 useless extension candidates. Maximal degree in co-relation 63196. Up to 9717 conditions per place. [2025-02-08 14:12:21,416 INFO L140 encePairwiseOnDemand]: 79/83 looper letters, 99 selfloop transitions, 3 changer transitions 0/133 dead transitions. [2025-02-08 14:12:21,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 133 transitions, 691 flow [2025-02-08 14:12:21,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:12:21,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:12:21,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 246 transitions. [2025-02-08 14:12:21,417 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7409638554216867 [2025-02-08 14:12:21,418 INFO L175 Difference]: Start difference. First operand has 114 places, 86 transitions, 327 flow. Second operand 4 states and 246 transitions. [2025-02-08 14:12:21,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 133 transitions, 691 flow [2025-02-08 14:12:21,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 133 transitions, 661 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-02-08 14:12:21,642 INFO L231 Difference]: Finished difference. Result has 110 places, 86 transitions, 315 flow [2025-02-08 14:12:21,642 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=303, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=315, PETRI_PLACES=110, PETRI_TRANSITIONS=86} [2025-02-08 14:12:21,645 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, 29 predicate places. [2025-02-08 14:12:21,645 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 86 transitions, 315 flow [2025-02-08 14:12:21,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 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:12:21,645 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:12:21,645 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:12:21,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 14:12:21,645 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-02-08 14:12:21,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:12:21,646 INFO L85 PathProgramCache]: Analyzing trace with hash -2129076361, now seen corresponding path program 1 times [2025-02-08 14:12:21,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:12:21,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260176502] [2025-02-08 14:12:21,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:12:21,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:12:21,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 14:12:21,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 14:12:21,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:12:21,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:12:21,724 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:12:21,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:12:21,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260176502] [2025-02-08 14:12:21,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260176502] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:12:21,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:12:21,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 14:12:21,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396073194] [2025-02-08 14:12:21,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:12:21,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 14:12:21,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:12:21,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 14:12:21,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 14:12:21,742 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 83 [2025-02-08 14:12:21,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 86 transitions, 315 flow. Second operand has 5 states, 5 states have (on average 39.4) internal successors, (197), 5 states have internal predecessors, (197), 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:12:21,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:12:21,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 83 [2025-02-08 14:12:21,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:12:22,996 INFO L124 PetriNetUnfolderBase]: 14368/26014 cut-off events. [2025-02-08 14:12:22,996 INFO L125 PetriNetUnfolderBase]: For 9500/10466 co-relation queries the response was YES. [2025-02-08 14:12:23,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60324 conditions, 26014 events. 14368/26014 cut-off events. For 9500/10466 co-relation queries the response was YES. Maximal size of possible extension queue 1382. Compared 241353 event pairs, 6853 based on Foata normal form. 1070/25548 useless extension candidates. Maximal degree in co-relation 60286. Up to 10488 conditions per place. [2025-02-08 14:12:23,190 INFO L140 encePairwiseOnDemand]: 77/83 looper letters, 143 selfloop transitions, 7 changer transitions 0/181 dead transitions. [2025-02-08 14:12:23,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 181 transitions, 919 flow [2025-02-08 14:12:23,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:12:23,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 14:12:23,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 352 transitions. [2025-02-08 14:12:23,192 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7068273092369478 [2025-02-08 14:12:23,192 INFO L175 Difference]: Start difference. First operand has 110 places, 86 transitions, 315 flow. Second operand 6 states and 352 transitions. [2025-02-08 14:12:23,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 181 transitions, 919 flow [2025-02-08 14:12:23,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 181 transitions, 909 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-02-08 14:12:23,338 INFO L231 Difference]: Finished difference. Result has 113 places, 88 transitions, 333 flow [2025-02-08 14:12:23,338 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=333, PETRI_PLACES=113, PETRI_TRANSITIONS=88} [2025-02-08 14:12:23,338 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, 32 predicate places. [2025-02-08 14:12:23,338 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 88 transitions, 333 flow [2025-02-08 14:12:23,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 39.4) internal successors, (197), 5 states have internal predecessors, (197), 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:12:23,339 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:12:23,339 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:12:23,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 14:12:23,339 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread3Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-02-08 14:12:23,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:12:23,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1867121093, now seen corresponding path program 1 times [2025-02-08 14:12:23,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:12:23,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952838103] [2025-02-08 14:12:23,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:12:23,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:12:23,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 14:12:23,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 14:12:23,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:12:23,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:12:23,577 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:12:23,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:12:23,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952838103] [2025-02-08 14:12:23,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952838103] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:12:23,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468524232] [2025-02-08 14:12:23,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:12:23,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:12:23,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:12:23,581 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:12:23,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 14:12:23,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 14:12:23,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 14:12:23,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:12:23,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:12:23,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-08 14:12:23,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:12:23,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-02-08 14:12:23,874 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-08 14:12:23,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2025-02-08 14:12:23,891 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:12:23,891 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:12:24,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2025-02-08 14:12:24,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2025-02-08 14:12:24,101 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:12:24,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468524232] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:12:24,101 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:12:24,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2025-02-08 14:12:24,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962982415] [2025-02-08 14:12:24,102 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:12:24,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-08 14:12:24,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:12:24,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-08 14:12:24,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2025-02-08 14:12:24,241 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 83 [2025-02-08 14:12:24,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 88 transitions, 333 flow. Second operand has 19 states, 19 states have (on average 41.8421052631579) internal successors, (795), 19 states have internal predecessors, (795), 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:12:24,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:12:24,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 83 [2025-02-08 14:12:24,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:12:29,718 INFO L124 PetriNetUnfolderBase]: 38092/76442 cut-off events. [2025-02-08 14:12:29,719 INFO L125 PetriNetUnfolderBase]: For 43034/46597 co-relation queries the response was YES. [2025-02-08 14:12:30,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168807 conditions, 76442 events. 38092/76442 cut-off events. For 43034/46597 co-relation queries the response was YES. Maximal size of possible extension queue 3791. Compared 889802 event pairs, 10512 based on Foata normal form. 3563/73735 useless extension candidates. Maximal degree in co-relation 168768. Up to 11096 conditions per place. [2025-02-08 14:12:30,322 INFO L140 encePairwiseOnDemand]: 72/83 looper letters, 275 selfloop transitions, 23 changer transitions 0/331 dead transitions. [2025-02-08 14:12:30,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 331 transitions, 1802 flow [2025-02-08 14:12:30,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-08 14:12:30,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-02-08 14:12:30,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 894 transitions. [2025-02-08 14:12:30,329 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6731927710843374 [2025-02-08 14:12:30,329 INFO L175 Difference]: Start difference. First operand has 113 places, 88 transitions, 333 flow. Second operand 16 states and 894 transitions. [2025-02-08 14:12:30,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 331 transitions, 1802 flow [2025-02-08 14:12:31,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 331 transitions, 1760 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 14:12:31,241 INFO L231 Difference]: Finished difference. Result has 129 places, 99 transitions, 440 flow [2025-02-08 14:12:31,242 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=440, PETRI_PLACES=129, PETRI_TRANSITIONS=99} [2025-02-08 14:12:31,243 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, 48 predicate places. [2025-02-08 14:12:31,243 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 99 transitions, 440 flow [2025-02-08 14:12:31,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 41.8421052631579) internal successors, (795), 19 states have internal predecessors, (795), 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:12:31,243 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:12:31,243 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:12:31,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-08 14:12:31,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:12:31,447 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-02-08 14:12:31,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:12:31,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1074390271, now seen corresponding path program 1 times [2025-02-08 14:12:31,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:12:31,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507476615] [2025-02-08 14:12:31,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:12:31,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:12:31,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 14:12:31,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 14:12:31,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:12:31,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:12:31,470 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:12:31,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:12:31,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507476615] [2025-02-08 14:12:31,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507476615] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:12:31,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:12:31,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:12:31,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063236098] [2025-02-08 14:12:31,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:12:31,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:12:31,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:12:31,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:12:31,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:12:31,485 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 83 [2025-02-08 14:12:31,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 99 transitions, 440 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-02-08 14:12:31,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:12:31,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 83 [2025-02-08 14:12:31,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:12:37,464 INFO L124 PetriNetUnfolderBase]: 40922/82161 cut-off events. [2025-02-08 14:12:37,465 INFO L125 PetriNetUnfolderBase]: For 50531/54065 co-relation queries the response was YES. [2025-02-08 14:12:37,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187373 conditions, 82161 events. 40922/82161 cut-off events. For 50531/54065 co-relation queries the response was YES. Maximal size of possible extension queue 3874. Compared 963364 event pairs, 21726 based on Foata normal form. 4212/79561 useless extension candidates. Maximal degree in co-relation 187327. Up to 31883 conditions per place. [2025-02-08 14:12:37,988 INFO L140 encePairwiseOnDemand]: 79/83 looper letters, 129 selfloop transitions, 3 changer transitions 0/166 dead transitions. [2025-02-08 14:12:37,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 166 transitions, 992 flow [2025-02-08 14:12:37,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:12:37,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:12:37,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 239 transitions. [2025-02-08 14:12:37,989 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7198795180722891 [2025-02-08 14:12:37,989 INFO L175 Difference]: Start difference. First operand has 129 places, 99 transitions, 440 flow. Second operand 4 states and 239 transitions. [2025-02-08 14:12:37,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 166 transitions, 992 flow [2025-02-08 14:12:38,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 166 transitions, 981 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 14:12:38,935 INFO L231 Difference]: Finished difference. Result has 127 places, 98 transitions, 429 flow [2025-02-08 14:12:38,935 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=423, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=429, PETRI_PLACES=127, PETRI_TRANSITIONS=98} [2025-02-08 14:12:38,935 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, 46 predicate places. [2025-02-08 14:12:38,935 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 98 transitions, 429 flow [2025-02-08 14:12:38,936 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-02-08 14:12:38,936 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:12:38,936 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:12:38,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 14:12:38,936 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-02-08 14:12:38,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:12:38,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1074391264, now seen corresponding path program 1 times [2025-02-08 14:12:38,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:12:38,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210014558] [2025-02-08 14:12:38,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:12:38,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:12:38,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 14:12:38,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 14:12:38,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:12:38,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:12:38,987 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:12:38,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:12:38,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210014558] [2025-02-08 14:12:38,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210014558] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:12:38,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:12:38,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:12:38,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695645425] [2025-02-08 14:12:38,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:12:38,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 14:12:38,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:12:38,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 14:12:38,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 14:12:39,027 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 83 [2025-02-08 14:12:39,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 98 transitions, 429 flow. Second operand has 5 states, 5 states have (on average 40.6) internal successors, (203), 5 states have internal predecessors, (203), 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:12:39,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:12:39,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 83 [2025-02-08 14:12:39,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand