./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/fibonacci.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/fibonacci.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 115f061be4541a19227bc1624a8b38d08b679b43ee58fd41d4a05fa6a8fd007e --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 14:09:37,981 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 14:09:38,046 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:09:38,053 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 14:09:38,055 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 14:09:38,078 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 14:09:38,079 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 14:09:38,079 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 14:09:38,079 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 14:09:38,079 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 14:09:38,079 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 14:09:38,080 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 14:09:38,080 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 14:09:38,080 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 14:09:38,080 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 14:09:38,080 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 14:09:38,080 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 14:09:38,080 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 14:09:38,080 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 14:09:38,081 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 14:09:38,081 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 14:09:38,081 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 14:09:38,081 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 14:09:38,081 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 14:09:38,081 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 14:09:38,081 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 14:09:38,081 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 14:09:38,081 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 14:09:38,081 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 14:09:38,081 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 14:09:38,081 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 14:09:38,082 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 14:09:38,082 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 14:09:38,082 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 14:09:38,082 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 14:09:38,082 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 14:09:38,082 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 14:09:38,082 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 14:09:38,082 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 14:09:38,082 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 14:09:38,082 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 14:09:38,082 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 14:09:38,083 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 14:09:38,083 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 14:09:38,083 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 14:09:38,083 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 -> 115f061be4541a19227bc1624a8b38d08b679b43ee58fd41d4a05fa6a8fd007e [2025-02-08 14:09:38,333 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 14:09:38,345 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 14:09:38,347 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 14:09:38,348 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 14:09:38,349 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 14:09:38,351 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/fibonacci.wvr.c [2025-02-08 14:09:39,625 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/26f243c1e/f4022e4e909943eda53fe41ac84e39a2/FLAG5a0e87aaf [2025-02-08 14:09:39,880 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 14:09:39,881 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/fibonacci.wvr.c [2025-02-08 14:09:39,891 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/26f243c1e/f4022e4e909943eda53fe41ac84e39a2/FLAG5a0e87aaf [2025-02-08 14:09:39,911 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/26f243c1e/f4022e4e909943eda53fe41ac84e39a2 [2025-02-08 14:09:39,916 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 14:09:39,918 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 14:09:39,920 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 14:09:39,920 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 14:09:39,923 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 14:09:39,924 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:09:39" (1/1) ... [2025-02-08 14:09:39,926 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b20bfe3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:09:39, skipping insertion in model container [2025-02-08 14:09:39,926 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:09:39" (1/1) ... [2025-02-08 14:09:39,942 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 14:09:40,079 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:09:40,088 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 14:09:40,110 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:09:40,126 INFO L204 MainTranslator]: Completed translation [2025-02-08 14:09:40,127 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:09:40 WrapperNode [2025-02-08 14:09:40,127 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 14:09:40,128 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 14:09:40,128 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 14:09:40,128 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 14:09:40,132 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:09:40" (1/1) ... [2025-02-08 14:09:40,141 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:09:40" (1/1) ... [2025-02-08 14:09:40,163 INFO L138 Inliner]: procedures = 22, calls = 19, calls flagged for inlining = 13, calls inlined = 17, statements flattened = 216 [2025-02-08 14:09:40,166 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 14:09:40,166 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 14:09:40,166 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 14:09:40,166 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 14:09:40,174 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:09:40" (1/1) ... [2025-02-08 14:09:40,175 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:09:40" (1/1) ... [2025-02-08 14:09:40,181 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:09:40" (1/1) ... [2025-02-08 14:09:40,202 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-08 14:09:40,202 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:09:40" (1/1) ... [2025-02-08 14:09:40,202 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:09:40" (1/1) ... [2025-02-08 14:09:40,206 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:09:40" (1/1) ... [2025-02-08 14:09:40,210 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:09:40" (1/1) ... [2025-02-08 14:09:40,211 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:09:40" (1/1) ... [2025-02-08 14:09:40,212 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:09:40" (1/1) ... [2025-02-08 14:09:40,213 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 14:09:40,214 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 14:09:40,214 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 14:09:40,214 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 14:09:40,215 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:09:40" (1/1) ... [2025-02-08 14:09:40,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 14:09:40,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:09:40,250 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:09:40,252 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:09:40,269 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 14:09:40,270 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 14:09:40,270 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 14:09:40,270 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 14:09:40,270 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 14:09:40,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 14:09:40,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 14:09:40,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 14:09:40,271 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:09:40,352 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 14:09:40,355 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 14:09:40,551 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35-2: assume 0 == assume_abort_if_not_~cond#1; [2025-02-08 14:09:40,551 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35-2: assume !(0 == assume_abort_if_not_~cond#1); [2025-02-08 14:09:40,551 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35-3: assume false; [2025-02-08 14:09:40,551 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L44-1: havoc #t~post3#1; [2025-02-08 14:09:40,551 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L44-2: assume 1 + #t~post3#1 <= 2147483647; [2025-02-08 14:09:40,552 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L44-2: assume !(1 + #t~post3#1 <= 2147483647); [2025-02-08 14:09:40,552 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L44-3: ~i~0#1 := 1 + #t~post3#1; [2025-02-08 14:09:40,552 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L44-4: assume 1 + #t~post3#1 >= -2147483648; [2025-02-08 14:09:40,552 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L44-4: assume !(1 + #t~post3#1 >= -2147483648); [2025-02-08 14:09:40,552 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L44-5: #t~post3#1 := ~i~0#1; [2025-02-08 14:09:40,552 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L45: havoc #t~ret1#1; [2025-02-08 14:09:40,552 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L45-1: ~f1_2~0 := #t~ret1#1; [2025-02-08 14:09:40,552 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L45-2: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret1#1 && #t~ret1#1 <= 2147483647; [2025-02-08 14:09:40,552 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L45-3: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 14:09:40,552 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L45-4: havoc plus_#t~short20#1, plus_#t~short21#1, plus_~a#1, plus_~b#1; [2025-02-08 14:09:40,553 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L45-5: #t~ret1#1 := plus_#res#1; [2025-02-08 14:09:40,553 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L46: havoc #t~ret2#1; [2025-02-08 14:09:40,553 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L46-1: ~f2_3~0 := #t~ret2#1; [2025-02-08 14:09:40,553 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L46-2: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret2#1 && #t~ret2#1 <= 2147483647; [2025-02-08 14:09:40,553 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L46-3: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 14:09:40,553 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L46-4: havoc minus_#t~short18#1, minus_#t~short19#1, minus_~a#1, minus_~b#1; [2025-02-08 14:09:40,553 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L46-5: #t~ret2#1 := minus_#res#1; [2025-02-08 14:09:40,553 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L46-6: havoc minus_#t~short18#1, minus_#t~short19#1, minus_~a#1, minus_~b#1; [2025-02-08 14:09:40,553 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L46-7: havoc minus_#res#1; [2025-02-08 14:09:40,554 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L46-8: assume { :begin_inline_minus } true;minus_#in~a#1, minus_#in~b#1 := ~f1_2~0, ~f2_3~0; [2025-02-08 14:09:40,554 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L89: minus_~b#1 := minus_#in~b#1; [2025-02-08 14:09:40,554 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L89-1: minus_~a#1 := minus_#in~a#1; [2025-02-08 14:09:40,554 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L90: assume { :end_inline_assume_abort_if_not } true;havoc minus_#t~short18#1; [2025-02-08 14:09:40,554 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L90-1: havoc assume_abort_if_not_#in~cond#1; [2025-02-08 14:09:40,554 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L90-2: havoc assume_abort_if_not_~cond#1; [2025-02-08 14:09:40,554 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L90-3: havoc assume_abort_if_not_~cond#1; [2025-02-08 14:09:40,554 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L90-4: assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if minus_#t~short18#1 then 1 else 0); [2025-02-08 14:09:40,554 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L90-5: assume minus_~b#1 - 2147483648 <= 9223372036854775807; [2025-02-08 14:09:40,555 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L90-5: assume !(minus_~b#1 - 2147483648 <= 9223372036854775807); [2025-02-08 14:09:40,555 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L90-6: minus_#t~short18#1 := minus_~a#1 >= minus_~b#1 - 2147483648; [2025-02-08 14:09:40,555 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L90-7: assume minus_~b#1 - 2147483648 >= -9223372036854775808; [2025-02-08 14:09:40,555 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L90-7: assume !(minus_~b#1 - 2147483648 >= -9223372036854775808); [2025-02-08 14:09:40,555 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L90-8: assume minus_#t~short18#1; [2025-02-08 14:09:40,555 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L90-8: assume !minus_#t~short18#1; [2025-02-08 14:09:40,555 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L90-9: minus_#t~short18#1 := minus_~b#1 <= 0; [2025-02-08 14:09:40,555 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L91: assume { :end_inline_assume_abort_if_not } true;havoc minus_#t~short19#1; [2025-02-08 14:09:40,555 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L91-1: havoc assume_abort_if_not_#in~cond#1; [2025-02-08 14:09:40,556 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L91-2: havoc assume_abort_if_not_~cond#1; [2025-02-08 14:09:40,556 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L91-3: havoc assume_abort_if_not_~cond#1; [2025-02-08 14:09:40,556 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L91-4: assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if minus_#t~short19#1 then 1 else 0); [2025-02-08 14:09:40,556 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L91-5: assume 2147483647 + minus_~b#1 <= 2147483647; [2025-02-08 14:09:40,556 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L91-5: assume !(2147483647 + minus_~b#1 <= 2147483647); [2025-02-08 14:09:40,556 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L91-6: minus_#t~short19#1 := minus_~a#1 <= 2147483647 + minus_~b#1; [2025-02-08 14:09:40,556 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L91-7: assume 2147483647 + minus_~b#1 >= -2147483648; [2025-02-08 14:09:40,556 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L91-7: assume !(2147483647 + minus_~b#1 >= -2147483648); [2025-02-08 14:09:40,556 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L91-8: assume minus_#t~short19#1; [2025-02-08 14:09:40,556 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L91-8: assume !minus_#t~short19#1; [2025-02-08 14:09:40,557 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L91-9: minus_#t~short19#1 := minus_~b#1 >= 0; [2025-02-08 14:09:40,557 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L34: assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; [2025-02-08 14:09:40,557 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L34-1: assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; [2025-02-08 14:09:40,557 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L92-1: assume minus_~a#1 - minus_~b#1 <= 2147483647; [2025-02-08 14:09:40,557 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L92-1: assume !(minus_~a#1 - minus_~b#1 <= 2147483647); [2025-02-08 14:09:40,557 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L92-2: minus_#res#1 := minus_~a#1 - minus_~b#1; [2025-02-08 14:09:40,557 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L92-3: assume minus_~a#1 - minus_~b#1 >= -2147483648; [2025-02-08 14:09:40,557 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L92-3: assume !(minus_~a#1 - minus_~b#1 >= -2147483648); [2025-02-08 14:09:40,557 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35: assume 0 == assume_abort_if_not_~cond#1; [2025-02-08 14:09:40,558 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35: assume !(0 == assume_abort_if_not_~cond#1); [2025-02-08 14:09:40,558 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35-1: assume false; [2025-02-08 14:09:40,706 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35-2: assume 0 == assume_abort_if_not_~cond#1; [2025-02-08 14:09:40,706 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35-2: assume !(0 == assume_abort_if_not_~cond#1); [2025-02-08 14:09:40,707 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35-3: assume false; [2025-02-08 14:09:40,707 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L54-1: havoc #t~post6#1; [2025-02-08 14:09:40,707 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L54-2: assume 1 + #t~post6#1 <= 2147483647; [2025-02-08 14:09:40,707 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L54-2: assume !(1 + #t~post6#1 <= 2147483647); [2025-02-08 14:09:40,707 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L54-3: ~i~1#1 := 1 + #t~post6#1; [2025-02-08 14:09:40,707 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L54-4: assume 1 + #t~post6#1 >= -2147483648; [2025-02-08 14:09:40,707 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L54-4: assume !(1 + #t~post6#1 >= -2147483648); [2025-02-08 14:09:40,707 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L54-5: #t~post6#1 := ~i~1#1; [2025-02-08 14:09:40,708 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55: havoc #t~ret4#1; [2025-02-08 14:09:40,708 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-1: ~f1_6~0 := #t~ret4#1; [2025-02-08 14:09:40,708 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-2: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret4#1 && #t~ret4#1 <= 2147483647; [2025-02-08 14:09:40,708 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-3: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 14:09:40,708 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-4: havoc plus_#t~short20#1, plus_#t~short21#1, plus_~a#1, plus_~b#1; [2025-02-08 14:09:40,708 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-5: #t~ret4#1 := plus_#res#1; [2025-02-08 14:09:40,708 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L89: minus_~b#1 := minus_#in~b#1; [2025-02-08 14:09:40,708 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56: havoc #t~ret5#1; [2025-02-08 14:09:40,708 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L89-1: minus_~a#1 := minus_#in~a#1; [2025-02-08 14:09:40,709 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-1: ~f2_7~0 := #t~ret5#1; [2025-02-08 14:09:40,709 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-2: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647; [2025-02-08 14:09:40,709 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-3: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 14:09:40,709 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-4: havoc minus_#t~short18#1, minus_#t~short19#1, minus_~a#1, minus_~b#1; [2025-02-08 14:09:40,709 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-5: #t~ret5#1 := minus_#res#1; [2025-02-08 14:09:40,709 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-6: havoc minus_#t~short18#1, minus_#t~short19#1, minus_~a#1, minus_~b#1; [2025-02-08 14:09:40,709 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-7: havoc minus_#res#1; [2025-02-08 14:09:40,709 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-8: assume { :begin_inline_minus } true;minus_#in~a#1, minus_#in~b#1 := ~f1_6~0, ~f2_7~0; [2025-02-08 14:09:40,710 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L90: assume { :end_inline_assume_abort_if_not } true;havoc minus_#t~short18#1; [2025-02-08 14:09:40,710 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L90-1: havoc assume_abort_if_not_#in~cond#1; [2025-02-08 14:09:40,711 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L90-2: havoc assume_abort_if_not_~cond#1; [2025-02-08 14:09:40,711 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L90-3: havoc assume_abort_if_not_~cond#1; [2025-02-08 14:09:40,711 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L90-4: assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if minus_#t~short18#1 then 1 else 0); [2025-02-08 14:09:40,711 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L90-5: assume minus_~b#1 - 2147483648 <= 9223372036854775807; [2025-02-08 14:09:40,711 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L90-5: assume !(minus_~b#1 - 2147483648 <= 9223372036854775807); [2025-02-08 14:09:40,711 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L90-6: minus_#t~short18#1 := minus_~a#1 >= minus_~b#1 - 2147483648; [2025-02-08 14:09:40,714 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L90-7: assume minus_~b#1 - 2147483648 >= -9223372036854775808; [2025-02-08 14:09:40,715 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L90-7: assume !(minus_~b#1 - 2147483648 >= -9223372036854775808); [2025-02-08 14:09:40,715 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L90-8: assume minus_#t~short18#1; [2025-02-08 14:09:40,715 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L90-8: assume !minus_#t~short18#1; [2025-02-08 14:09:40,715 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L90-9: minus_#t~short18#1 := minus_~b#1 <= 0; [2025-02-08 14:09:40,715 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L91: assume { :end_inline_assume_abort_if_not } true;havoc minus_#t~short19#1; [2025-02-08 14:09:40,715 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L91-1: havoc assume_abort_if_not_#in~cond#1; [2025-02-08 14:09:40,715 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L91-2: havoc assume_abort_if_not_~cond#1; [2025-02-08 14:09:40,715 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L91-3: havoc assume_abort_if_not_~cond#1; [2025-02-08 14:09:40,715 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L91-4: assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if minus_#t~short19#1 then 1 else 0); [2025-02-08 14:09:40,715 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L91-5: assume 2147483647 + minus_~b#1 <= 2147483647; [2025-02-08 14:09:40,715 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L91-5: assume !(2147483647 + minus_~b#1 <= 2147483647); [2025-02-08 14:09:40,715 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L91-6: minus_#t~short19#1 := minus_~a#1 <= 2147483647 + minus_~b#1; [2025-02-08 14:09:40,715 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L91-7: assume 2147483647 + minus_~b#1 >= -2147483648; [2025-02-08 14:09:40,715 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L91-7: assume !(2147483647 + minus_~b#1 >= -2147483648); [2025-02-08 14:09:40,715 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L91-8: assume minus_#t~short19#1; [2025-02-08 14:09:40,715 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L91-8: assume !minus_#t~short19#1; [2025-02-08 14:09:40,715 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L91-9: minus_#t~short19#1 := minus_~b#1 >= 0; [2025-02-08 14:09:40,715 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L34: assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; [2025-02-08 14:09:40,715 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L34-1: assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; [2025-02-08 14:09:40,715 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L92-1: assume minus_~a#1 - minus_~b#1 <= 2147483647; [2025-02-08 14:09:40,716 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L92-1: assume !(minus_~a#1 - minus_~b#1 <= 2147483647); [2025-02-08 14:09:40,716 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L92-2: minus_#res#1 := minus_~a#1 - minus_~b#1; [2025-02-08 14:09:40,716 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L92-3: assume minus_~a#1 - minus_~b#1 >= -2147483648; [2025-02-08 14:09:40,716 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L92-3: assume !(minus_~a#1 - minus_~b#1 >= -2147483648); [2025-02-08 14:09:40,716 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35: assume 0 == assume_abort_if_not_~cond#1; [2025-02-08 14:09:40,716 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35: assume !(0 == assume_abort_if_not_~cond#1); [2025-02-08 14:09:40,716 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35-1: assume false; [2025-02-08 14:09:40,788 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 14:09:40,788 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 14:09:40,914 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 14:09:40,914 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 14:09:40,915 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:09:40 BoogieIcfgContainer [2025-02-08 14:09:40,915 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 14:09:40,917 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 14:09:40,917 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 14:09:40,920 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 14:09:40,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 02:09:39" (1/3) ... [2025-02-08 14:09:40,921 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e37cecf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 02:09:40, skipping insertion in model container [2025-02-08 14:09:40,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:09:40" (2/3) ... [2025-02-08 14:09:40,921 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e37cecf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 02:09:40, skipping insertion in model container [2025-02-08 14:09:40,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:09:40" (3/3) ... [2025-02-08 14:09:40,922 INFO L128 eAbstractionObserver]: Analyzing ICFG fibonacci.wvr.c [2025-02-08 14:09:40,933 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 14:09:40,936 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fibonacci.wvr.c that has 3 procedures, 49 locations, 1 initial locations, 2 loop locations, and 28 error locations. [2025-02-08 14:09:40,936 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 14:09:40,983 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 14:09:41,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 52 transitions, 118 flow [2025-02-08 14:09:41,035 INFO L124 PetriNetUnfolderBase]: 4/50 cut-off events. [2025-02-08 14:09:41,037 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 14:09:41,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 50 events. 4/50 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 175 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2025-02-08 14:09:41,040 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 52 transitions, 118 flow [2025-02-08 14:09:41,043 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 48 transitions, 105 flow [2025-02-08 14:09:41,054 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 14:09:41,068 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;@7be5468c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 14:09:41,068 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-02-08 14:09:41,077 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 14:09:41,077 INFO L124 PetriNetUnfolderBase]: 1/16 cut-off events. [2025-02-08 14:09:41,077 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 14:09:41,078 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:41,078 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 14:09:41,079 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2025-02-08 14:09:41,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:41,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1714770147, now seen corresponding path program 1 times [2025-02-08 14:09:41,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:41,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977648531] [2025-02-08 14:09:41,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:41,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:41,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:09:41,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:09:41,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:41,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:41,328 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:09:41,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:41,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977648531] [2025-02-08 14:09:41,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977648531] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:09:41,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:09:41,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:09:41,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084835326] [2025-02-08 14:09:41,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:09:41,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:09:41,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:41,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:09:41,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:09:41,395 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 52 [2025-02-08 14:09:41,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 48 transitions, 105 flow. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 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:09:41,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:41,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 52 [2025-02-08 14:09:41,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:41,738 INFO L124 PetriNetUnfolderBase]: 500/1181 cut-off events. [2025-02-08 14:09:41,738 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-02-08 14:09:41,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2041 conditions, 1181 events. 500/1181 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 8188 event pairs, 159 based on Foata normal form. 40/969 useless extension candidates. Maximal degree in co-relation 1990. Up to 373 conditions per place. [2025-02-08 14:09:41,752 INFO L140 encePairwiseOnDemand]: 45/52 looper letters, 49 selfloop transitions, 4 changer transitions 0/73 dead transitions. [2025-02-08 14:09:41,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 73 transitions, 267 flow [2025-02-08 14:09:41,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:09:41,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:09:41,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 144 transitions. [2025-02-08 14:09:41,761 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6923076923076923 [2025-02-08 14:09:41,763 INFO L175 Difference]: Start difference. First operand has 51 places, 48 transitions, 105 flow. Second operand 4 states and 144 transitions. [2025-02-08 14:09:41,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 73 transitions, 267 flow [2025-02-08 14:09:41,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 73 transitions, 260 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 14:09:41,769 INFO L231 Difference]: Finished difference. Result has 53 places, 49 transitions, 126 flow [2025-02-08 14:09:41,772 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=126, PETRI_PLACES=53, PETRI_TRANSITIONS=49} [2025-02-08 14:09:41,777 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 2 predicate places. [2025-02-08 14:09:41,777 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 49 transitions, 126 flow [2025-02-08 14:09:41,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 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:09:41,777 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:41,777 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:09:41,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 14:09:41,778 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2025-02-08 14:09:41,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:41,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1618266522, now seen corresponding path program 1 times [2025-02-08 14:09:41,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:41,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055786182] [2025-02-08 14:09:41,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:41,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:41,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:09:41,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:09:41,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:41,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:41,881 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:09:41,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:41,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055786182] [2025-02-08 14:09:41,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055786182] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:09:41,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:09:41,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:09:41,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141241144] [2025-02-08 14:09:41,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:09:41,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:09:41,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:41,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:09:41,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:09:41,911 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 52 [2025-02-08 14:09:41,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 49 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 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:09:41,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:41,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 52 [2025-02-08 14:09:41,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:42,090 INFO L124 PetriNetUnfolderBase]: 385/961 cut-off events. [2025-02-08 14:09:42,090 INFO L125 PetriNetUnfolderBase]: For 170/174 co-relation queries the response was YES. [2025-02-08 14:09:42,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1814 conditions, 961 events. 385/961 cut-off events. For 170/174 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 6324 event pairs, 86 based on Foata normal form. 4/842 useless extension candidates. Maximal degree in co-relation 1526. Up to 485 conditions per place. [2025-02-08 14:09:42,097 INFO L140 encePairwiseOnDemand]: 49/52 looper letters, 33 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2025-02-08 14:09:42,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 59 transitions, 218 flow [2025-02-08 14:09:42,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:09:42,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:09:42,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2025-02-08 14:09:42,099 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6490384615384616 [2025-02-08 14:09:42,100 INFO L175 Difference]: Start difference. First operand has 53 places, 49 transitions, 126 flow. Second operand 4 states and 135 transitions. [2025-02-08 14:09:42,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 59 transitions, 218 flow [2025-02-08 14:09:42,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 59 transitions, 218 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 14:09:42,104 INFO L231 Difference]: Finished difference. Result has 55 places, 48 transitions, 128 flow [2025-02-08 14:09:42,104 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=128, PETRI_PLACES=55, PETRI_TRANSITIONS=48} [2025-02-08 14:09:42,108 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 4 predicate places. [2025-02-08 14:09:42,108 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 48 transitions, 128 flow [2025-02-08 14:09:42,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 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:09:42,108 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:42,108 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:09:42,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 14:09:42,108 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thread2Err13ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2025-02-08 14:09:42,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:42,109 INFO L85 PathProgramCache]: Analyzing trace with hash 441111980, now seen corresponding path program 1 times [2025-02-08 14:09:42,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:42,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026057080] [2025-02-08 14:09:42,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:42,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:42,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:09:42,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:09:42,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:42,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:42,187 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:09:42,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:42,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026057080] [2025-02-08 14:09:42,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026057080] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:09:42,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:09:42,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:09:42,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427423153] [2025-02-08 14:09:42,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:09:42,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:09:42,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:42,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:09:42,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:09:42,212 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 52 [2025-02-08 14:09:42,212 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 48 transitions, 128 flow. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 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:09:42,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:42,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 52 [2025-02-08 14:09:42,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:42,361 INFO L124 PetriNetUnfolderBase]: 382/940 cut-off events. [2025-02-08 14:09:42,362 INFO L125 PetriNetUnfolderBase]: For 222/249 co-relation queries the response was YES. [2025-02-08 14:09:42,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1759 conditions, 940 events. 382/940 cut-off events. For 222/249 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 6234 event pairs, 99 based on Foata normal form. 65/819 useless extension candidates. Maximal degree in co-relation 1463. Up to 422 conditions per place. [2025-02-08 14:09:42,368 INFO L140 encePairwiseOnDemand]: 48/52 looper letters, 34 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2025-02-08 14:09:42,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 57 transitions, 233 flow [2025-02-08 14:09:42,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:09:42,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:09:42,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 132 transitions. [2025-02-08 14:09:42,370 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6346153846153846 [2025-02-08 14:09:42,370 INFO L175 Difference]: Start difference. First operand has 55 places, 48 transitions, 128 flow. Second operand 4 states and 132 transitions. [2025-02-08 14:09:42,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 57 transitions, 233 flow [2025-02-08 14:09:42,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 57 transitions, 229 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 14:09:42,371 INFO L231 Difference]: Finished difference. Result has 54 places, 46 transitions, 125 flow [2025-02-08 14:09:42,371 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=125, PETRI_PLACES=54, PETRI_TRANSITIONS=46} [2025-02-08 14:09:42,372 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 3 predicate places. [2025-02-08 14:09:42,372 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 125 flow [2025-02-08 14:09:42,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 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:09:42,372 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:42,372 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:09:42,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 14:09:42,375 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2025-02-08 14:09:42,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:42,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1373315105, now seen corresponding path program 1 times [2025-02-08 14:09:42,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:42,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734460166] [2025-02-08 14:09:42,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:42,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:42,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:09:42,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:09:42,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:42,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:42,465 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:09:42,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:42,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734460166] [2025-02-08 14:09:42,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734460166] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:09:42,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:09:42,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:09:42,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328470957] [2025-02-08 14:09:42,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:09:42,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:09:42,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:42,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:09:42,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:09:42,495 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 52 [2025-02-08 14:09:42,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 125 flow. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 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:09:42,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:42,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 52 [2025-02-08 14:09:42,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:42,627 INFO L124 PetriNetUnfolderBase]: 389/937 cut-off events. [2025-02-08 14:09:42,627 INFO L125 PetriNetUnfolderBase]: For 253/257 co-relation queries the response was YES. [2025-02-08 14:09:42,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1845 conditions, 937 events. 389/937 cut-off events. For 253/257 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 5966 event pairs, 86 based on Foata normal form. 24/875 useless extension candidates. Maximal degree in co-relation 1557. Up to 505 conditions per place. [2025-02-08 14:09:42,632 INFO L140 encePairwiseOnDemand]: 49/52 looper letters, 34 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2025-02-08 14:09:42,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 56 transitions, 219 flow [2025-02-08 14:09:42,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:09:42,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:09:42,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2025-02-08 14:09:42,634 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6298076923076923 [2025-02-08 14:09:42,634 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 125 flow. Second operand 4 states and 131 transitions. [2025-02-08 14:09:42,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 56 transitions, 219 flow [2025-02-08 14:09:42,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 56 transitions, 215 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 14:09:42,636 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 122 flow [2025-02-08 14:09:42,636 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=122, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2025-02-08 14:09:42,639 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 3 predicate places. [2025-02-08 14:09:42,639 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 122 flow [2025-02-08 14:09:42,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 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:09:42,639 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:42,639 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:09:42,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 14:09:42,639 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread2Err12ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2025-02-08 14:09:42,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:42,640 INFO L85 PathProgramCache]: Analyzing trace with hash 789569996, now seen corresponding path program 1 times [2025-02-08 14:09:42,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:42,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239809283] [2025-02-08 14:09:42,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:42,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:42,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 14:09:42,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 14:09:42,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:42,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:42,695 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:09:42,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:42,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239809283] [2025-02-08 14:09:42,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239809283] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:09:42,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:09:42,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:09:42,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105214982] [2025-02-08 14:09:42,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:09:42,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:09:42,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:42,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:09:42,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:09:42,718 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 52 [2025-02-08 14:09:42,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:09:42,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:42,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 52 [2025-02-08 14:09:42,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:42,818 INFO L124 PetriNetUnfolderBase]: 308/838 cut-off events. [2025-02-08 14:09:42,818 INFO L125 PetriNetUnfolderBase]: For 176/187 co-relation queries the response was YES. [2025-02-08 14:09:42,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1543 conditions, 838 events. 308/838 cut-off events. For 176/187 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5656 event pairs, 99 based on Foata normal form. 11/713 useless extension candidates. Maximal degree in co-relation 1265. Up to 298 conditions per place. [2025-02-08 14:09:42,823 INFO L140 encePairwiseOnDemand]: 49/52 looper letters, 32 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2025-02-08 14:09:42,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 55 transitions, 226 flow [2025-02-08 14:09:42,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:09:42,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:09:42,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2025-02-08 14:09:42,825 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6394230769230769 [2025-02-08 14:09:42,825 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 122 flow. Second operand 4 states and 133 transitions. [2025-02-08 14:09:42,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 55 transitions, 226 flow [2025-02-08 14:09:42,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 55 transitions, 222 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 14:09:42,828 INFO L231 Difference]: Finished difference. Result has 54 places, 44 transitions, 121 flow [2025-02-08 14:09:42,830 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=121, PETRI_PLACES=54, PETRI_TRANSITIONS=44} [2025-02-08 14:09:42,830 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 3 predicate places. [2025-02-08 14:09:42,831 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 44 transitions, 121 flow [2025-02-08 14:09:42,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:09:42,831 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:42,831 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:09:42,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 14:09:42,831 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2025-02-08 14:09:42,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:42,831 INFO L85 PathProgramCache]: Analyzing trace with hash -376905208, now seen corresponding path program 1 times [2025-02-08 14:09:42,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:42,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516339730] [2025-02-08 14:09:42,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:42,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:42,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 14:09:42,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 14:09:42,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:42,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:42,946 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:09:42,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:42,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516339730] [2025-02-08 14:09:42,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516339730] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:09:42,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:09:42,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:09:42,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632385653] [2025-02-08 14:09:42,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:09:42,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 14:09:42,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:42,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 14:09:42,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 14:09:42,968 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 52 [2025-02-08 14:09:42,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 44 transitions, 121 flow. Second operand has 5 states, 5 states have (on average 24.6) internal successors, (123), 5 states have internal predecessors, (123), 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:09:42,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:42,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 52 [2025-02-08 14:09:42,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:43,112 INFO L124 PetriNetUnfolderBase]: 540/1074 cut-off events. [2025-02-08 14:09:43,113 INFO L125 PetriNetUnfolderBase]: For 155/155 co-relation queries the response was YES. [2025-02-08 14:09:43,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2284 conditions, 1074 events. 540/1074 cut-off events. For 155/155 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 6233 event pairs, 98 based on Foata normal form. 0/976 useless extension candidates. Maximal degree in co-relation 1960. Up to 591 conditions per place. [2025-02-08 14:09:43,119 INFO L140 encePairwiseOnDemand]: 47/52 looper letters, 45 selfloop transitions, 4 changer transitions 0/65 dead transitions. [2025-02-08 14:09:43,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 65 transitions, 271 flow [2025-02-08 14:09:43,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 14:09:43,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 14:09:43,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 165 transitions. [2025-02-08 14:09:43,120 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6346153846153846 [2025-02-08 14:09:43,120 INFO L175 Difference]: Start difference. First operand has 54 places, 44 transitions, 121 flow. Second operand 5 states and 165 transitions. [2025-02-08 14:09:43,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 65 transitions, 271 flow [2025-02-08 14:09:43,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 65 transitions, 266 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 14:09:43,122 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 124 flow [2025-02-08 14:09:43,123 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=124, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2025-02-08 14:09:43,123 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 4 predicate places. [2025-02-08 14:09:43,123 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 124 flow [2025-02-08 14:09:43,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.6) internal successors, (123), 5 states have internal predecessors, (123), 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:09:43,123 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:43,123 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:09:43,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 14:09:43,124 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2025-02-08 14:09:43,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:43,125 INFO L85 PathProgramCache]: Analyzing trace with hash -376904215, now seen corresponding path program 1 times [2025-02-08 14:09:43,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:43,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916994623] [2025-02-08 14:09:43,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:43,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:43,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 14:09:43,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 14:09:43,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:43,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:43,168 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:09:43,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:43,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916994623] [2025-02-08 14:09:43,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916994623] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:09:43,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:09:43,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:09:43,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613985620] [2025-02-08 14:09:43,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:09:43,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:09:43,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:43,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:09:43,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:09:43,189 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 52 [2025-02-08 14:09:43,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 124 flow. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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:09:43,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:43,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 52 [2025-02-08 14:09:43,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:43,318 INFO L124 PetriNetUnfolderBase]: 425/967 cut-off events. [2025-02-08 14:09:43,318 INFO L125 PetriNetUnfolderBase]: For 282/282 co-relation queries the response was YES. [2025-02-08 14:09:43,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2016 conditions, 967 events. 425/967 cut-off events. For 282/282 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 6072 event pairs, 195 based on Foata normal form. 20/886 useless extension candidates. Maximal degree in co-relation 1716. Up to 372 conditions per place. [2025-02-08 14:09:43,323 INFO L140 encePairwiseOnDemand]: 48/52 looper letters, 47 selfloop transitions, 3 changer transitions 0/66 dead transitions. [2025-02-08 14:09:43,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 66 transitions, 274 flow [2025-02-08 14:09:43,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:09:43,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:09:43,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2025-02-08 14:09:43,324 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6682692307692307 [2025-02-08 14:09:43,324 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 124 flow. Second operand 4 states and 139 transitions. [2025-02-08 14:09:43,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 66 transitions, 274 flow [2025-02-08 14:09:43,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 66 transitions, 269 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 14:09:43,328 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 119 flow [2025-02-08 14:09:43,328 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=119, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2025-02-08 14:09:43,329 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 4 predicate places. [2025-02-08 14:09:43,329 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 119 flow [2025-02-08 14:09:43,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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:09:43,330 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:43,330 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:09:43,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 14:09:43,330 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2025-02-08 14:09:43,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:43,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1200840932, now seen corresponding path program 1 times [2025-02-08 14:09:43,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:43,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664829467] [2025-02-08 14:09:43,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:43,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:43,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 14:09:43,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 14:09:43,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:43,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:43,417 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:09:43,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:43,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664829467] [2025-02-08 14:09:43,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664829467] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:09:43,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:09:43,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 14:09:43,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285008482] [2025-02-08 14:09:43,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:09:43,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 14:09:43,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:43,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 14:09:43,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 14:09:43,460 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 52 [2025-02-08 14:09:43,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 119 flow. Second operand has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 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:09:43,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:43,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 52 [2025-02-08 14:09:43,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:43,639 INFO L124 PetriNetUnfolderBase]: 518/1044 cut-off events. [2025-02-08 14:09:43,639 INFO L125 PetriNetUnfolderBase]: For 202/206 co-relation queries the response was YES. [2025-02-08 14:09:43,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2290 conditions, 1044 events. 518/1044 cut-off events. For 202/206 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 6191 event pairs, 58 based on Foata normal form. 4/951 useless extension candidates. Maximal degree in co-relation 1966. Up to 377 conditions per place. [2025-02-08 14:09:43,643 INFO L140 encePairwiseOnDemand]: 45/52 looper letters, 53 selfloop transitions, 7 changer transitions 0/75 dead transitions. [2025-02-08 14:09:43,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 75 transitions, 317 flow [2025-02-08 14:09:43,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:09:43,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 14:09:43,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 180 transitions. [2025-02-08 14:09:43,645 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5769230769230769 [2025-02-08 14:09:43,645 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 119 flow. Second operand 6 states and 180 transitions. [2025-02-08 14:09:43,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 75 transitions, 317 flow [2025-02-08 14:09:43,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 75 transitions, 312 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 14:09:43,647 INFO L231 Difference]: Finished difference. Result has 58 places, 42 transitions, 135 flow [2025-02-08 14:09:43,647 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=135, PETRI_PLACES=58, PETRI_TRANSITIONS=42} [2025-02-08 14:09:43,647 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 7 predicate places. [2025-02-08 14:09:43,648 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 42 transitions, 135 flow [2025-02-08 14:09:43,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 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:09:43,648 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:43,648 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:09:43,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 14:09:43,648 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2025-02-08 14:09:43,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:43,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1433383282, now seen corresponding path program 1 times [2025-02-08 14:09:43,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:43,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106742097] [2025-02-08 14:09:43,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:43,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:43,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:09:43,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:09:43,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:43,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:43,744 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:09:43,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:43,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106742097] [2025-02-08 14:09:43,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106742097] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:09:43,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:09:43,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:09:43,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744512569] [2025-02-08 14:09:43,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:09:43,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 14:09:43,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:43,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 14:09:43,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 14:09:43,774 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 52 [2025-02-08 14:09:43,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 42 transitions, 135 flow. Second operand has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 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:09:43,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:43,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 52 [2025-02-08 14:09:43,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:43,904 INFO L124 PetriNetUnfolderBase]: 494/1005 cut-off events. [2025-02-08 14:09:43,904 INFO L125 PetriNetUnfolderBase]: For 813/881 co-relation queries the response was YES. [2025-02-08 14:09:43,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2380 conditions, 1005 events. 494/1005 cut-off events. For 813/881 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 6028 event pairs, 103 based on Foata normal form. 58/949 useless extension candidates. Maximal degree in co-relation 2032. Up to 422 conditions per place. [2025-02-08 14:09:43,908 INFO L140 encePairwiseOnDemand]: 47/52 looper letters, 49 selfloop transitions, 4 changer transitions 0/66 dead transitions. [2025-02-08 14:09:43,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 66 transitions, 347 flow [2025-02-08 14:09:43,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 14:09:43,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 14:09:43,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 163 transitions. [2025-02-08 14:09:43,911 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6269230769230769 [2025-02-08 14:09:43,911 INFO L175 Difference]: Start difference. First operand has 58 places, 42 transitions, 135 flow. Second operand 5 states and 163 transitions. [2025-02-08 14:09:43,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 66 transitions, 347 flow [2025-02-08 14:09:43,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 66 transitions, 333 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 14:09:43,914 INFO L231 Difference]: Finished difference. Result has 59 places, 42 transitions, 142 flow [2025-02-08 14:09:43,914 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=142, PETRI_PLACES=59, PETRI_TRANSITIONS=42} [2025-02-08 14:09:43,915 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 8 predicate places. [2025-02-08 14:09:43,915 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 42 transitions, 142 flow [2025-02-08 14:09:43,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 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:09:43,915 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:43,915 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:09:43,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 14:09:43,915 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2025-02-08 14:09:43,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:43,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1433382289, now seen corresponding path program 1 times [2025-02-08 14:09:43,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:43,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821085508] [2025-02-08 14:09:43,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:43,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:43,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:09:43,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:09:43,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:43,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:43,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:09:43,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:43,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821085508] [2025-02-08 14:09:43,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821085508] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:09:43,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:09:43,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:09:43,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466677583] [2025-02-08 14:09:43,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:09:43,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:09:43,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:43,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:09:43,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:09:43,972 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 52 [2025-02-08 14:09:43,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 42 transitions, 142 flow. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 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:09:43,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:43,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 52 [2025-02-08 14:09:43,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:44,118 INFO L124 PetriNetUnfolderBase]: 568/1289 cut-off events. [2025-02-08 14:09:44,118 INFO L125 PetriNetUnfolderBase]: For 623/701 co-relation queries the response was YES. [2025-02-08 14:09:44,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2983 conditions, 1289 events. 568/1289 cut-off events. For 623/701 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 8653 event pairs, 278 based on Foata normal form. 68/1268 useless extension candidates. Maximal degree in co-relation 2592. Up to 522 conditions per place. [2025-02-08 14:09:44,126 INFO L140 encePairwiseOnDemand]: 47/52 looper letters, 51 selfloop transitions, 4 changer transitions 0/69 dead transitions. [2025-02-08 14:09:44,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 69 transitions, 356 flow [2025-02-08 14:09:44,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:09:44,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:09:44,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 138 transitions. [2025-02-08 14:09:44,127 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6634615384615384 [2025-02-08 14:09:44,127 INFO L175 Difference]: Start difference. First operand has 59 places, 42 transitions, 142 flow. Second operand 4 states and 138 transitions. [2025-02-08 14:09:44,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 69 transitions, 356 flow [2025-02-08 14:09:44,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 69 transitions, 353 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 14:09:44,130 INFO L231 Difference]: Finished difference. Result has 62 places, 43 transitions, 158 flow [2025-02-08 14:09:44,130 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=158, PETRI_PLACES=62, PETRI_TRANSITIONS=43} [2025-02-08 14:09:44,130 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 11 predicate places. [2025-02-08 14:09:44,130 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 43 transitions, 158 flow [2025-02-08 14:09:44,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 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:09:44,131 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:44,131 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:09:44,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 14:09:44,131 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2025-02-08 14:09:44,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:44,131 INFO L85 PathProgramCache]: Analyzing trace with hash -509947345, now seen corresponding path program 1 times [2025-02-08 14:09:44,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:44,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141310985] [2025-02-08 14:09:44,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:44,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:44,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:09:44,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:09:44,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:44,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:44,180 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:09:44,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:44,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141310985] [2025-02-08 14:09:44,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141310985] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:09:44,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:09:44,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 14:09:44,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919256501] [2025-02-08 14:09:44,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:09:44,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 14:09:44,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:44,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 14:09:44,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 14:09:44,212 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 52 [2025-02-08 14:09:44,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 43 transitions, 158 flow. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:09:44,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:44,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 52 [2025-02-08 14:09:44,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:44,398 INFO L124 PetriNetUnfolderBase]: 679/1376 cut-off events. [2025-02-08 14:09:44,399 INFO L125 PetriNetUnfolderBase]: For 655/690 co-relation queries the response was YES. [2025-02-08 14:09:44,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3590 conditions, 1376 events. 679/1376 cut-off events. For 655/690 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 8560 event pairs, 267 based on Foata normal form. 51/1382 useless extension candidates. Maximal degree in co-relation 3179. Up to 537 conditions per place. [2025-02-08 14:09:44,405 INFO L140 encePairwiseOnDemand]: 46/52 looper letters, 68 selfloop transitions, 7 changer transitions 10/97 dead transitions. [2025-02-08 14:09:44,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 97 transitions, 528 flow [2025-02-08 14:09:44,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:09:44,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 14:09:44,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 196 transitions. [2025-02-08 14:09:44,406 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6282051282051282 [2025-02-08 14:09:44,406 INFO L175 Difference]: Start difference. First operand has 62 places, 43 transitions, 158 flow. Second operand 6 states and 196 transitions. [2025-02-08 14:09:44,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 97 transitions, 528 flow [2025-02-08 14:09:44,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 97 transitions, 512 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-02-08 14:09:44,411 INFO L231 Difference]: Finished difference. Result has 65 places, 42 transitions, 172 flow [2025-02-08 14:09:44,412 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=172, PETRI_PLACES=65, PETRI_TRANSITIONS=42} [2025-02-08 14:09:44,412 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 14 predicate places. [2025-02-08 14:09:44,412 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 42 transitions, 172 flow [2025-02-08 14:09:44,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:09:44,412 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:44,412 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:09:44,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 14:09:44,413 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2025-02-08 14:09:44,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:44,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1485208269, now seen corresponding path program 1 times [2025-02-08 14:09:44,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:44,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814303228] [2025-02-08 14:09:44,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:44,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:44,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 14:09:44,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 14:09:44,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:44,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:44,504 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:09:44,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:44,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814303228] [2025-02-08 14:09:44,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814303228] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:09:44,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:09:44,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 14:09:44,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416614417] [2025-02-08 14:09:44,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:09:44,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 14:09:44,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:44,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 14:09:44,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 14:09:44,534 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 52 [2025-02-08 14:09:44,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 42 transitions, 172 flow. Second operand has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 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:09:44,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:44,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 52 [2025-02-08 14:09:44,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:44,700 INFO L124 PetriNetUnfolderBase]: 568/1151 cut-off events. [2025-02-08 14:09:44,700 INFO L125 PetriNetUnfolderBase]: For 1524/1596 co-relation queries the response was YES. [2025-02-08 14:09:44,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3151 conditions, 1151 events. 568/1151 cut-off events. For 1524/1596 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 7026 event pairs, 68 based on Foata normal form. 122/1211 useless extension candidates. Maximal degree in co-relation 2745. Up to 335 conditions per place. [2025-02-08 14:09:44,704 INFO L140 encePairwiseOnDemand]: 45/52 looper letters, 58 selfloop transitions, 4 changer transitions 7/81 dead transitions. [2025-02-08 14:09:44,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 81 transitions, 500 flow [2025-02-08 14:09:44,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:09:44,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 14:09:44,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 175 transitions. [2025-02-08 14:09:44,705 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5608974358974359 [2025-02-08 14:09:44,705 INFO L175 Difference]: Start difference. First operand has 65 places, 42 transitions, 172 flow. Second operand 6 states and 175 transitions. [2025-02-08 14:09:44,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 81 transitions, 500 flow [2025-02-08 14:09:44,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 81 transitions, 466 flow, removed 8 selfloop flow, removed 2 redundant places. [2025-02-08 14:09:44,708 INFO L231 Difference]: Finished difference. Result has 65 places, 35 transitions, 148 flow [2025-02-08 14:09:44,708 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=148, PETRI_PLACES=65, PETRI_TRANSITIONS=35} [2025-02-08 14:09:44,708 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 14 predicate places. [2025-02-08 14:09:44,708 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 35 transitions, 148 flow [2025-02-08 14:09:44,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 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:09:44,709 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:44,709 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:09:44,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 14:09:44,709 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2025-02-08 14:09:44,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:44,709 INFO L85 PathProgramCache]: Analyzing trace with hash 2121873365, now seen corresponding path program 1 times [2025-02-08 14:09:44,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:44,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479579413] [2025-02-08 14:09:44,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:44,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:44,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 14:09:44,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:09:44,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:44,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:44,736 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:09:44,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:44,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479579413] [2025-02-08 14:09:44,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479579413] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:09:44,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:09:44,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:09:44,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843967897] [2025-02-08 14:09:44,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:09:44,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:09:44,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:44,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:09:44,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:09:44,757 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 52 [2025-02-08 14:09:44,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 35 transitions, 148 flow. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 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:09:44,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:44,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 52 [2025-02-08 14:09:44,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:44,839 INFO L124 PetriNetUnfolderBase]: 222/517 cut-off events. [2025-02-08 14:09:44,839 INFO L125 PetriNetUnfolderBase]: For 585/614 co-relation queries the response was YES. [2025-02-08 14:09:44,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1509 conditions, 517 events. 222/517 cut-off events. For 585/614 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2782 event pairs, 138 based on Foata normal form. 54/554 useless extension candidates. Maximal degree in co-relation 1428. Up to 274 conditions per place. [2025-02-08 14:09:44,842 INFO L140 encePairwiseOnDemand]: 49/52 looper letters, 0 selfloop transitions, 0 changer transitions 60/60 dead transitions. [2025-02-08 14:09:44,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 60 transitions, 350 flow [2025-02-08 14:09:44,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:09:44,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:09:44,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 128 transitions. [2025-02-08 14:09:44,843 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6153846153846154 [2025-02-08 14:09:44,843 INFO L175 Difference]: Start difference. First operand has 65 places, 35 transitions, 148 flow. Second operand 4 states and 128 transitions. [2025-02-08 14:09:44,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 60 transitions, 350 flow [2025-02-08 14:09:44,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 60 transitions, 337 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-02-08 14:09:44,845 INFO L231 Difference]: Finished difference. Result has 56 places, 0 transitions, 0 flow [2025-02-08 14:09:44,845 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=56, PETRI_TRANSITIONS=0} [2025-02-08 14:09:44,846 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 5 predicate places. [2025-02-08 14:09:44,846 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 0 transitions, 0 flow [2025-02-08 14:09:44,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 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:09:44,848 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 26 remaining) [2025-02-08 14:09:44,848 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 26 remaining) [2025-02-08 14:09:44,848 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 26 remaining) [2025-02-08 14:09:44,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 26 remaining) [2025-02-08 14:09:44,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 26 remaining) [2025-02-08 14:09:44,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 26 remaining) [2025-02-08 14:09:44,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 26 remaining) [2025-02-08 14:09:44,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 26 remaining) [2025-02-08 14:09:44,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 26 remaining) [2025-02-08 14:09:44,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 26 remaining) [2025-02-08 14:09:44,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 26 remaining) [2025-02-08 14:09:44,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 26 remaining) [2025-02-08 14:09:44,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 26 remaining) [2025-02-08 14:09:44,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 26 remaining) [2025-02-08 14:09:44,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 26 remaining) [2025-02-08 14:09:44,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 26 remaining) [2025-02-08 14:09:44,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 26 remaining) [2025-02-08 14:09:44,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 26 remaining) [2025-02-08 14:09:44,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 26 remaining) [2025-02-08 14:09:44,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 26 remaining) [2025-02-08 14:09:44,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 26 remaining) [2025-02-08 14:09:44,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 26 remaining) [2025-02-08 14:09:44,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 26 remaining) [2025-02-08 14:09:44,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 26 remaining) [2025-02-08 14:09:44,850 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 26 remaining) [2025-02-08 14:09:44,850 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 26 remaining) [2025-02-08 14:09:44,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 14:09:44,850 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:09:44,854 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 14:09:44,855 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 14:09:44,860 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 02:09:44 BasicIcfg [2025-02-08 14:09:44,860 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 14:09:44,861 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 14:09:44,861 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 14:09:44,861 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 14:09:44,861 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:09:40" (3/4) ... [2025-02-08 14:09:44,862 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 14:09:44,864 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 14:09:44,864 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 14:09:44,868 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 53 nodes and edges [2025-02-08 14:09:44,868 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 24 nodes and edges [2025-02-08 14:09:44,868 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-02-08 14:09:44,869 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-08 14:09:44,927 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 14:09:44,927 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 14:09:44,927 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 14:09:44,928 INFO L158 Benchmark]: Toolchain (without parser) took 5010.12ms. Allocated memory was 167.8MB in the beginning and 209.7MB in the end (delta: 41.9MB). Free memory was 122.5MB in the beginning and 79.6MB in the end (delta: 42.9MB). Peak memory consumption was 85.4MB. Max. memory is 16.1GB. [2025-02-08 14:09:44,928 INFO L158 Benchmark]: CDTParser took 1.16ms. Allocated memory is still 201.3MB. Free memory is still 120.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:09:44,928 INFO L158 Benchmark]: CACSL2BoogieTranslator took 207.41ms. Allocated memory is still 167.8MB. Free memory was 122.2MB in the beginning and 110.7MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 14:09:44,928 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.21ms. Allocated memory is still 167.8MB. Free memory was 110.7MB in the beginning and 108.5MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:09:44,929 INFO L158 Benchmark]: Boogie Preprocessor took 47.09ms. Allocated memory is still 167.8MB. Free memory was 108.5MB in the beginning and 107.0MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 14:09:44,930 INFO L158 Benchmark]: IcfgBuilder took 700.79ms. Allocated memory is still 167.8MB. Free memory was 107.0MB in the beginning and 64.8MB in the end (delta: 42.2MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-08 14:09:44,931 INFO L158 Benchmark]: TraceAbstraction took 3943.66ms. Allocated memory was 167.8MB in the beginning and 209.7MB in the end (delta: 41.9MB). Free memory was 64.4MB in the beginning and 85.8MB in the end (delta: -21.3MB). Peak memory consumption was 18.3MB. Max. memory is 16.1GB. [2025-02-08 14:09:44,931 INFO L158 Benchmark]: Witness Printer took 66.35ms. Allocated memory is still 209.7MB. Free memory was 85.8MB in the beginning and 79.6MB in the end (delta: 6.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 14:09:44,932 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.16ms. Allocated memory is still 201.3MB. Free memory is still 120.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 207.41ms. Allocated memory is still 167.8MB. Free memory was 122.2MB in the beginning and 110.7MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.21ms. Allocated memory is still 167.8MB. Free memory was 110.7MB in the beginning and 108.5MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 47.09ms. Allocated memory is still 167.8MB. Free memory was 108.5MB in the beginning and 107.0MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 700.79ms. Allocated memory is still 167.8MB. Free memory was 107.0MB in the beginning and 64.8MB in the end (delta: 42.2MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 3943.66ms. Allocated memory was 167.8MB in the beginning and 209.7MB in the end (delta: 41.9MB). Free memory was 64.4MB in the beginning and 85.8MB in the end (delta: -21.3MB). Peak memory consumption was 18.3MB. Max. memory is 16.1GB. * Witness Printer took 66.35ms. Allocated memory is still 209.7MB. Free memory was 85.8MB in the beginning and 79.6MB in the end (delta: 6.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 96]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 96]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 97]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 98]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 97]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 98]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 96]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 96]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 97]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 98]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 97]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 98]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 91 locations, 26 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.8s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 912 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 714 mSDsluCounter, 190 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 93 mSDsCounter, 65 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1531 IncrementalHoareTripleChecker+Invalid, 1596 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 65 mSolverCounterUnsat, 97 mSDtfsCounter, 1531 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=172occurred in iteration=11, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 124 NumberOfCodeBlocks, 124 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 111 ConstructedInterpolants, 0 QuantifiedInterpolants, 423 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 28 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 14:09:44,944 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE