./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/chl-collitem-subst.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-collitem-subst.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 e60e484eb5ab810972130a1d83dccbab591b96ac9007b9b56059ed6674807329 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 14:07:40,487 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 14:07:40,541 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-08 14:07:40,550 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 14:07:40,550 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 14:07:40,571 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 14:07:40,572 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 14:07:40,572 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 14:07:40,573 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 14:07:40,573 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 14:07:40,573 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 14:07:40,574 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 14:07:40,574 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 14:07:40,574 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 14:07:40,574 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 14:07:40,574 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 14:07:40,575 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 14:07:40,575 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 14:07:40,575 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 14:07:40,575 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 14:07:40,575 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 14:07:40,575 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 14:07:40,575 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 14:07:40,575 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 14:07:40,575 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 14:07:40,575 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 14:07:40,576 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 14:07:40,576 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 14:07:40,576 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 14:07:40,576 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 14:07:40,576 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 14:07:40,576 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 14:07:40,576 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 14:07:40,577 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 14:07:40,577 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 14:07:40,577 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 14:07:40,577 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 14:07:40,577 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 14:07:40,577 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 14:07:40,577 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 14:07:40,577 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 14:07:40,577 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 14:07:40,577 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 14:07:40,577 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 14:07:40,577 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 14:07:40,578 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 -> e60e484eb5ab810972130a1d83dccbab591b96ac9007b9b56059ed6674807329 [2025-02-08 14:07:40,850 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 14:07:40,857 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 14:07:40,860 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 14:07:40,861 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 14:07:40,862 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 14:07:40,863 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-collitem-subst.wvr.c [2025-02-08 14:07:42,062 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/328e31aca/2592eda462fb4c9bbb5efdce90c33e17/FLAGa5b337065 [2025-02-08 14:07:42,316 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 14:07:42,316 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-collitem-subst.wvr.c [2025-02-08 14:07:42,333 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/328e31aca/2592eda462fb4c9bbb5efdce90c33e17/FLAGa5b337065 [2025-02-08 14:07:42,651 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/328e31aca/2592eda462fb4c9bbb5efdce90c33e17 [2025-02-08 14:07:42,653 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 14:07:42,655 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 14:07:42,656 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 14:07:42,656 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 14:07:42,660 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 14:07:42,660 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:07:42" (1/1) ... [2025-02-08 14:07:42,661 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@592d0077 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:07:42, skipping insertion in model container [2025-02-08 14:07:42,661 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:07:42" (1/1) ... [2025-02-08 14:07:42,673 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 14:07:42,851 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:07:42,866 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 14:07:42,894 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:07:42,910 INFO L204 MainTranslator]: Completed translation [2025-02-08 14:07:42,911 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:07:42 WrapperNode [2025-02-08 14:07:42,911 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 14:07:42,912 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 14:07:42,913 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 14:07:42,913 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 14:07:42,918 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:07:42" (1/1) ... [2025-02-08 14:07:42,927 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:07:42" (1/1) ... [2025-02-08 14:07:42,972 INFO L138 Inliner]: procedures = 22, calls = 32, calls flagged for inlining = 19, calls inlined = 41, statements flattened = 519 [2025-02-08 14:07:42,972 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 14:07:42,973 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 14:07:42,973 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 14:07:42,973 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 14:07:42,983 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:07:42" (1/1) ... [2025-02-08 14:07:42,983 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:07:42" (1/1) ... [2025-02-08 14:07:42,991 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:07:42" (1/1) ... [2025-02-08 14:07:43,017 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:07:43,018 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:07:42" (1/1) ... [2025-02-08 14:07:43,018 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:07:42" (1/1) ... [2025-02-08 14:07:43,024 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:07:42" (1/1) ... [2025-02-08 14:07:43,026 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:07:42" (1/1) ... [2025-02-08 14:07:43,027 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:07:42" (1/1) ... [2025-02-08 14:07:43,028 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:07:42" (1/1) ... [2025-02-08 14:07:43,031 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 14:07:43,032 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 14:07:43,032 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 14:07:43,032 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 14:07:43,033 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:07:42" (1/1) ... [2025-02-08 14:07:43,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 14:07:43,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:07:43,077 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 14:07:43,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 14:07:43,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 14:07:43,109 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 14:07:43,109 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 14:07:43,109 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 14:07:43,109 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 14:07:43,109 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 14:07:43,109 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 14:07:43,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 14:07:43,109 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 14:07:43,110 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 14:07:43,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 14:07:43,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 14:07:43,111 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 14:07:43,193 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 14:07:43,196 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 14:07:43,491 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L45-3: #t~ite3#1 := #t~ret2#1; [2025-02-08 14:07:43,491 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L45-4: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret2#1 && #t~ret2#1 <= 2147483647; [2025-02-08 14:07:43,491 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L45-5: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 14:07:43,491 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L45-6: havoc minus_#t~short40#1, minus_#t~short41#1, minus_~a#1, minus_~b#1; [2025-02-08 14:07:43,491 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L45-7: #t~ret2#1 := minus_#res#1; [2025-02-08 14:07:43,491 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L46-3: #t~ite5#1 := #t~ret4#1; [2025-02-08 14:07:43,491 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L46-4: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret4#1 && #t~ret4#1 <= 2147483647; [2025-02-08 14:07:43,491 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L46-5: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 14:07:43,492 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L46-6: havoc minus_#t~short40#1, minus_#t~short41#1, minus_~a#1, minus_~b#1; [2025-02-08 14:07:43,492 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L46-7: #t~ret4#1 := minus_#res#1; [2025-02-08 14:07:43,492 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-3: #t~ite7#1 := #t~ret6#1; [2025-02-08 14:07:43,492 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-4: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647; [2025-02-08 14:07:43,492 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-5: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 14:07:43,492 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-6: havoc minus_#t~short40#1, minus_#t~short41#1, minus_~a#1, minus_~b#1; [2025-02-08 14:07:43,492 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-7: #t~ret6#1 := minus_#res#1; [2025-02-08 14:07:43,647 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-3: #t~ite10#1 := #t~ret9#1; [2025-02-08 14:07:43,647 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-4: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret9#1 && #t~ret9#1 <= 2147483647; [2025-02-08 14:07:43,647 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-5: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 14:07:43,647 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-6: havoc minus_#t~short40#1, minus_#t~short41#1, minus_~a#1, minus_~b#1; [2025-02-08 14:07:43,648 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-7: #t~ret9#1 := minus_#res#1; [2025-02-08 14:07:43,648 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L57-3: #t~ite12#1 := #t~ret11#1; [2025-02-08 14:07:43,648 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L57-4: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret11#1 && #t~ret11#1 <= 2147483647; [2025-02-08 14:07:43,648 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L57-5: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 14:07:43,648 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L57-6: havoc minus_#t~short40#1, minus_#t~short41#1, minus_~a#1, minus_~b#1; [2025-02-08 14:07:43,648 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L57-7: #t~ret11#1 := minus_#res#1; [2025-02-08 14:07:43,648 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L58-3: #t~ite14#1 := #t~ret13#1; [2025-02-08 14:07:43,648 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L58-4: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret13#1 && #t~ret13#1 <= 2147483647; [2025-02-08 14:07:43,648 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L58-5: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 14:07:43,648 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L58-6: havoc minus_#t~short40#1, minus_#t~short41#1, minus_~a#1, minus_~b#1; [2025-02-08 14:07:43,648 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L58-7: #t~ret13#1 := minus_#res#1; [2025-02-08 14:07:43,783 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-3: #t~ite19#1 := #t~ret18#1; [2025-02-08 14:07:43,784 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-4: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret18#1 && #t~ret18#1 <= 2147483647; [2025-02-08 14:07:43,784 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-5: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 14:07:43,784 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-6: havoc minus_#t~short40#1, minus_#t~short41#1, minus_~a#1, minus_~b#1; [2025-02-08 14:07:43,784 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-7: #t~ret18#1 := minus_#res#1; [2025-02-08 14:07:43,784 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-3: #t~ite21#1 := #t~ret20#1; [2025-02-08 14:07:43,784 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-4: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret20#1 && #t~ret20#1 <= 2147483647; [2025-02-08 14:07:43,784 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-5: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 14:07:43,784 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-6: havoc minus_#t~short40#1, minus_#t~short41#1, minus_~a#1, minus_~b#1; [2025-02-08 14:07:43,784 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-7: #t~ret20#1 := minus_#res#1; [2025-02-08 14:07:43,785 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L67-3: #t~ite17#1 := #t~ret16#1; [2025-02-08 14:07:43,785 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L67-4: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret16#1 && #t~ret16#1 <= 2147483647; [2025-02-08 14:07:43,785 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L67-5: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 14:07:43,785 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L67-6: havoc minus_#t~short40#1, minus_#t~short41#1, minus_~a#1, minus_~b#1; [2025-02-08 14:07:43,785 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L67-7: #t~ret16#1 := minus_#res#1; [2025-02-08 14:07:43,853 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 14:07:43,853 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 14:07:44,535 WARN L170 LargeBlockEncoding]: Complex 2:19 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-02-08 14:07:44,613 WARN L170 LargeBlockEncoding]: Complex 2:8 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-02-08 14:07:44,638 WARN L170 LargeBlockEncoding]: Complex 2:26 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-02-08 14:07:44,762 WARN L170 LargeBlockEncoding]: Complex 2:26 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-02-08 14:07:44,848 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L109-8 is not an error location. [2025-02-08 14:07:44,848 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L109-4 is not an error location. [2025-02-08 14:07:44,848 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L109-8 is not an error location. [2025-02-08 14:07:44,848 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L109-4 is not an error location. [2025-02-08 14:07:44,848 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L109 is not an error location. [2025-02-08 14:07:44,849 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L109 is not an error location. [2025-02-08 14:07:44,849 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L109-8 is not an error location. [2025-02-08 14:07:44,849 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L109-4 is not an error location. [2025-02-08 14:07:44,849 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L109 is not an error location. [2025-02-08 14:07:44,849 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L109-8 is not an error location. [2025-02-08 14:07:44,849 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L109-4 is not an error location. [2025-02-08 14:07:44,849 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L109 is not an error location. [2025-02-08 14:07:44,849 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L109-8 is not an error location. [2025-02-08 14:07:44,849 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L109-4 is not an error location. [2025-02-08 14:07:44,849 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L109 is not an error location. [2025-02-08 14:07:44,850 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L109-8 is not an error location. [2025-02-08 14:07:44,850 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L109-4 is not an error location. [2025-02-08 14:07:44,850 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L109 is not an error location. [2025-02-08 14:07:44,850 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 14:07:44,851 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 14:07:44,851 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:07:44 BoogieIcfgContainer [2025-02-08 14:07:44,851 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 14:07:44,853 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 14:07:44,853 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 14:07:44,856 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 14:07:44,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 02:07:42" (1/3) ... [2025-02-08 14:07:44,857 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6954cfb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 02:07:44, skipping insertion in model container [2025-02-08 14:07:44,857 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:07:42" (2/3) ... [2025-02-08 14:07:44,857 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6954cfb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 02:07:44, skipping insertion in model container [2025-02-08 14:07:44,857 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:07:44" (3/3) ... [2025-02-08 14:07:44,858 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-collitem-subst.wvr.c [2025-02-08 14:07:44,869 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 14:07:44,870 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-collitem-subst.wvr.c that has 4 procedures, 105 locations, 1 initial locations, 0 loop locations, and 72 error locations. [2025-02-08 14:07:44,870 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 14:07:45,256 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 14:07:45,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 182 transitions, 385 flow [2025-02-08 14:07:45,391 INFO L124 PetriNetUnfolderBase]: 78/179 cut-off events. [2025-02-08 14:07:45,392 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 14:07:45,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 179 events. 78/179 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 682 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 177. Up to 2 conditions per place. [2025-02-08 14:07:45,400 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 182 transitions, 385 flow [2025-02-08 14:07:45,408 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 109 places, 177 transitions, 369 flow [2025-02-08 14:07:45,414 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 14:07:45,425 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;@6d932aa5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 14:07:45,427 INFO L334 AbstractCegarLoop]: Starting to check reachability of 147 error locations. [2025-02-08 14:07:45,432 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 14:07:45,433 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-02-08 14:07:45,433 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 14:07:45,434 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:07:45,434 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-08 14:07:45,435 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2025-02-08 14:07:45,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:07:45,439 INFO L85 PathProgramCache]: Analyzing trace with hash 62254752, now seen corresponding path program 1 times [2025-02-08 14:07:45,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:07:45,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655048244] [2025-02-08 14:07:45,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:07:45,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:07:45,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:07:45,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:07:45,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:07:45,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:07:45,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:07:45,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:07:45,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655048244] [2025-02-08 14:07:45,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655048244] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:07:45,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:07:45,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 14:07:45,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229156961] [2025-02-08 14:07:45,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:07:45,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 14:07:45,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:07:45,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 14:07:45,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 14:07:45,664 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 182 [2025-02-08 14:07:45,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 177 transitions, 369 flow. Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:07:45,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:07:45,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 182 [2025-02-08 14:07:45,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:07:48,518 INFO L124 PetriNetUnfolderBase]: 15175/19244 cut-off events. [2025-02-08 14:07:48,519 INFO L125 PetriNetUnfolderBase]: For 226/226 co-relation queries the response was YES. [2025-02-08 14:07:48,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38819 conditions, 19244 events. 15175/19244 cut-off events. For 226/226 co-relation queries the response was YES. Maximal size of possible extension queue 2513. Compared 103280 event pairs, 8602 based on Foata normal form. 0/4076 useless extension candidates. Maximal degree in co-relation 37440. Up to 19101 conditions per place. [2025-02-08 14:07:48,620 INFO L140 encePairwiseOnDemand]: 71/182 looper letters, 63 selfloop transitions, 0 changer transitions 0/66 dead transitions. [2025-02-08 14:07:48,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 66 transitions, 273 flow [2025-02-08 14:07:48,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 14:07:48,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 14:07:48,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 186 transitions. [2025-02-08 14:07:48,631 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.510989010989011 [2025-02-08 14:07:48,632 INFO L175 Difference]: Start difference. First operand has 109 places, 177 transitions, 369 flow. Second operand 2 states and 186 transitions. [2025-02-08 14:07:48,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 66 transitions, 273 flow [2025-02-08 14:07:48,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 66 transitions, 264 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 14:07:48,690 INFO L231 Difference]: Finished difference. Result has 51 places, 66 transitions, 138 flow [2025-02-08 14:07:48,692 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=138, PETRI_PLACES=51, PETRI_TRANSITIONS=66} [2025-02-08 14:07:48,694 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, -58 predicate places. [2025-02-08 14:07:48,694 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 66 transitions, 138 flow [2025-02-08 14:07:48,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:07:48,694 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:07:48,694 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-08 14:07:48,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 14:07:48,695 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err18ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2025-02-08 14:07:48,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:07:48,695 INFO L85 PathProgramCache]: Analyzing trace with hash 62254755, now seen corresponding path program 1 times [2025-02-08 14:07:48,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:07:48,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918725376] [2025-02-08 14:07:48,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:07:48,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:07:48,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:07:48,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:07:48,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:07:48,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:07:48,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:07:48,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:07:48,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918725376] [2025-02-08 14:07:48,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918725376] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:07:48,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:07:48,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 14:07:48,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562817785] [2025-02-08 14:07:48,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:07:48,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 14:07:48,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:07:48,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:07:48,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:07:48,848 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 182 [2025-02-08 14:07:48,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 66 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:07:48,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:07:48,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 182 [2025-02-08 14:07:48,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:07:50,624 INFO L124 PetriNetUnfolderBase]: 12497/15931 cut-off events. [2025-02-08 14:07:50,624 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-02-08 14:07:50,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31998 conditions, 15931 events. 12497/15931 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 2078. Compared 84703 event pairs, 7203 based on Foata normal form. 0/3542 useless extension candidates. Maximal degree in co-relation 31995. Up to 15810 conditions per place. [2025-02-08 14:07:50,683 INFO L140 encePairwiseOnDemand]: 177/182 looper letters, 58 selfloop transitions, 1 changer transitions 0/62 dead transitions. [2025-02-08 14:07:50,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 62 transitions, 248 flow [2025-02-08 14:07:50,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:07:50,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 14:07:50,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2025-02-08 14:07:50,684 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.14835164835164835 [2025-02-08 14:07:50,684 INFO L175 Difference]: Start difference. First operand has 51 places, 66 transitions, 138 flow. Second operand 3 states and 81 transitions. [2025-02-08 14:07:50,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 62 transitions, 248 flow [2025-02-08 14:07:50,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 62 transitions, 248 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 14:07:50,686 INFO L231 Difference]: Finished difference. Result has 51 places, 62 transitions, 132 flow [2025-02-08 14:07:50,686 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=51, PETRI_TRANSITIONS=62} [2025-02-08 14:07:50,687 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, -58 predicate places. [2025-02-08 14:07:50,687 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 62 transitions, 132 flow [2025-02-08 14:07:50,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:07:50,687 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:07:50,687 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-08 14:07:50,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 14:07:50,687 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err16ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2025-02-08 14:07:50,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:07:50,688 INFO L85 PathProgramCache]: Analyzing trace with hash 62254757, now seen corresponding path program 1 times [2025-02-08 14:07:50,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:07:50,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363301378] [2025-02-08 14:07:50,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:07:50,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:07:50,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:07:50,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:07:50,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:07:50,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:07:50,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:07:50,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:07:50,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363301378] [2025-02-08 14:07:50,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363301378] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:07:50,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:07:50,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 14:07:50,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408844006] [2025-02-08 14:07:50,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:07:50,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 14:07:50,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:07:50,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:07:50,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:07:50,769 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 182 [2025-02-08 14:07:50,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 62 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:07:50,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:07:50,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 182 [2025-02-08 14:07:50,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:07:52,331 INFO L124 PetriNetUnfolderBase]: 10243/13146 cut-off events. [2025-02-08 14:07:52,331 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2025-02-08 14:07:52,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26418 conditions, 13146 events. 10243/13146 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 1702. Compared 69725 event pairs, 6015 based on Foata normal form. 0/3082 useless extension candidates. Maximal degree in co-relation 26414. Up to 13036 conditions per place. [2025-02-08 14:07:52,398 INFO L140 encePairwiseOnDemand]: 177/182 looper letters, 54 selfloop transitions, 1 changer transitions 0/58 dead transitions. [2025-02-08 14:07:52,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 58 transitions, 234 flow [2025-02-08 14:07:52,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:07:52,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 14:07:52,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2025-02-08 14:07:52,400 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.14102564102564102 [2025-02-08 14:07:52,400 INFO L175 Difference]: Start difference. First operand has 51 places, 62 transitions, 132 flow. Second operand 3 states and 77 transitions. [2025-02-08 14:07:52,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 58 transitions, 234 flow [2025-02-08 14:07:52,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 58 transitions, 233 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:07:52,401 INFO L231 Difference]: Finished difference. Result has 50 places, 58 transitions, 125 flow [2025-02-08 14:07:52,401 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=125, PETRI_PLACES=50, PETRI_TRANSITIONS=58} [2025-02-08 14:07:52,402 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, -59 predicate places. [2025-02-08 14:07:52,402 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 58 transitions, 125 flow [2025-02-08 14:07:52,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:07:52,402 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:07:52,402 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-08 14:07:52,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 14:07:52,403 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err15ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2025-02-08 14:07:52,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:07:52,403 INFO L85 PathProgramCache]: Analyzing trace with hash 62254758, now seen corresponding path program 1 times [2025-02-08 14:07:52,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:07:52,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691112455] [2025-02-08 14:07:52,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:07:52,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:07:52,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:07:52,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:07:52,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:07:52,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:07:52,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:07:52,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:07:52,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691112455] [2025-02-08 14:07:52,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691112455] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:07:52,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:07:52,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 14:07:52,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091838185] [2025-02-08 14:07:52,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:07:52,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 14:07:52,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:07:52,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:07:52,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:07:52,474 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 182 [2025-02-08 14:07:52,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 58 transitions, 125 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:07:52,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:07:52,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 182 [2025-02-08 14:07:52,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:07:53,848 INFO L124 PetriNetUnfolderBase]: 8207/10623 cut-off events. [2025-02-08 14:07:53,848 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-02-08 14:07:53,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21361 conditions, 10623 events. 8207/10623 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 1364. Compared 56286 event pairs, 4933 based on Foata normal form. 0/2652 useless extension candidates. Maximal degree in co-relation 21357. Up to 10524 conditions per place. [2025-02-08 14:07:53,879 INFO L140 encePairwiseOnDemand]: 177/182 looper letters, 50 selfloop transitions, 1 changer transitions 0/54 dead transitions. [2025-02-08 14:07:53,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 54 transitions, 219 flow [2025-02-08 14:07:53,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:07:53,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 14:07:53,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2025-02-08 14:07:53,880 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.1336996336996337 [2025-02-08 14:07:53,880 INFO L175 Difference]: Start difference. First operand has 50 places, 58 transitions, 125 flow. Second operand 3 states and 73 transitions. [2025-02-08 14:07:53,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 54 transitions, 219 flow [2025-02-08 14:07:53,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 54 transitions, 218 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:07:53,881 INFO L231 Difference]: Finished difference. Result has 49 places, 54 transitions, 118 flow [2025-02-08 14:07:53,881 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=49, PETRI_TRANSITIONS=54} [2025-02-08 14:07:53,882 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, -60 predicate places. [2025-02-08 14:07:53,882 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 54 transitions, 118 flow [2025-02-08 14:07:53,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:07:53,882 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:07:53,882 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-08 14:07:53,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 14:07:53,882 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2025-02-08 14:07:53,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:07:53,882 INFO L85 PathProgramCache]: Analyzing trace with hash 62254760, now seen corresponding path program 1 times [2025-02-08 14:07:53,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:07:53,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165755225] [2025-02-08 14:07:53,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:07:53,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:07:53,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:07:53,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:07:53,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:07:53,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:07:53,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:07:53,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:07:53,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165755225] [2025-02-08 14:07:53,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165755225] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:07:53,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:07:53,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 14:07:53,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462773053] [2025-02-08 14:07:53,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:07:53,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 14:07:53,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:07:53,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:07:53,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:07:53,973 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 182 [2025-02-08 14:07:53,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 54 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:07:53,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:07:53,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 182 [2025-02-08 14:07:53,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:07:54,654 INFO L124 PetriNetUnfolderBase]: 6419/8386 cut-off events. [2025-02-08 14:07:54,654 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-02-08 14:07:54,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16868 conditions, 8386 events. 6419/8386 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 1079. Compared 44321 event pairs, 3968 based on Foata normal form. 0/2246 useless extension candidates. Maximal degree in co-relation 16864. Up to 8306 conditions per place. [2025-02-08 14:07:54,684 INFO L140 encePairwiseOnDemand]: 177/182 looper letters, 46 selfloop transitions, 1 changer transitions 0/50 dead transitions. [2025-02-08 14:07:54,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 50 transitions, 204 flow [2025-02-08 14:07:54,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:07:54,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 14:07:54,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2025-02-08 14:07:54,685 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.12637362637362637 [2025-02-08 14:07:54,685 INFO L175 Difference]: Start difference. First operand has 49 places, 54 transitions, 118 flow. Second operand 3 states and 69 transitions. [2025-02-08 14:07:54,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 50 transitions, 204 flow [2025-02-08 14:07:54,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 50 transitions, 203 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:07:54,686 INFO L231 Difference]: Finished difference. Result has 48 places, 50 transitions, 111 flow [2025-02-08 14:07:54,686 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=111, PETRI_PLACES=48, PETRI_TRANSITIONS=50} [2025-02-08 14:07:54,687 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, -61 predicate places. [2025-02-08 14:07:54,687 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 50 transitions, 111 flow [2025-02-08 14:07:54,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:07:54,687 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:07:54,687 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-08 14:07:54,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 14:07:54,687 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2025-02-08 14:07:54,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:07:54,688 INFO L85 PathProgramCache]: Analyzing trace with hash 62254761, now seen corresponding path program 1 times [2025-02-08 14:07:54,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:07:54,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769502795] [2025-02-08 14:07:54,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:07:54,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:07:54,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:07:54,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:07:54,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:07:54,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:07:54,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:07:54,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:07:54,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769502795] [2025-02-08 14:07:54,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769502795] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:07:54,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:07:54,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 14:07:54,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77229871] [2025-02-08 14:07:54,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:07:54,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 14:07:54,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:07:54,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:07:54,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:07:54,774 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 182 [2025-02-08 14:07:54,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 50 transitions, 111 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:07:54,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:07:54,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 182 [2025-02-08 14:07:54,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:07:55,273 INFO L124 PetriNetUnfolderBase]: 4843/6407 cut-off events. [2025-02-08 14:07:55,273 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-02-08 14:07:55,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12893 conditions, 6407 events. 4843/6407 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 828. Compared 33710 event pairs, 3107 based on Foata normal form. 0/1872 useless extension candidates. Maximal degree in co-relation 12889. Up to 6344 conditions per place. [2025-02-08 14:07:55,292 INFO L140 encePairwiseOnDemand]: 177/182 looper letters, 42 selfloop transitions, 1 changer transitions 0/46 dead transitions. [2025-02-08 14:07:55,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 46 transitions, 189 flow [2025-02-08 14:07:55,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:07:55,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 14:07:55,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2025-02-08 14:07:55,293 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.11904761904761904 [2025-02-08 14:07:55,293 INFO L175 Difference]: Start difference. First operand has 48 places, 50 transitions, 111 flow. Second operand 3 states and 65 transitions. [2025-02-08 14:07:55,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 46 transitions, 189 flow [2025-02-08 14:07:55,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 46 transitions, 188 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:07:55,294 INFO L231 Difference]: Finished difference. Result has 47 places, 46 transitions, 104 flow [2025-02-08 14:07:55,294 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=47, PETRI_TRANSITIONS=46} [2025-02-08 14:07:55,295 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, -62 predicate places. [2025-02-08 14:07:55,295 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 46 transitions, 104 flow [2025-02-08 14:07:55,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:07:55,295 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:07:55,295 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-08 14:07:55,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 14:07:55,295 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2025-02-08 14:07:55,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:07:55,295 INFO L85 PathProgramCache]: Analyzing trace with hash 62254733, now seen corresponding path program 1 times [2025-02-08 14:07:55,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:07:55,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571081609] [2025-02-08 14:07:55,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:07:55,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:07:55,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:07:55,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:07:55,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:07:55,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:07:55,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:07:55,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:07:55,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571081609] [2025-02-08 14:07:55,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571081609] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:07:55,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:07:55,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 14:07:55,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007823763] [2025-02-08 14:07:55,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:07:55,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 14:07:55,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:07:55,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:07:55,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:07:55,338 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 182 [2025-02-08 14:07:55,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 46 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:07:55,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:07:55,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 182 [2025-02-08 14:07:55,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:07:55,756 INFO L124 PetriNetUnfolderBase]: 3753/4990 cut-off events. [2025-02-08 14:07:55,756 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-02-08 14:07:55,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10050 conditions, 4990 events. 3753/4990 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 620. Compared 25500 event pairs, 2401 based on Foata normal form. 0/1556 useless extension candidates. Maximal degree in co-relation 10046. Up to 4936 conditions per place. [2025-02-08 14:07:55,775 INFO L140 encePairwiseOnDemand]: 178/182 looper letters, 39 selfloop transitions, 1 changer transitions 0/43 dead transitions. [2025-02-08 14:07:55,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 43 transitions, 178 flow [2025-02-08 14:07:55,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:07:55,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 14:07:55,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2025-02-08 14:07:55,777 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.11172161172161173 [2025-02-08 14:07:55,777 INFO L175 Difference]: Start difference. First operand has 47 places, 46 transitions, 104 flow. Second operand 3 states and 61 transitions. [2025-02-08 14:07:55,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 43 transitions, 178 flow [2025-02-08 14:07:55,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 43 transitions, 177 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:07:55,777 INFO L231 Difference]: Finished difference. Result has 46 places, 43 transitions, 99 flow [2025-02-08 14:07:55,777 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=99, PETRI_PLACES=46, PETRI_TRANSITIONS=43} [2025-02-08 14:07:55,778 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, -63 predicate places. [2025-02-08 14:07:55,778 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 43 transitions, 99 flow [2025-02-08 14:07:55,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:07:55,778 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:07:55,778 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-08 14:07:55,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 14:07:55,778 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2025-02-08 14:07:55,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:07:55,778 INFO L85 PathProgramCache]: Analyzing trace with hash 62254734, now seen corresponding path program 1 times [2025-02-08 14:07:55,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:07:55,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124934284] [2025-02-08 14:07:55,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:07:55,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:07:55,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:07:55,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:07:55,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:07:55,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:07:55,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:07:55,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:07:55,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124934284] [2025-02-08 14:07:55,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124934284] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:07:55,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:07:55,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 14:07:55,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594197668] [2025-02-08 14:07:55,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:07:55,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 14:07:55,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:07:55,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:07:55,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:07:55,803 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 182 [2025-02-08 14:07:55,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 43 transitions, 99 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:07:55,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:07:55,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 182 [2025-02-08 14:07:55,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:07:56,182 INFO L124 PetriNetUnfolderBase]: 2901/3847 cut-off events. [2025-02-08 14:07:56,182 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-02-08 14:07:56,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7755 conditions, 3847 events. 2901/3847 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 18609 event pairs, 1781 based on Foata normal form. 0/1266 useless extension candidates. Maximal degree in co-relation 7751. Up to 3802 conditions per place. [2025-02-08 14:07:56,193 INFO L140 encePairwiseOnDemand]: 179/182 looper letters, 37 selfloop transitions, 1 changer transitions 0/41 dead transitions. [2025-02-08 14:07:56,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 41 transitions, 171 flow [2025-02-08 14:07:56,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:07:56,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 14:07:56,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2025-02-08 14:07:56,194 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.10622710622710622 [2025-02-08 14:07:56,194 INFO L175 Difference]: Start difference. First operand has 46 places, 43 transitions, 99 flow. Second operand 3 states and 58 transitions. [2025-02-08 14:07:56,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 41 transitions, 171 flow [2025-02-08 14:07:56,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 41 transitions, 170 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:07:56,195 INFO L231 Difference]: Finished difference. Result has 45 places, 41 transitions, 96 flow [2025-02-08 14:07:56,195 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=45, PETRI_TRANSITIONS=41} [2025-02-08 14:07:56,195 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, -64 predicate places. [2025-02-08 14:07:56,195 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 41 transitions, 96 flow [2025-02-08 14:07:56,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:07:56,196 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:07:56,196 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-08 14:07:56,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 14:07:56,196 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err19ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2025-02-08 14:07:56,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:07:56,196 INFO L85 PathProgramCache]: Analyzing trace with hash 62254736, now seen corresponding path program 1 times [2025-02-08 14:07:56,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:07:56,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074465507] [2025-02-08 14:07:56,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:07:56,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:07:56,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:07:56,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:07:56,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:07:56,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:07:56,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:07:56,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:07:56,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074465507] [2025-02-08 14:07:56,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074465507] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:07:56,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:07:56,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 14:07:56,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955929183] [2025-02-08 14:07:56,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:07:56,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 14:07:56,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:07:56,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:07:56,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:07:56,230 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 182 [2025-02-08 14:07:56,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 41 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:07:56,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:07:56,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 182 [2025-02-08 14:07:56,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:07:56,495 INFO L124 PetriNetUnfolderBase]: 2158/2847 cut-off events. [2025-02-08 14:07:56,495 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-02-08 14:07:56,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5742 conditions, 2847 events. 2158/2847 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 12836 event pairs, 1254 based on Foata normal form. 0/1000 useless extension candidates. Maximal degree in co-relation 5738. Up to 2815 conditions per place. [2025-02-08 14:07:56,500 INFO L140 encePairwiseOnDemand]: 179/182 looper letters, 35 selfloop transitions, 1 changer transitions 0/39 dead transitions. [2025-02-08 14:07:56,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 39 transitions, 164 flow [2025-02-08 14:07:56,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:07:56,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 14:07:56,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2025-02-08 14:07:56,501 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.10256410256410256 [2025-02-08 14:07:56,501 INFO L175 Difference]: Start difference. First operand has 45 places, 41 transitions, 96 flow. Second operand 3 states and 56 transitions. [2025-02-08 14:07:56,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 39 transitions, 164 flow [2025-02-08 14:07:56,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 39 transitions, 163 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:07:56,502 INFO L231 Difference]: Finished difference. Result has 44 places, 39 transitions, 93 flow [2025-02-08 14:07:56,502 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=93, PETRI_PLACES=44, PETRI_TRANSITIONS=39} [2025-02-08 14:07:56,503 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, -65 predicate places. [2025-02-08 14:07:56,503 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 39 transitions, 93 flow [2025-02-08 14:07:56,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:07:56,503 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:07:56,503 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 14:07:56,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 14:07:56,503 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err16ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2025-02-08 14:07:56,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:07:56,503 INFO L85 PathProgramCache]: Analyzing trace with hash -302722495, now seen corresponding path program 1 times [2025-02-08 14:07:56,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:07:56,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402650333] [2025-02-08 14:07:56,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:07:56,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:07:56,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:07:56,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:07:56,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:07:56,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:07:56,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:07:56,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:07:56,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402650333] [2025-02-08 14:07:56,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402650333] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:07:56,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:07:56,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 14:07:56,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315277471] [2025-02-08 14:07:56,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:07:56,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 14:07:56,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:07:56,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:07:56,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:07:56,526 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 182 [2025-02-08 14:07:56,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 39 transitions, 93 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:07:56,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:07:56,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 182 [2025-02-08 14:07:56,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:07:56,719 INFO L124 PetriNetUnfolderBase]: 1590/2131 cut-off events. [2025-02-08 14:07:56,719 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-02-08 14:07:56,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4307 conditions, 2131 events. 1590/2131 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 9533 event pairs, 957 based on Foata normal form. 0/816 useless extension candidates. Maximal degree in co-relation 4303. Up to 2103 conditions per place. [2025-02-08 14:07:56,724 INFO L140 encePairwiseOnDemand]: 177/182 looper letters, 31 selfloop transitions, 1 changer transitions 0/35 dead transitions. [2025-02-08 14:07:56,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 35 transitions, 149 flow [2025-02-08 14:07:56,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:07:56,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 14:07:56,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2025-02-08 14:07:56,725 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.0989010989010989 [2025-02-08 14:07:56,725 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 93 flow. Second operand 3 states and 54 transitions. [2025-02-08 14:07:56,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 35 transitions, 149 flow [2025-02-08 14:07:56,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 35 transitions, 148 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:07:56,726 INFO L231 Difference]: Finished difference. Result has 43 places, 35 transitions, 86 flow [2025-02-08 14:07:56,726 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=43, PETRI_TRANSITIONS=35} [2025-02-08 14:07:56,726 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, -66 predicate places. [2025-02-08 14:07:56,726 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 35 transitions, 86 flow [2025-02-08 14:07:56,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:07:56,726 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:07:56,726 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:07:56,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 14:07:56,727 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err15ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2025-02-08 14:07:56,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:07:56,727 INFO L85 PathProgramCache]: Analyzing trace with hash -794518427, now seen corresponding path program 1 times [2025-02-08 14:07:56,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:07:56,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561969067] [2025-02-08 14:07:56,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:07:56,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:07:56,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:07:56,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:07:56,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:07:56,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:07:56,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:07:56,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:07:56,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561969067] [2025-02-08 14:07:56,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561969067] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:07:56,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:07:56,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 14:07:56,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093433299] [2025-02-08 14:07:56,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:07:56,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 14:07:56,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:07:56,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:07:56,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:07:56,774 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 182 [2025-02-08 14:07:56,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 35 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:07:56,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:07:56,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 182 [2025-02-08 14:07:56,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:07:56,911 INFO L124 PetriNetUnfolderBase]: 1106/1517 cut-off events. [2025-02-08 14:07:56,911 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-02-08 14:07:56,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3076 conditions, 1517 events. 1106/1517 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 6628 event pairs, 700 based on Foata normal form. 0/650 useless extension candidates. Maximal degree in co-relation 3072. Up to 1493 conditions per place. [2025-02-08 14:07:56,916 INFO L140 encePairwiseOnDemand]: 177/182 looper letters, 27 selfloop transitions, 1 changer transitions 0/31 dead transitions. [2025-02-08 14:07:56,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 31 transitions, 134 flow [2025-02-08 14:07:56,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:07:56,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 14:07:56,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2025-02-08 14:07:56,918 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.09157509157509157 [2025-02-08 14:07:56,918 INFO L175 Difference]: Start difference. First operand has 43 places, 35 transitions, 86 flow. Second operand 3 states and 50 transitions. [2025-02-08 14:07:56,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 31 transitions, 134 flow [2025-02-08 14:07:56,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 31 transitions, 133 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:07:56,919 INFO L231 Difference]: Finished difference. Result has 42 places, 31 transitions, 79 flow [2025-02-08 14:07:56,919 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=79, PETRI_PLACES=42, PETRI_TRANSITIONS=31} [2025-02-08 14:07:56,920 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, -67 predicate places. [2025-02-08 14:07:56,920 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 79 flow [2025-02-08 14:07:56,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:07:56,920 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:07:56,920 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 14:07:56,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 14:07:56,920 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err22ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2025-02-08 14:07:56,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:07:56,921 INFO L85 PathProgramCache]: Analyzing trace with hash -302722527, now seen corresponding path program 1 times [2025-02-08 14:07:56,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:07:56,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488736328] [2025-02-08 14:07:56,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:07:56,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:07:56,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:07:56,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:07:56,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:07:56,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:07:56,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:07:56,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:07:56,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488736328] [2025-02-08 14:07:56,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488736328] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:07:56,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:07:56,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 14:07:56,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362593974] [2025-02-08 14:07:56,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:07:56,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 14:07:56,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:07:56,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:07:56,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:07:56,951 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 182 [2025-02-08 14:07:56,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 79 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:07:56,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:07:56,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 182 [2025-02-08 14:07:56,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:07:57,060 INFO L124 PetriNetUnfolderBase]: 805/1104 cut-off events. [2025-02-08 14:07:57,060 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-02-08 14:07:57,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2247 conditions, 1104 events. 805/1104 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 4441 event pairs, 483 based on Foata normal form. 0/502 useless extension candidates. Maximal degree in co-relation 2243. Up to 1084 conditions per place. [2025-02-08 14:07:57,063 INFO L140 encePairwiseOnDemand]: 179/182 looper letters, 25 selfloop transitions, 1 changer transitions 0/29 dead transitions. [2025-02-08 14:07:57,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 29 transitions, 127 flow [2025-02-08 14:07:57,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:07:57,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 14:07:57,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2025-02-08 14:07:57,064 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.08424908424908426 [2025-02-08 14:07:57,064 INFO L175 Difference]: Start difference. First operand has 42 places, 31 transitions, 79 flow. Second operand 3 states and 46 transitions. [2025-02-08 14:07:57,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 29 transitions, 127 flow [2025-02-08 14:07:57,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 29 transitions, 126 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:07:57,065 INFO L231 Difference]: Finished difference. Result has 41 places, 29 transitions, 76 flow [2025-02-08 14:07:57,065 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=41, PETRI_TRANSITIONS=29} [2025-02-08 14:07:57,065 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, -68 predicate places. [2025-02-08 14:07:57,065 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 29 transitions, 76 flow [2025-02-08 14:07:57,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:07:57,065 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:07:57,066 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 14:07:57,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 14:07:57,066 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err21ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2025-02-08 14:07:57,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:07:57,066 INFO L85 PathProgramCache]: Analyzing trace with hash -302722526, now seen corresponding path program 1 times [2025-02-08 14:07:57,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:07:57,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072278614] [2025-02-08 14:07:57,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:07:57,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:07:57,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:07:57,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:07:57,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:07:57,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:07:57,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:07:57,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:07:57,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072278614] [2025-02-08 14:07:57,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072278614] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:07:57,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:07:57,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 14:07:57,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412664287] [2025-02-08 14:07:57,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:07:57,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 14:07:57,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:07:57,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:07:57,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:07:57,088 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 182 [2025-02-08 14:07:57,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:07:57,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:07:57,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 182 [2025-02-08 14:07:57,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:07:57,172 INFO L124 PetriNetUnfolderBase]: 552/757 cut-off events. [2025-02-08 14:07:57,172 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-08 14:07:57,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1550 conditions, 757 events. 552/757 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2672 event pairs, 306 based on Foata normal form. 0/372 useless extension candidates. Maximal degree in co-relation 1546. Up to 741 conditions per place. [2025-02-08 14:07:57,173 INFO L140 encePairwiseOnDemand]: 179/182 looper letters, 0 selfloop transitions, 0 changer transitions 27/27 dead transitions. [2025-02-08 14:07:57,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 27 transitions, 120 flow [2025-02-08 14:07:57,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:07:57,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 14:07:57,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2025-02-08 14:07:57,174 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.08058608058608059 [2025-02-08 14:07:57,174 INFO L175 Difference]: Start difference. First operand has 41 places, 29 transitions, 76 flow. Second operand 3 states and 44 transitions. [2025-02-08 14:07:57,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 27 transitions, 120 flow [2025-02-08 14:07:57,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 27 transitions, 119 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:07:57,174 INFO L231 Difference]: Finished difference. Result has 40 places, 0 transitions, 0 flow [2025-02-08 14:07:57,174 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=40, PETRI_TRANSITIONS=0} [2025-02-08 14:07:57,175 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, -69 predicate places. [2025-02-08 14:07:57,175 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 0 transitions, 0 flow [2025-02-08 14:07:57,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:07:57,177 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW (146 of 147 remaining) [2025-02-08 14:07:57,177 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW (145 of 147 remaining) [2025-02-08 14:07:57,177 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (144 of 147 remaining) [2025-02-08 14:07:57,177 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW (143 of 147 remaining) [2025-02-08 14:07:57,177 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONINTEGER_OVERFLOW (142 of 147 remaining) [2025-02-08 14:07:57,177 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONINTEGER_OVERFLOW (141 of 147 remaining) [2025-02-08 14:07:57,177 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONINTEGER_OVERFLOW (140 of 147 remaining) [2025-02-08 14:07:57,177 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONINTEGER_OVERFLOW (139 of 147 remaining) [2025-02-08 14:07:57,177 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONINTEGER_OVERFLOW (138 of 147 remaining) [2025-02-08 14:07:57,177 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONINTEGER_OVERFLOW (137 of 147 remaining) [2025-02-08 14:07:57,177 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW (136 of 147 remaining) [2025-02-08 14:07:57,177 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW (135 of 147 remaining) [2025-02-08 14:07:57,177 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (134 of 147 remaining) [2025-02-08 14:07:57,177 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (133 of 147 remaining) [2025-02-08 14:07:57,177 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (132 of 147 remaining) [2025-02-08 14:07:57,177 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (131 of 147 remaining) [2025-02-08 14:07:57,177 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (130 of 147 remaining) [2025-02-08 14:07:57,177 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (129 of 147 remaining) [2025-02-08 14:07:57,177 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (128 of 147 remaining) [2025-02-08 14:07:57,177 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (127 of 147 remaining) [2025-02-08 14:07:57,177 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (126 of 147 remaining) [2025-02-08 14:07:57,177 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (125 of 147 remaining) [2025-02-08 14:07:57,177 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (124 of 147 remaining) [2025-02-08 14:07:57,177 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (123 of 147 remaining) [2025-02-08 14:07:57,177 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONINTEGER_OVERFLOW (122 of 147 remaining) [2025-02-08 14:07:57,177 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONINTEGER_OVERFLOW (121 of 147 remaining) [2025-02-08 14:07:57,178 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (120 of 147 remaining) [2025-02-08 14:07:57,178 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONINTEGER_OVERFLOW (119 of 147 remaining) [2025-02-08 14:07:57,178 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONINTEGER_OVERFLOW (118 of 147 remaining) [2025-02-08 14:07:57,178 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONINTEGER_OVERFLOW (117 of 147 remaining) [2025-02-08 14:07:57,178 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONINTEGER_OVERFLOW (116 of 147 remaining) [2025-02-08 14:07:57,178 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONINTEGER_OVERFLOW (115 of 147 remaining) [2025-02-08 14:07:57,178 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONINTEGER_OVERFLOW (114 of 147 remaining) [2025-02-08 14:07:57,178 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONINTEGER_OVERFLOW (113 of 147 remaining) [2025-02-08 14:07:57,178 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONINTEGER_OVERFLOW (112 of 147 remaining) [2025-02-08 14:07:57,178 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONINTEGER_OVERFLOW (111 of 147 remaining) [2025-02-08 14:07:57,178 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (110 of 147 remaining) [2025-02-08 14:07:57,178 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (109 of 147 remaining) [2025-02-08 14:07:57,178 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (108 of 147 remaining) [2025-02-08 14:07:57,178 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (107 of 147 remaining) [2025-02-08 14:07:57,178 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (106 of 147 remaining) [2025-02-08 14:07:57,178 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (105 of 147 remaining) [2025-02-08 14:07:57,178 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (104 of 147 remaining) [2025-02-08 14:07:57,178 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (103 of 147 remaining) [2025-02-08 14:07:57,178 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (102 of 147 remaining) [2025-02-08 14:07:57,178 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (101 of 147 remaining) [2025-02-08 14:07:57,178 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (100 of 147 remaining) [2025-02-08 14:07:57,178 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (99 of 147 remaining) [2025-02-08 14:07:57,178 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err23ASSERT_VIOLATIONINTEGER_OVERFLOW (98 of 147 remaining) [2025-02-08 14:07:57,178 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err22ASSERT_VIOLATIONINTEGER_OVERFLOW (97 of 147 remaining) [2025-02-08 14:07:57,179 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (96 of 147 remaining) [2025-02-08 14:07:57,179 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err20ASSERT_VIOLATIONINTEGER_OVERFLOW (95 of 147 remaining) [2025-02-08 14:07:57,179 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONINTEGER_OVERFLOW (94 of 147 remaining) [2025-02-08 14:07:57,179 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONINTEGER_OVERFLOW (93 of 147 remaining) [2025-02-08 14:07:57,179 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONINTEGER_OVERFLOW (92 of 147 remaining) [2025-02-08 14:07:57,179 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONINTEGER_OVERFLOW (91 of 147 remaining) [2025-02-08 14:07:57,179 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONINTEGER_OVERFLOW (90 of 147 remaining) [2025-02-08 14:07:57,179 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONINTEGER_OVERFLOW (89 of 147 remaining) [2025-02-08 14:07:57,179 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONINTEGER_OVERFLOW (88 of 147 remaining) [2025-02-08 14:07:57,179 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONINTEGER_OVERFLOW (87 of 147 remaining) [2025-02-08 14:07:57,179 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (86 of 147 remaining) [2025-02-08 14:07:57,179 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (85 of 147 remaining) [2025-02-08 14:07:57,179 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (84 of 147 remaining) [2025-02-08 14:07:57,180 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (83 of 147 remaining) [2025-02-08 14:07:57,180 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (82 of 147 remaining) [2025-02-08 14:07:57,180 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (81 of 147 remaining) [2025-02-08 14:07:57,180 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (80 of 147 remaining) [2025-02-08 14:07:57,180 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (79 of 147 remaining) [2025-02-08 14:07:57,180 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (78 of 147 remaining) [2025-02-08 14:07:57,180 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (77 of 147 remaining) [2025-02-08 14:07:57,180 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (76 of 147 remaining) [2025-02-08 14:07:57,180 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (75 of 147 remaining) [2025-02-08 14:07:57,180 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (74 of 147 remaining) [2025-02-08 14:07:57,180 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (73 of 147 remaining) [2025-02-08 14:07:57,180 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (72 of 147 remaining) [2025-02-08 14:07:57,180 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW (71 of 147 remaining) [2025-02-08 14:07:57,180 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW (70 of 147 remaining) [2025-02-08 14:07:57,180 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (69 of 147 remaining) [2025-02-08 14:07:57,180 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW (68 of 147 remaining) [2025-02-08 14:07:57,180 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONINTEGER_OVERFLOW (67 of 147 remaining) [2025-02-08 14:07:57,180 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONINTEGER_OVERFLOW (66 of 147 remaining) [2025-02-08 14:07:57,180 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONINTEGER_OVERFLOW (65 of 147 remaining) [2025-02-08 14:07:57,180 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONINTEGER_OVERFLOW (64 of 147 remaining) [2025-02-08 14:07:57,180 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONINTEGER_OVERFLOW (63 of 147 remaining) [2025-02-08 14:07:57,180 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONINTEGER_OVERFLOW (62 of 147 remaining) [2025-02-08 14:07:57,180 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW (61 of 147 remaining) [2025-02-08 14:07:57,180 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW (60 of 147 remaining) [2025-02-08 14:07:57,180 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (59 of 147 remaining) [2025-02-08 14:07:57,180 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (58 of 147 remaining) [2025-02-08 14:07:57,181 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 147 remaining) [2025-02-08 14:07:57,181 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 147 remaining) [2025-02-08 14:07:57,181 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 147 remaining) [2025-02-08 14:07:57,181 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 147 remaining) [2025-02-08 14:07:57,181 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 147 remaining) [2025-02-08 14:07:57,181 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 147 remaining) [2025-02-08 14:07:57,181 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 147 remaining) [2025-02-08 14:07:57,181 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 147 remaining) [2025-02-08 14:07:57,181 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 147 remaining) [2025-02-08 14:07:57,181 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 147 remaining) [2025-02-08 14:07:57,181 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 147 remaining) [2025-02-08 14:07:57,181 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 147 remaining) [2025-02-08 14:07:57,181 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 147 remaining) [2025-02-08 14:07:57,181 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 147 remaining) [2025-02-08 14:07:57,181 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 147 remaining) [2025-02-08 14:07:57,181 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 147 remaining) [2025-02-08 14:07:57,181 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 147 remaining) [2025-02-08 14:07:57,181 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 147 remaining) [2025-02-08 14:07:57,181 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 147 remaining) [2025-02-08 14:07:57,181 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 147 remaining) [2025-02-08 14:07:57,181 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 147 remaining) [2025-02-08 14:07:57,181 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 147 remaining) [2025-02-08 14:07:57,181 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 147 remaining) [2025-02-08 14:07:57,181 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 147 remaining) [2025-02-08 14:07:57,181 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 147 remaining) [2025-02-08 14:07:57,181 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 147 remaining) [2025-02-08 14:07:57,181 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 147 remaining) [2025-02-08 14:07:57,181 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 147 remaining) [2025-02-08 14:07:57,181 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 147 remaining) [2025-02-08 14:07:57,181 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 147 remaining) [2025-02-08 14:07:57,181 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 147 remaining) [2025-02-08 14:07:57,181 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 147 remaining) [2025-02-08 14:07:57,182 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 147 remaining) [2025-02-08 14:07:57,182 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 147 remaining) [2025-02-08 14:07:57,182 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err23ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 147 remaining) [2025-02-08 14:07:57,182 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err22ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 147 remaining) [2025-02-08 14:07:57,182 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 147 remaining) [2025-02-08 14:07:57,182 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err20ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 147 remaining) [2025-02-08 14:07:57,182 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 147 remaining) [2025-02-08 14:07:57,182 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 147 remaining) [2025-02-08 14:07:57,182 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 147 remaining) [2025-02-08 14:07:57,183 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 147 remaining) [2025-02-08 14:07:57,183 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 147 remaining) [2025-02-08 14:07:57,183 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 147 remaining) [2025-02-08 14:07:57,183 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 147 remaining) [2025-02-08 14:07:57,183 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 147 remaining) [2025-02-08 14:07:57,183 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 147 remaining) [2025-02-08 14:07:57,183 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 147 remaining) [2025-02-08 14:07:57,183 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 147 remaining) [2025-02-08 14:07:57,183 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 147 remaining) [2025-02-08 14:07:57,183 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 147 remaining) [2025-02-08 14:07:57,183 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 147 remaining) [2025-02-08 14:07:57,183 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 147 remaining) [2025-02-08 14:07:57,183 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 147 remaining) [2025-02-08 14:07:57,183 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 147 remaining) [2025-02-08 14:07:57,183 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 147 remaining) [2025-02-08 14:07:57,183 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 147 remaining) [2025-02-08 14:07:57,183 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 147 remaining) [2025-02-08 14:07:57,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 14:07:57,184 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:07:57,188 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 14:07:57,188 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 14:07:57,192 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 02:07:57 BasicIcfg [2025-02-08 14:07:57,192 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 14:07:57,192 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 14:07:57,192 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 14:07:57,192 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 14:07:57,193 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:07:44" (3/4) ... [2025-02-08 14:07:57,194 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 14:07:57,196 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 14:07:57,196 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 14:07:57,196 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-02-08 14:07:57,199 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 70 nodes and edges [2025-02-08 14:07:57,199 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 32 nodes and edges [2025-02-08 14:07:57,199 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2025-02-08 14:07:57,199 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-08 14:07:57,199 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 14:07:57,252 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 14:07:57,253 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 14:07:57,253 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 14:07:57,253 INFO L158 Benchmark]: Toolchain (without parser) took 14598.72ms. Allocated memory was 167.8MB in the beginning and 3.1GB in the end (delta: 2.9GB). Free memory was 124.1MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 866.4MB. Max. memory is 16.1GB. [2025-02-08 14:07:57,254 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 115.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:07:57,254 INFO L158 Benchmark]: CACSL2BoogieTranslator took 256.21ms. Allocated memory is still 167.8MB. Free memory was 124.1MB in the beginning and 111.7MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 14:07:57,254 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.72ms. Allocated memory is still 167.8MB. Free memory was 111.7MB in the beginning and 109.0MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 14:07:57,254 INFO L158 Benchmark]: Boogie Preprocessor took 58.69ms. Allocated memory is still 167.8MB. Free memory was 109.0MB in the beginning and 106.2MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:07:57,254 INFO L158 Benchmark]: IcfgBuilder took 1819.16ms. Allocated memory is still 167.8MB. Free memory was 106.2MB in the beginning and 51.1MB in the end (delta: 55.1MB). Peak memory consumption was 86.8MB. Max. memory is 16.1GB. [2025-02-08 14:07:57,254 INFO L158 Benchmark]: TraceAbstraction took 12339.24ms. Allocated memory was 167.8MB in the beginning and 3.1GB in the end (delta: 2.9GB). Free memory was 51.1MB in the beginning and 2.1GB in the end (delta: -2.1GB). Peak memory consumption was 785.3MB. Max. memory is 16.1GB. [2025-02-08 14:07:57,255 INFO L158 Benchmark]: Witness Printer took 60.54ms. Allocated memory is still 3.1GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 14:07:57,256 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 115.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 256.21ms. Allocated memory is still 167.8MB. Free memory was 124.1MB in the beginning and 111.7MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.72ms. Allocated memory is still 167.8MB. Free memory was 111.7MB in the beginning and 109.0MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.69ms. Allocated memory is still 167.8MB. Free memory was 109.0MB in the beginning and 106.2MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 1819.16ms. Allocated memory is still 167.8MB. Free memory was 106.2MB in the beginning and 51.1MB in the end (delta: 55.1MB). Peak memory consumption was 86.8MB. Max. memory is 16.1GB. * TraceAbstraction took 12339.24ms. Allocated memory was 167.8MB in the beginning and 3.1GB in the end (delta: 2.9GB). Free memory was 51.1MB in the beginning and 2.1GB in the end (delta: -2.1GB). Peak memory consumption was 785.3MB. Max. memory is 16.1GB. * Witness Printer took 60.54ms. Allocated memory is still 3.1GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: 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 7 procedures, 201 locations, 147 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: 11.9s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 446 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 446 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 542 IncrementalHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 0 mSDtfsCounter, 542 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=369occurred in iteration=0, InterpolantAutomatonStates: 38, 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.6s InterpolantComputationTime, 61 NumberOfCodeBlocks, 61 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 48 ConstructedInterpolants, 0 QuantifiedInterpolants, 184 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 72 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 14:07:57,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE