./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_51-mutexptr_racefree.i --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/goblint-regression/28-race_reach_51-mutexptr_racefree.i -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 f222d5749b9bb10b4d4c09b2c40e45ee19dec77732a8593ce917652e8ca8a43e --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 14:06:12,262 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 14:06:12,317 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:06:12,324 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 14:06:12,325 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 14:06:12,337 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 14:06:12,337 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 14:06:12,337 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 14:06:12,337 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 14:06:12,338 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 14:06:12,338 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 14:06:12,338 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 14:06:12,338 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 14:06:12,338 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 14:06:12,338 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 14:06:12,338 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 14:06:12,338 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 14:06:12,338 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 14:06:12,338 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 14:06:12,338 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 14:06:12,338 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 14:06:12,338 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 14:06:12,338 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 14:06:12,338 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 14:06:12,338 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 14:06:12,339 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 14:06:12,339 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 14:06:12,339 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 14:06:12,339 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 14:06:12,339 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 14:06:12,339 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 14:06:12,339 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 14:06:12,339 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 14:06:12,339 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 14:06:12,339 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 14:06:12,339 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 14:06:12,339 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 14:06:12,339 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 14:06:12,339 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 14:06:12,339 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 14:06:12,339 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 14:06:12,339 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 14:06:12,339 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 14:06:12,339 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 14:06:12,339 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 14:06:12,339 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 -> f222d5749b9bb10b4d4c09b2c40e45ee19dec77732a8593ce917652e8ca8a43e [2025-02-08 14:06:12,578 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 14:06:12,587 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 14:06:12,589 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 14:06:12,589 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 14:06:12,590 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 14:06:12,591 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_51-mutexptr_racefree.i [2025-02-08 14:06:13,707 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/84a0b1568/3c566a9595f1481488001cbd0fffa959/FLAG85dcaa8f3 [2025-02-08 14:06:14,046 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 14:06:14,047 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_51-mutexptr_racefree.i [2025-02-08 14:06:14,060 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/84a0b1568/3c566a9595f1481488001cbd0fffa959/FLAG85dcaa8f3 [2025-02-08 14:06:14,076 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/84a0b1568/3c566a9595f1481488001cbd0fffa959 [2025-02-08 14:06:14,078 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 14:06:14,079 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 14:06:14,081 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 14:06:14,081 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 14:06:14,084 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 14:06:14,085 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:06:14" (1/1) ... [2025-02-08 14:06:14,087 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a576f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:06:14, skipping insertion in model container [2025-02-08 14:06:14,087 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:06:14" (1/1) ... [2025-02-08 14:06:14,103 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 14:06:14,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:06:14,340 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 14:06:14,362 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:06:14,384 INFO L204 MainTranslator]: Completed translation [2025-02-08 14:06:14,385 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:06:14 WrapperNode [2025-02-08 14:06:14,385 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 14:06:14,385 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 14:06:14,386 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 14:06:14,386 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 14:06:14,389 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:06:14" (1/1) ... [2025-02-08 14:06:14,395 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:06:14" (1/1) ... [2025-02-08 14:06:14,406 INFO L138 Inliner]: procedures = 171, calls = 43, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 138 [2025-02-08 14:06:14,406 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 14:06:14,407 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 14:06:14,407 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 14:06:14,407 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 14:06:14,412 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:06:14" (1/1) ... [2025-02-08 14:06:14,412 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:06:14" (1/1) ... [2025-02-08 14:06:14,414 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:06:14" (1/1) ... [2025-02-08 14:06:14,423 INFO L175 MemorySlicer]: Split 20 memory accesses to 5 slices as follows [2, 2, 5, 5, 6]. 30 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 0, 5, 5, 1]. The 3 writes are split as follows [0, 1, 0, 0, 2]. [2025-02-08 14:06:14,424 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:06:14" (1/1) ... [2025-02-08 14:06:14,424 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:06:14" (1/1) ... [2025-02-08 14:06:14,428 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:06:14" (1/1) ... [2025-02-08 14:06:14,429 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:06:14" (1/1) ... [2025-02-08 14:06:14,430 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:06:14" (1/1) ... [2025-02-08 14:06:14,430 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:06:14" (1/1) ... [2025-02-08 14:06:14,432 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 14:06:14,432 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 14:06:14,432 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 14:06:14,432 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 14:06:14,433 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:06:14" (1/1) ... [2025-02-08 14:06:14,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 14:06:14,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:06:14,457 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:06:14,459 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:06:14,474 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 14:06:14,474 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 14:06:14,474 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 14:06:14,474 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-08 14:06:14,474 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-08 14:06:14,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 14:06:14,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 14:06:14,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 14:06:14,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-08 14:06:14,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-08 14:06:14,475 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 14:06:14,475 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 14:06:14,475 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 14:06:14,475 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-08 14:06:14,475 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-08 14:06:14,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 14:06:14,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 14:06:14,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 14:06:14,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 14:06:14,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-08 14:06:14,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-08 14:06:14,475 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 14:06:14,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 14:06:14,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 14:06:14,476 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:06:14,596 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 14:06:14,598 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 14:06:14,772 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L713: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-02-08 14:06:14,773 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L713-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-02-08 14:06:14,824 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 14:06:14,824 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 14:06:15,057 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 14:06:15,058 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 14:06:15,059 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:06:15 BoogieIcfgContainer [2025-02-08 14:06:15,059 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 14:06:15,061 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 14:06:15,061 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 14:06:15,065 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 14:06:15,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 02:06:14" (1/3) ... [2025-02-08 14:06:15,066 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7139b703 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 02:06:15, skipping insertion in model container [2025-02-08 14:06:15,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:06:14" (2/3) ... [2025-02-08 14:06:15,066 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7139b703 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 02:06:15, skipping insertion in model container [2025-02-08 14:06:15,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:06:15" (3/3) ... [2025-02-08 14:06:15,067 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_51-mutexptr_racefree.i [2025-02-08 14:06:15,076 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 14:06:15,078 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_51-mutexptr_racefree.i that has 2 procedures, 54 locations, 1 initial locations, 6 loop locations, and 8 error locations. [2025-02-08 14:06:15,078 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 14:06:15,120 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-08 14:06:15,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 63 transitions, 133 flow [2025-02-08 14:06:15,179 INFO L124 PetriNetUnfolderBase]: 11/79 cut-off events. [2025-02-08 14:06:15,183 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 14:06:15,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 79 events. 11/79 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 244 event pairs, 0 based on Foata normal form. 0/57 useless extension candidates. Maximal degree in co-relation 54. Up to 4 conditions per place. [2025-02-08 14:06:15,187 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 63 transitions, 133 flow [2025-02-08 14:06:15,190 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 62 transitions, 131 flow [2025-02-08 14:06:15,199 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 14:06:15,209 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;@20738b49, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 14:06:15,209 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-02-08 14:06:15,215 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 14:06:15,215 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-02-08 14:06:15,215 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 14:06:15,215 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:06:15,216 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 14:06:15,216 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-02-08 14:06:15,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:06:15,220 INFO L85 PathProgramCache]: Analyzing trace with hash 426593576, now seen corresponding path program 1 times [2025-02-08 14:06:15,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:06:15,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062192633] [2025-02-08 14:06:15,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:06:15,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:06:15,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:06:15,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:06:15,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:06:15,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:06:15,502 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:06:15,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:06:15,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062192633] [2025-02-08 14:06:15,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062192633] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:06:15,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:06:15,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:06:15,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349489085] [2025-02-08 14:06:15,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:06:15,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:06:15,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:06:15,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:06:15,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:06:15,532 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 63 [2025-02-08 14:06:15,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 62 transitions, 131 flow. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:06:15,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:06:15,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 63 [2025-02-08 14:06:15,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:06:15,711 INFO L124 PetriNetUnfolderBase]: 144/479 cut-off events. [2025-02-08 14:06:15,712 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 14:06:15,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 801 conditions, 479 events. 144/479 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2295 event pairs, 100 based on Foata normal form. 116/543 useless extension candidates. Maximal degree in co-relation 780. Up to 277 conditions per place. [2025-02-08 14:06:15,715 INFO L140 encePairwiseOnDemand]: 49/63 looper letters, 49 selfloop transitions, 3 changer transitions 0/77 dead transitions. [2025-02-08 14:06:15,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 77 transitions, 265 flow [2025-02-08 14:06:15,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:06:15,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:06:15,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 175 transitions. [2025-02-08 14:06:15,726 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6944444444444444 [2025-02-08 14:06:15,727 INFO L175 Difference]: Start difference. First operand has 57 places, 62 transitions, 131 flow. Second operand 4 states and 175 transitions. [2025-02-08 14:06:15,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 77 transitions, 265 flow [2025-02-08 14:06:15,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 77 transitions, 265 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 14:06:15,737 INFO L231 Difference]: Finished difference. Result has 59 places, 52 transitions, 121 flow [2025-02-08 14:06:15,739 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=121, PETRI_PLACES=59, PETRI_TRANSITIONS=52} [2025-02-08 14:06:15,746 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 2 predicate places. [2025-02-08 14:06:15,746 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 52 transitions, 121 flow [2025-02-08 14:06:15,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:06:15,746 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:06:15,746 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-08 14:06:15,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 14:06:15,747 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-02-08 14:06:15,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:06:15,747 INFO L85 PathProgramCache]: Analyzing trace with hash -158617133, now seen corresponding path program 1 times [2025-02-08 14:06:15,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:06:15,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788360296] [2025-02-08 14:06:15,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:06:15,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:06:15,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:06:15,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:06:15,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:06:15,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:06:15,805 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:06:15,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:06:15,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:06:15,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:06:15,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:06:15,851 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:06:15,854 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 14:06:15,856 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-02-08 14:06:15,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 13 remaining) [2025-02-08 14:06:15,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 13 remaining) [2025-02-08 14:06:15,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 13 remaining) [2025-02-08 14:06:15,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 13 remaining) [2025-02-08 14:06:15,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 13 remaining) [2025-02-08 14:06:15,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 13 remaining) [2025-02-08 14:06:15,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 13 remaining) [2025-02-08 14:06:15,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 13 remaining) [2025-02-08 14:06:15,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 13 remaining) [2025-02-08 14:06:15,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 13 remaining) [2025-02-08 14:06:15,859 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 13 remaining) [2025-02-08 14:06:15,859 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 13 remaining) [2025-02-08 14:06:15,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 14:06:15,859 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-08 14:06:15,861 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 14:06:15,861 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 14:06:15,887 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 14:06:15,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 98 transitions, 212 flow [2025-02-08 14:06:15,913 INFO L124 PetriNetUnfolderBase]: 21/149 cut-off events. [2025-02-08 14:06:15,913 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 14:06:15,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 149 events. 21/149 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 571 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 96. Up to 6 conditions per place. [2025-02-08 14:06:15,916 INFO L82 GeneralOperation]: Start removeDead. Operand has 87 places, 98 transitions, 212 flow [2025-02-08 14:06:15,917 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 87 places, 98 transitions, 212 flow [2025-02-08 14:06:15,917 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 14:06:15,919 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;@20738b49, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 14:06:15,919 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-02-08 14:06:15,921 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 14:06:15,922 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-02-08 14:06:15,923 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 14:06:15,923 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:06:15,923 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 14:06:15,924 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-08 14:06:15,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:06:15,924 INFO L85 PathProgramCache]: Analyzing trace with hash 520147179, now seen corresponding path program 1 times [2025-02-08 14:06:15,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:06:15,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128732435] [2025-02-08 14:06:15,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:06:15,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:06:15,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:06:15,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:06:15,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:06:15,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:06:16,040 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:06:16,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:06:16,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128732435] [2025-02-08 14:06:16,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128732435] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:06:16,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:06:16,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:06:16,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708580803] [2025-02-08 14:06:16,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:06:16,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:06:16,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:06:16,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:06:16,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:06:16,050 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 98 [2025-02-08 14:06:16,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 98 transitions, 212 flow. Second operand has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:06:16,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:06:16,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 98 [2025-02-08 14:06:16,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:06:16,951 INFO L124 PetriNetUnfolderBase]: 4742/10617 cut-off events. [2025-02-08 14:06:16,951 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2025-02-08 14:06:16,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18207 conditions, 10617 events. 4742/10617 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 90718 event pairs, 4292 based on Foata normal form. 2712/12168 useless extension candidates. Maximal degree in co-relation 14558. Up to 7478 conditions per place. [2025-02-08 14:06:16,996 INFO L140 encePairwiseOnDemand]: 78/98 looper letters, 68 selfloop transitions, 3 changer transitions 0/111 dead transitions. [2025-02-08 14:06:16,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 111 transitions, 380 flow [2025-02-08 14:06:16,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:06:16,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:06:16,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 260 transitions. [2025-02-08 14:06:16,998 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6632653061224489 [2025-02-08 14:06:16,998 INFO L175 Difference]: Start difference. First operand has 87 places, 98 transitions, 212 flow. Second operand 4 states and 260 transitions. [2025-02-08 14:06:16,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 111 transitions, 380 flow [2025-02-08 14:06:16,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 111 transitions, 380 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 14:06:17,001 INFO L231 Difference]: Finished difference. Result has 92 places, 86 transitions, 208 flow [2025-02-08 14:06:17,001 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=208, PETRI_PLACES=92, PETRI_TRANSITIONS=86} [2025-02-08 14:06:17,001 INFO L279 CegarLoopForPetriNet]: 87 programPoint places, 5 predicate places. [2025-02-08 14:06:17,001 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 86 transitions, 208 flow [2025-02-08 14:06:17,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:06:17,002 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:06:17,002 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-02-08 14:06:17,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 14:06:17,002 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-08 14:06:17,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:06:17,002 INFO L85 PathProgramCache]: Analyzing trace with hash -572415256, now seen corresponding path program 1 times [2025-02-08 14:06:17,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:06:17,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864203530] [2025-02-08 14:06:17,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:06:17,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:06:17,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 14:06:17,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 14:06:17,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:06:17,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:06:17,105 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:06:17,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:06:17,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864203530] [2025-02-08 14:06:17,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864203530] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:06:17,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:06:17,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 14:06:17,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725771097] [2025-02-08 14:06:17,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:06:17,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 14:06:17,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:06:17,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 14:06:17,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 14:06:17,116 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 98 [2025-02-08 14:06:17,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 86 transitions, 208 flow. Second operand has 6 states, 6 states have (on average 41.5) internal successors, (249), 6 states have internal predecessors, (249), 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:06:17,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:06:17,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 98 [2025-02-08 14:06:17,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:06:17,813 INFO L124 PetriNetUnfolderBase]: 4430/8895 cut-off events. [2025-02-08 14:06:17,813 INFO L125 PetriNetUnfolderBase]: For 755/755 co-relation queries the response was YES. [2025-02-08 14:06:17,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16749 conditions, 8895 events. 4430/8895 cut-off events. For 755/755 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 71194 event pairs, 699 based on Foata normal form. 169/8440 useless extension candidates. Maximal degree in co-relation 13998. Up to 4698 conditions per place. [2025-02-08 14:06:17,848 INFO L140 encePairwiseOnDemand]: 93/98 looper letters, 112 selfloop transitions, 6 changer transitions 0/158 dead transitions. [2025-02-08 14:06:17,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 158 transitions, 586 flow [2025-02-08 14:06:17,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:06:17,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 14:06:17,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 359 transitions. [2025-02-08 14:06:17,852 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6105442176870748 [2025-02-08 14:06:17,852 INFO L175 Difference]: Start difference. First operand has 92 places, 86 transitions, 208 flow. Second operand 6 states and 359 transitions. [2025-02-08 14:06:17,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 158 transitions, 586 flow [2025-02-08 14:06:17,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 158 transitions, 584 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:06:17,855 INFO L231 Difference]: Finished difference. Result has 95 places, 85 transitions, 214 flow [2025-02-08 14:06:17,855 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=214, PETRI_PLACES=95, PETRI_TRANSITIONS=85} [2025-02-08 14:06:17,855 INFO L279 CegarLoopForPetriNet]: 87 programPoint places, 8 predicate places. [2025-02-08 14:06:17,855 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 85 transitions, 214 flow [2025-02-08 14:06:17,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 41.5) internal successors, (249), 6 states have internal predecessors, (249), 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:06:17,857 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:06:17,857 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:06:17,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 14:06:17,857 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-08 14:06:17,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:06:17,858 INFO L85 PathProgramCache]: Analyzing trace with hash -618709726, now seen corresponding path program 1 times [2025-02-08 14:06:17,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:06:17,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008478984] [2025-02-08 14:06:17,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:06:17,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:06:17,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:06:17,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:06:17,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:06:17,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:06:17,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:06:17,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:06:17,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008478984] [2025-02-08 14:06:17,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008478984] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:06:17,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:06:17,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:06:17,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258546031] [2025-02-08 14:06:17,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:06:17,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:06:17,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:06:17,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:06:17,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:06:17,956 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 98 [2025-02-08 14:06:17,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 85 transitions, 214 flow. Second operand has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:06:17,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:06:17,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 98 [2025-02-08 14:06:17,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:06:18,872 INFO L124 PetriNetUnfolderBase]: 6126/12957 cut-off events. [2025-02-08 14:06:18,873 INFO L125 PetriNetUnfolderBase]: For 1514/1693 co-relation queries the response was YES. [2025-02-08 14:06:18,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23741 conditions, 12957 events. 6126/12957 cut-off events. For 1514/1693 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 112758 event pairs, 1719 based on Foata normal form. 221/12071 useless extension candidates. Maximal degree in co-relation 18063. Up to 6013 conditions per place. [2025-02-08 14:06:18,933 INFO L140 encePairwiseOnDemand]: 89/98 looper letters, 123 selfloop transitions, 12 changer transitions 0/176 dead transitions. [2025-02-08 14:06:18,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 176 transitions, 720 flow [2025-02-08 14:06:18,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 14:06:18,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 14:06:18,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 341 transitions. [2025-02-08 14:06:18,935 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6959183673469388 [2025-02-08 14:06:18,935 INFO L175 Difference]: Start difference. First operand has 95 places, 85 transitions, 214 flow. Second operand 5 states and 341 transitions. [2025-02-08 14:06:18,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 176 transitions, 720 flow [2025-02-08 14:06:18,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 176 transitions, 697 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-02-08 14:06:18,944 INFO L231 Difference]: Finished difference. Result has 99 places, 96 transitions, 296 flow [2025-02-08 14:06:18,945 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=296, PETRI_PLACES=99, PETRI_TRANSITIONS=96} [2025-02-08 14:06:18,945 INFO L279 CegarLoopForPetriNet]: 87 programPoint places, 12 predicate places. [2025-02-08 14:06:18,946 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 96 transitions, 296 flow [2025-02-08 14:06:18,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:06:18,946 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:06:18,946 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-02-08 14:06:18,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 14:06:18,946 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-08 14:06:18,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:06:18,947 INFO L85 PathProgramCache]: Analyzing trace with hash -565003263, now seen corresponding path program 1 times [2025-02-08 14:06:18,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:06:18,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780529756] [2025-02-08 14:06:18,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:06:18,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:06:18,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:06:18,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:06:18,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:06:18,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:06:19,023 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:06:19,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:06:19,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780529756] [2025-02-08 14:06:19,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780529756] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:06:19,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:06:19,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:06:19,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752260025] [2025-02-08 14:06:19,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:06:19,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:06:19,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:06:19,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:06:19,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:06:19,029 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 98 [2025-02-08 14:06:19,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 96 transitions, 296 flow. Second operand has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 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:06:19,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:06:19,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 98 [2025-02-08 14:06:19,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:06:19,696 INFO L124 PetriNetUnfolderBase]: 6031/12410 cut-off events. [2025-02-08 14:06:19,696 INFO L125 PetriNetUnfolderBase]: For 4330/4335 co-relation queries the response was YES. [2025-02-08 14:06:19,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25730 conditions, 12410 events. 6031/12410 cut-off events. For 4330/4335 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 105833 event pairs, 1352 based on Foata normal form. 185/11934 useless extension candidates. Maximal degree in co-relation 19610. Up to 8290 conditions per place. [2025-02-08 14:06:19,752 INFO L140 encePairwiseOnDemand]: 93/98 looper letters, 108 selfloop transitions, 6 changer transitions 0/154 dead transitions. [2025-02-08 14:06:19,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 154 transitions, 702 flow [2025-02-08 14:06:19,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:06:19,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:06:19,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 252 transitions. [2025-02-08 14:06:19,755 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2025-02-08 14:06:19,755 INFO L175 Difference]: Start difference. First operand has 99 places, 96 transitions, 296 flow. Second operand 4 states and 252 transitions. [2025-02-08 14:06:19,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 154 transitions, 702 flow [2025-02-08 14:06:19,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 154 transitions, 698 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-08 14:06:19,768 INFO L231 Difference]: Finished difference. Result has 101 places, 96 transitions, 308 flow [2025-02-08 14:06:19,768 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=308, PETRI_PLACES=101, PETRI_TRANSITIONS=96} [2025-02-08 14:06:19,771 INFO L279 CegarLoopForPetriNet]: 87 programPoint places, 14 predicate places. [2025-02-08 14:06:19,771 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 96 transitions, 308 flow [2025-02-08 14:06:19,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 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:06:19,772 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:06:19,772 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1] [2025-02-08 14:06:19,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 14:06:19,772 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-08 14:06:19,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:06:19,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1802239914, now seen corresponding path program 1 times [2025-02-08 14:06:19,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:06:19,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451797936] [2025-02-08 14:06:19,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:06:19,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:06:19,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 14:06:19,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:06:19,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:06:19,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:06:19,800 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:06:19,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 14:06:19,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:06:19,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:06:19,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:06:19,822 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:06:19,823 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 14:06:19,823 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 17 remaining) [2025-02-08 14:06:19,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 17 remaining) [2025-02-08 14:06:19,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 17 remaining) [2025-02-08 14:06:19,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 17 remaining) [2025-02-08 14:06:19,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 17 remaining) [2025-02-08 14:06:19,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 17 remaining) [2025-02-08 14:06:19,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 17 remaining) [2025-02-08 14:06:19,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 17 remaining) [2025-02-08 14:06:19,824 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 17 remaining) [2025-02-08 14:06:19,824 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 17 remaining) [2025-02-08 14:06:19,824 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 17 remaining) [2025-02-08 14:06:19,824 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 17 remaining) [2025-02-08 14:06:19,824 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 17 remaining) [2025-02-08 14:06:19,824 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 17 remaining) [2025-02-08 14:06:19,824 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 17 remaining) [2025-02-08 14:06:19,824 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 17 remaining) [2025-02-08 14:06:19,824 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 17 remaining) [2025-02-08 14:06:19,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 14:06:19,824 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-02-08 14:06:19,825 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 14:06:19,825 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-08 14:06:19,850 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 14:06:19,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 133 transitions, 293 flow [2025-02-08 14:06:19,869 INFO L124 PetriNetUnfolderBase]: 34/238 cut-off events. [2025-02-08 14:06:19,869 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-02-08 14:06:19,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 238 events. 34/238 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1025 event pairs, 1 based on Foata normal form. 0/168 useless extension candidates. Maximal degree in co-relation 164. Up to 12 conditions per place. [2025-02-08 14:06:19,870 INFO L82 GeneralOperation]: Start removeDead. Operand has 117 places, 133 transitions, 293 flow [2025-02-08 14:06:19,871 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 133 transitions, 293 flow [2025-02-08 14:06:19,872 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 14:06:19,873 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;@20738b49, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 14:06:19,873 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2025-02-08 14:06:19,875 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 14:06:19,876 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-02-08 14:06:19,876 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 14:06:19,876 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:06:19,876 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 14:06:19,877 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-02-08 14:06:19,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:06:19,878 INFO L85 PathProgramCache]: Analyzing trace with hash 647101457, now seen corresponding path program 1 times [2025-02-08 14:06:19,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:06:19,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464743566] [2025-02-08 14:06:19,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:06:19,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:06:19,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:06:19,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:06:19,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:06:19,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:06:19,933 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:06:19,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:06:19,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464743566] [2025-02-08 14:06:19,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464743566] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:06:19,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:06:19,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:06:19,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657398855] [2025-02-08 14:06:19,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:06:19,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:06:19,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:06:19,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:06:19,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:06:19,941 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 133 [2025-02-08 14:06:19,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 133 transitions, 293 flow. Second operand has 4 states, 4 states have (on average 56.25) internal successors, (225), 4 states have internal predecessors, (225), 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:06:19,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:06:19,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 133 [2025-02-08 14:06:19,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:06:29,495 INFO L124 PetriNetUnfolderBase]: 97039/177154 cut-off events. [2025-02-08 14:06:29,496 INFO L125 PetriNetUnfolderBase]: For 1815/1815 co-relation queries the response was YES. [2025-02-08 14:06:29,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 312806 conditions, 177154 events. 97039/177154 cut-off events. For 1815/1815 co-relation queries the response was YES. Maximal size of possible extension queue 3702. Compared 1889920 event pairs, 91193 based on Foata normal form. 51849/212443 useless extension candidates. Maximal degree in co-relation 137188. Up to 134303 conditions per place. [2025-02-08 14:06:30,353 INFO L140 encePairwiseOnDemand]: 107/133 looper letters, 82 selfloop transitions, 3 changer transitions 0/140 dead transitions. [2025-02-08 14:06:30,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 140 transitions, 477 flow [2025-02-08 14:06:30,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:06:30,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:06:30,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 340 transitions. [2025-02-08 14:06:30,354 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6390977443609023 [2025-02-08 14:06:30,354 INFO L175 Difference]: Start difference. First operand has 117 places, 133 transitions, 293 flow. Second operand 4 states and 340 transitions. [2025-02-08 14:06:30,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 140 transitions, 477 flow [2025-02-08 14:06:30,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 140 transitions, 477 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 14:06:30,358 INFO L231 Difference]: Finished difference. Result has 122 places, 115 transitions, 277 flow [2025-02-08 14:06:30,358 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=277, PETRI_PLACES=122, PETRI_TRANSITIONS=115} [2025-02-08 14:06:30,359 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 5 predicate places. [2025-02-08 14:06:30,359 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 115 transitions, 277 flow [2025-02-08 14:06:30,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.25) internal successors, (225), 4 states have internal predecessors, (225), 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:06:30,363 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:06:30,363 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-02-08 14:06:30,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 14:06:30,363 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-02-08 14:06:30,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:06:30,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1849906520, now seen corresponding path program 1 times [2025-02-08 14:06:30,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:06:30,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270679581] [2025-02-08 14:06:30,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:06:30,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:06:30,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 14:06:30,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 14:06:30,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:06:30,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:06:30,443 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:06:30,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:06:30,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270679581] [2025-02-08 14:06:30,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270679581] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:06:30,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:06:30,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 14:06:30,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92779637] [2025-02-08 14:06:30,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:06:30,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 14:06:30,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:06:30,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 14:06:30,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 14:06:30,455 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 133 [2025-02-08 14:06:30,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 115 transitions, 277 flow. Second operand has 6 states, 6 states have (on average 56.5) internal successors, (339), 6 states have internal predecessors, (339), 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:06:30,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:06:30,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 133 [2025-02-08 14:06:30,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:06:39,507 INFO L124 PetriNetUnfolderBase]: 90643/148271 cut-off events. [2025-02-08 14:06:39,507 INFO L125 PetriNetUnfolderBase]: For 8698/8698 co-relation queries the response was YES. [2025-02-08 14:06:39,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 284694 conditions, 148271 events. 90643/148271 cut-off events. For 8698/8698 co-relation queries the response was YES. Maximal size of possible extension queue 3076. Compared 1413127 event pairs, 10465 based on Foata normal form. 2366/142131 useless extension candidates. Maximal degree in co-relation 21949. Up to 83865 conditions per place. [2025-02-08 14:06:40,296 INFO L140 encePairwiseOnDemand]: 128/133 looper letters, 150 selfloop transitions, 6 changer transitions 0/211 dead transitions. [2025-02-08 14:06:40,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 211 transitions, 779 flow [2025-02-08 14:06:40,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:06:40,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 14:06:40,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 487 transitions. [2025-02-08 14:06:40,298 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6102756892230576 [2025-02-08 14:06:40,298 INFO L175 Difference]: Start difference. First operand has 122 places, 115 transitions, 277 flow. Second operand 6 states and 487 transitions. [2025-02-08 14:06:40,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 211 transitions, 779 flow [2025-02-08 14:06:40,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 211 transitions, 777 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:06:40,309 INFO L231 Difference]: Finished difference. Result has 125 places, 114 transitions, 283 flow [2025-02-08 14:06:40,309 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=283, PETRI_PLACES=125, PETRI_TRANSITIONS=114} [2025-02-08 14:06:40,309 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 8 predicate places. [2025-02-08 14:06:40,310 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 114 transitions, 283 flow [2025-02-08 14:06:40,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 56.5) internal successors, (339), 6 states have internal predecessors, (339), 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:06:40,310 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:06:40,310 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:06:40,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 14:06:40,310 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-02-08 14:06:40,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:06:40,311 INFO L85 PathProgramCache]: Analyzing trace with hash -2107642200, now seen corresponding path program 1 times [2025-02-08 14:06:40,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:06:40,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761896711] [2025-02-08 14:06:40,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:06:40,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:06:40,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:06:40,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:06:40,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:06:40,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:06:40,413 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:06:40,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:06:40,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761896711] [2025-02-08 14:06:40,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761896711] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:06:40,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:06:40,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:06:40,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739898314] [2025-02-08 14:06:40,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:06:40,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:06:40,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:06:40,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:06:40,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:06:40,419 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 133 [2025-02-08 14:06:40,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 114 transitions, 283 flow. Second operand has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:06:40,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:06:40,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 133 [2025-02-08 14:06:40,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand