./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/ldv-races/race-3_1-container_of-global.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-races/race-3_1-container_of-global.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 75716fdd637a22328d600b3257cf24f40a7920b464397c315485c5ed90fb6ece --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:16:26,161 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:16:26,215 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:16:26,220 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:16:26,221 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:16:26,238 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:16:26,238 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:16:26,238 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:16:26,239 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:16:26,239 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:16:26,239 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:16:26,239 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:16:26,239 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:16:26,239 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:16:26,239 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:16:26,239 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:16:26,239 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:16:26,239 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:16:26,239 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:16:26,239 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:16:26,239 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:16:26,239 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:16:26,239 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:16:26,239 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:16:26,240 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:16:26,240 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:16:26,240 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:16:26,240 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:16:26,240 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:16:26,240 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:16:26,240 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:16:26,240 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:16:26,240 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:16:26,240 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:16:26,240 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:16:26,240 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:16:26,240 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:16:26,240 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:16:26,240 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:16:26,240 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:16:26,240 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:16:26,240 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:16:26,241 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:16:26,241 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:16:26,241 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:16:26,241 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/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 -> 75716fdd637a22328d600b3257cf24f40a7920b464397c315485c5ed90fb6ece [2025-03-04 15:16:26,470 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:16:26,477 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:16:26,478 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:16:26,479 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:16:26,479 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:16:26,480 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-races/race-3_1-container_of-global.i [2025-03-04 15:16:27,598 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/334d8c975/1c2d847e0b13432ea98cab75afed03fe/FLAG6ea1f94b7 [2025-03-04 15:16:27,897 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:16:27,898 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-3_1-container_of-global.i [2025-03-04 15:16:27,927 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/334d8c975/1c2d847e0b13432ea98cab75afed03fe/FLAG6ea1f94b7 [2025-03-04 15:16:28,173 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/334d8c975/1c2d847e0b13432ea98cab75afed03fe [2025-03-04 15:16:28,175 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:16:28,176 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:16:28,177 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:16:28,177 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:16:28,180 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:16:28,180 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:16:28" (1/1) ... [2025-03-04 15:16:28,181 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75a3954 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:16:28, skipping insertion in model container [2025-03-04 15:16:28,181 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:16:28" (1/1) ... [2025-03-04 15:16:28,213 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:16:28,549 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:16:28,557 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:16:28,605 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:16:28,633 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:16:28,634 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:16:28 WrapperNode [2025-03-04 15:16:28,635 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:16:28,636 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:16:28,636 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:16:28,636 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:16:28,641 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:16:28" (1/1) ... [2025-03-04 15:16:28,662 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:16:28" (1/1) ... [2025-03-04 15:16:28,680 INFO L138 Inliner]: procedures = 246, calls = 40, calls flagged for inlining = 13, calls inlined = 18, statements flattened = 145 [2025-03-04 15:16:28,680 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:16:28,681 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:16:28,681 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:16:28,681 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:16:28,685 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:16:28" (1/1) ... [2025-03-04 15:16:28,685 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:16:28" (1/1) ... [2025-03-04 15:16:28,688 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:16:28" (1/1) ... [2025-03-04 15:16:28,698 INFO L175 MemorySlicer]: Split 17 memory accesses to 3 slices as follows [2, 13, 2]. 76 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 8 writes are split as follows [0, 6, 2]. [2025-03-04 15:16:28,699 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:16:28" (1/1) ... [2025-03-04 15:16:28,699 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:16:28" (1/1) ... [2025-03-04 15:16:28,706 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:16:28" (1/1) ... [2025-03-04 15:16:28,707 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:16:28" (1/1) ... [2025-03-04 15:16:28,709 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:16:28" (1/1) ... [2025-03-04 15:16:28,710 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:16:28" (1/1) ... [2025-03-04 15:16:28,713 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:16:28,717 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:16:28,717 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:16:28,717 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:16:28,718 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:16:28" (1/1) ... [2025-03-04 15:16:28,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:16:28,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:16:28,759 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 15:16:28,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 15:16:28,778 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2025-03-04 15:16:28,779 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2025-03-04 15:16:28,779 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 15:16:28,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 15:16:28,779 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 15:16:28,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:16:28,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:16:28,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 15:16:28,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:16:28,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:16:28,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 15:16:28,780 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 15:16:28,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:16:28,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 15:16:28,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 15:16:28,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 15:16:28,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:16:28,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 15:16:28,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 15:16:28,780 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:16:28,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:16:28,782 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 15:16:28,980 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:16:28,981 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:16:29,147 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:16:29,148 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:16:29,321 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:16:29,321 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:16:29,321 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:16:29 BoogieIcfgContainer [2025-03-04 15:16:29,321 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:16:29,323 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:16:29,323 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:16:29,327 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:16:29,327 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:16:28" (1/3) ... [2025-03-04 15:16:29,327 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13ee52e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:16:29, skipping insertion in model container [2025-03-04 15:16:29,327 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:16:28" (2/3) ... [2025-03-04 15:16:29,327 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13ee52e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:16:29, skipping insertion in model container [2025-03-04 15:16:29,327 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:16:29" (3/3) ... [2025-03-04 15:16:29,328 INFO L128 eAbstractionObserver]: Analyzing ICFG race-3_1-container_of-global.i [2025-03-04 15:16:29,340 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:16:29,341 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG race-3_1-container_of-global.i that has 2 procedures, 26 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-03-04 15:16:29,341 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:16:29,399 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 15:16:29,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 38 transitions, 90 flow [2025-03-04 15:16:29,456 INFO L124 PetriNetUnfolderBase]: 2/41 cut-off events. [2025-03-04 15:16:29,458 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 15:16:29,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 41 events. 2/41 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 84 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 23. Up to 3 conditions per place. [2025-03-04 15:16:29,461 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 38 transitions, 90 flow [2025-03-04 15:16:29,465 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 32 transitions, 73 flow [2025-03-04 15:16:29,473 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:16:29,482 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;@204f3fa5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:16:29,482 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-04 15:16:29,487 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:16:29,487 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2025-03-04 15:16:29,487 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:16:29,488 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:16:29,488 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:16:29,488 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-04 15:16:29,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:16:29,492 INFO L85 PathProgramCache]: Analyzing trace with hash -379065426, now seen corresponding path program 1 times [2025-03-04 15:16:29,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:16:29,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71300297] [2025-03-04 15:16:29,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:16:29,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:16:29,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:16:29,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:16:29,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:16:29,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:16:30,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:16:30,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:16:30,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71300297] [2025-03-04 15:16:30,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71300297] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:16:30,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:16:30,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 15:16:30,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58266687] [2025-03-04 15:16:30,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:16:30,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:16:30,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:16:30,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:16:30,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:16:30,221 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 38 [2025-03-04 15:16:30,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 32 transitions, 73 flow. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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-03-04 15:16:30,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:16:30,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 38 [2025-03-04 15:16:30,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:16:30,615 INFO L124 PetriNetUnfolderBase]: 621/1208 cut-off events. [2025-03-04 15:16:30,616 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2025-03-04 15:16:30,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2271 conditions, 1208 events. 621/1208 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 6883 event pairs, 193 based on Foata normal form. 44/1176 useless extension candidates. Maximal degree in co-relation 2198. Up to 862 conditions per place. [2025-03-04 15:16:30,630 INFO L140 encePairwiseOnDemand]: 28/38 looper letters, 58 selfloop transitions, 18 changer transitions 3/84 dead transitions. [2025-03-04 15:16:30,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 84 transitions, 344 flow [2025-03-04 15:16:30,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 15:16:30,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 15:16:30,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 155 transitions. [2025-03-04 15:16:30,642 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45321637426900585 [2025-03-04 15:16:30,643 INFO L175 Difference]: Start difference. First operand has 39 places, 32 transitions, 73 flow. Second operand 9 states and 155 transitions. [2025-03-04 15:16:30,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 84 transitions, 344 flow [2025-03-04 15:16:30,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 84 transitions, 336 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:16:30,650 INFO L231 Difference]: Finished difference. Result has 48 places, 50 transitions, 182 flow [2025-03-04 15:16:30,653 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=182, PETRI_PLACES=48, PETRI_TRANSITIONS=50} [2025-03-04 15:16:30,657 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 9 predicate places. [2025-03-04 15:16:30,657 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 50 transitions, 182 flow [2025-03-04 15:16:30,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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-03-04 15:16:30,658 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:16:30,658 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:16:30,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:16:30,658 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-04 15:16:30,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:16:30,659 INFO L85 PathProgramCache]: Analyzing trace with hash 311636105, now seen corresponding path program 1 times [2025-03-04 15:16:30,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:16:30,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705799384] [2025-03-04 15:16:30,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:16:30,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:16:30,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:16:30,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:16:30,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:16:30,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:16:30,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:16:30,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:16:30,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705799384] [2025-03-04 15:16:30,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705799384] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:16:30,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:16:30,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 15:16:30,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931408727] [2025-03-04 15:16:30,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:16:30,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:16:30,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:16:30,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:16:30,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:16:30,992 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 38 [2025-03-04 15:16:30,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 50 transitions, 182 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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-03-04 15:16:30,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:16:30,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 38 [2025-03-04 15:16:30,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:16:31,272 INFO L124 PetriNetUnfolderBase]: 672/1244 cut-off events. [2025-03-04 15:16:31,272 INFO L125 PetriNetUnfolderBase]: For 466/466 co-relation queries the response was YES. [2025-03-04 15:16:31,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2978 conditions, 1244 events. 672/1244 cut-off events. For 466/466 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 6748 event pairs, 271 based on Foata normal form. 44/1254 useless extension candidates. Maximal degree in co-relation 2532. Up to 951 conditions per place. [2025-03-04 15:16:31,280 INFO L140 encePairwiseOnDemand]: 28/38 looper letters, 60 selfloop transitions, 24 changer transitions 5/94 dead transitions. [2025-03-04 15:16:31,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 94 transitions, 496 flow [2025-03-04 15:16:31,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 15:16:31,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 15:16:31,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 153 transitions. [2025-03-04 15:16:31,293 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4473684210526316 [2025-03-04 15:16:31,293 INFO L175 Difference]: Start difference. First operand has 48 places, 50 transitions, 182 flow. Second operand 9 states and 153 transitions. [2025-03-04 15:16:31,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 94 transitions, 496 flow [2025-03-04 15:16:31,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 94 transitions, 494 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:16:31,296 INFO L231 Difference]: Finished difference. Result has 57 places, 62 transitions, 299 flow [2025-03-04 15:16:31,297 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=299, PETRI_PLACES=57, PETRI_TRANSITIONS=62} [2025-03-04 15:16:31,297 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 18 predicate places. [2025-03-04 15:16:31,297 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 62 transitions, 299 flow [2025-03-04 15:16:31,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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-03-04 15:16:31,298 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:16:31,298 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:16:31,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 15:16:31,298 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-04 15:16:31,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:16:31,299 INFO L85 PathProgramCache]: Analyzing trace with hash -2077471653, now seen corresponding path program 1 times [2025-03-04 15:16:31,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:16:31,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939909676] [2025-03-04 15:16:31,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:16:31,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:16:31,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:16:31,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:16:31,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:16:31,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:16:31,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:16:31,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:16:31,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939909676] [2025-03-04 15:16:31,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939909676] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:16:31,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:16:31,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 15:16:31,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942193001] [2025-03-04 15:16:31,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:16:31,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 15:16:31,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:16:31,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 15:16:31,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:16:31,749 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 38 [2025-03-04 15:16:31,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 62 transitions, 299 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 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-03-04 15:16:31,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:16:31,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 38 [2025-03-04 15:16:31,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:16:32,261 INFO L124 PetriNetUnfolderBase]: 838/1529 cut-off events. [2025-03-04 15:16:32,261 INFO L125 PetriNetUnfolderBase]: For 1278/1278 co-relation queries the response was YES. [2025-03-04 15:16:32,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4283 conditions, 1529 events. 838/1529 cut-off events. For 1278/1278 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 8571 event pairs, 209 based on Foata normal form. 52/1581 useless extension candidates. Maximal degree in co-relation 4179. Up to 1091 conditions per place. [2025-03-04 15:16:32,271 INFO L140 encePairwiseOnDemand]: 26/38 looper letters, 74 selfloop transitions, 39 changer transitions 17/135 dead transitions. [2025-03-04 15:16:32,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 135 transitions, 840 flow [2025-03-04 15:16:32,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 15:16:32,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 15:16:32,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 205 transitions. [2025-03-04 15:16:32,276 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44956140350877194 [2025-03-04 15:16:32,277 INFO L175 Difference]: Start difference. First operand has 57 places, 62 transitions, 299 flow. Second operand 12 states and 205 transitions. [2025-03-04 15:16:32,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 135 transitions, 840 flow [2025-03-04 15:16:32,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 135 transitions, 838 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:16:32,287 INFO L231 Difference]: Finished difference. Result has 72 places, 80 transitions, 552 flow [2025-03-04 15:16:32,287 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=552, PETRI_PLACES=72, PETRI_TRANSITIONS=80} [2025-03-04 15:16:32,288 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 33 predicate places. [2025-03-04 15:16:32,288 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 80 transitions, 552 flow [2025-03-04 15:16:32,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 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-03-04 15:16:32,288 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:16:32,289 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:16:32,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 15:16:32,289 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-04 15:16:32,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:16:32,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1761020793, now seen corresponding path program 2 times [2025-03-04 15:16:32,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:16:32,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424083862] [2025-03-04 15:16:32,290 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:16:32,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:16:32,310 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:16:32,321 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:16:32,322 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:16:32,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:16:32,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:16:32,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:16:32,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424083862] [2025-03-04 15:16:32,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424083862] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:16:32,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:16:32,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 15:16:32,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783044697] [2025-03-04 15:16:32,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:16:32,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 15:16:32,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:16:32,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 15:16:32,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:16:32,693 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 38 [2025-03-04 15:16:32,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 80 transitions, 552 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 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-03-04 15:16:32,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:16:32,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 38 [2025-03-04 15:16:32,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:16:33,227 INFO L124 PetriNetUnfolderBase]: 780/1430 cut-off events. [2025-03-04 15:16:33,228 INFO L125 PetriNetUnfolderBase]: For 2883/2883 co-relation queries the response was YES. [2025-03-04 15:16:33,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4669 conditions, 1430 events. 780/1430 cut-off events. For 2883/2883 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7768 event pairs, 284 based on Foata normal form. 52/1482 useless extension candidates. Maximal degree in co-relation 3972. Up to 995 conditions per place. [2025-03-04 15:16:33,239 INFO L140 encePairwiseOnDemand]: 26/38 looper letters, 75 selfloop transitions, 45 changer transitions 14/139 dead transitions. [2025-03-04 15:16:33,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 139 transitions, 1060 flow [2025-03-04 15:16:33,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 15:16:33,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 15:16:33,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 212 transitions. [2025-03-04 15:16:33,241 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4291497975708502 [2025-03-04 15:16:33,242 INFO L175 Difference]: Start difference. First operand has 72 places, 80 transitions, 552 flow. Second operand 13 states and 212 transitions. [2025-03-04 15:16:33,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 139 transitions, 1060 flow [2025-03-04 15:16:33,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 139 transitions, 1035 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 15:16:33,252 INFO L231 Difference]: Finished difference. Result has 86 places, 88 transitions, 756 flow [2025-03-04 15:16:33,252 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=530, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=756, PETRI_PLACES=86, PETRI_TRANSITIONS=88} [2025-03-04 15:16:33,253 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 47 predicate places. [2025-03-04 15:16:33,253 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 88 transitions, 756 flow [2025-03-04 15:16:33,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 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-03-04 15:16:33,253 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:16:33,253 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:16:33,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 15:16:33,254 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-04 15:16:33,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:16:33,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1442375614, now seen corresponding path program 1 times [2025-03-04 15:16:33,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:16:33,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307541140] [2025-03-04 15:16:33,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:16:33,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:16:33,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:16:33,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:16:33,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:16:33,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:16:33,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:16:33,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:16:33,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307541140] [2025-03-04 15:16:33,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307541140] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:16:33,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:16:33,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 15:16:33,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939248576] [2025-03-04 15:16:33,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:16:33,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 15:16:33,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:16:33,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 15:16:33,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:16:33,566 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 38 [2025-03-04 15:16:33,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 88 transitions, 756 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 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-03-04 15:16:33,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:16:33,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 38 [2025-03-04 15:16:33,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:16:34,059 INFO L124 PetriNetUnfolderBase]: 759/1422 cut-off events. [2025-03-04 15:16:34,059 INFO L125 PetriNetUnfolderBase]: For 4177/4189 co-relation queries the response was YES. [2025-03-04 15:16:34,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5282 conditions, 1422 events. 759/1422 cut-off events. For 4177/4189 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 8016 event pairs, 247 based on Foata normal form. 48/1470 useless extension candidates. Maximal degree in co-relation 5150. Up to 1000 conditions per place. [2025-03-04 15:16:34,069 INFO L140 encePairwiseOnDemand]: 26/38 looper letters, 75 selfloop transitions, 42 changer transitions 12/134 dead transitions. [2025-03-04 15:16:34,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 134 transitions, 1165 flow [2025-03-04 15:16:34,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 15:16:34,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 15:16:34,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 212 transitions. [2025-03-04 15:16:34,070 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4291497975708502 [2025-03-04 15:16:34,071 INFO L175 Difference]: Start difference. First operand has 86 places, 88 transitions, 756 flow. Second operand 13 states and 212 transitions. [2025-03-04 15:16:34,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 134 transitions, 1165 flow [2025-03-04 15:16:34,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 134 transitions, 1069 flow, removed 13 selfloop flow, removed 8 redundant places. [2025-03-04 15:16:34,081 INFO L231 Difference]: Finished difference. Result has 92 places, 85 transitions, 741 flow [2025-03-04 15:16:34,081 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=664, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=741, PETRI_PLACES=92, PETRI_TRANSITIONS=85} [2025-03-04 15:16:34,082 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 53 predicate places. [2025-03-04 15:16:34,082 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 85 transitions, 741 flow [2025-03-04 15:16:34,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 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-03-04 15:16:34,082 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:16:34,082 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:16:34,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:16:34,082 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-04 15:16:34,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:16:34,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1761029154, now seen corresponding path program 2 times [2025-03-04 15:16:34,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:16:34,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542475783] [2025-03-04 15:16:34,083 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:16:34,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:16:34,097 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:16:34,104 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:16:34,104 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:16:34,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:16:34,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:16:34,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:16:34,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542475783] [2025-03-04 15:16:34,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542475783] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:16:34,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:16:34,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 15:16:34,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934310527] [2025-03-04 15:16:34,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:16:34,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 15:16:34,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:16:34,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 15:16:34,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:16:34,393 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 38 [2025-03-04 15:16:34,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 85 transitions, 741 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 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-03-04 15:16:34,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:16:34,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 38 [2025-03-04 15:16:34,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:16:34,891 INFO L124 PetriNetUnfolderBase]: 768/1446 cut-off events. [2025-03-04 15:16:34,891 INFO L125 PetriNetUnfolderBase]: For 5089/5110 co-relation queries the response was YES. [2025-03-04 15:16:34,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5478 conditions, 1446 events. 768/1446 cut-off events. For 5089/5110 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 8131 event pairs, 301 based on Foata normal form. 48/1494 useless extension candidates. Maximal degree in co-relation 4323. Up to 1019 conditions per place. [2025-03-04 15:16:34,901 INFO L140 encePairwiseOnDemand]: 26/38 looper letters, 73 selfloop transitions, 40 changer transitions 13/131 dead transitions. [2025-03-04 15:16:34,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 131 transitions, 1173 flow [2025-03-04 15:16:34,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 15:16:34,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 15:16:34,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 198 transitions. [2025-03-04 15:16:34,903 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4342105263157895 [2025-03-04 15:16:34,903 INFO L175 Difference]: Start difference. First operand has 92 places, 85 transitions, 741 flow. Second operand 12 states and 198 transitions. [2025-03-04 15:16:34,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 131 transitions, 1173 flow [2025-03-04 15:16:34,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 131 transitions, 1045 flow, removed 9 selfloop flow, removed 13 redundant places. [2025-03-04 15:16:34,917 INFO L231 Difference]: Finished difference. Result has 92 places, 85 transitions, 719 flow [2025-03-04 15:16:34,917 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=620, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=719, PETRI_PLACES=92, PETRI_TRANSITIONS=85} [2025-03-04 15:16:34,918 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 53 predicate places. [2025-03-04 15:16:34,918 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 85 transitions, 719 flow [2025-03-04 15:16:34,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 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-03-04 15:16:34,918 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:16:34,918 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:16:34,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 15:16:34,918 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-04 15:16:34,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:16:34,919 INFO L85 PathProgramCache]: Analyzing trace with hash -137831678, now seen corresponding path program 1 times [2025-03-04 15:16:34,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:16:34,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964339634] [2025-03-04 15:16:34,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:16:34,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:16:34,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:16:34,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:16:34,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:16:34,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:16:34,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:16:34,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:16:34,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964339634] [2025-03-04 15:16:34,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964339634] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:16:34,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:16:34,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:16:34,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198289349] [2025-03-04 15:16:34,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:16:34,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:16:34,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:16:34,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:16:34,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:16:34,981 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2025-03-04 15:16:34,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 85 transitions, 719 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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-03-04 15:16:34,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:16:34,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2025-03-04 15:16:34,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:16:35,122 INFO L124 PetriNetUnfolderBase]: 365/703 cut-off events. [2025-03-04 15:16:35,123 INFO L125 PetriNetUnfolderBase]: For 1838/1877 co-relation queries the response was YES. [2025-03-04 15:16:35,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2499 conditions, 703 events. 365/703 cut-off events. For 1838/1877 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 3365 event pairs, 61 based on Foata normal form. 0/703 useless extension candidates. Maximal degree in co-relation 2440. Up to 346 conditions per place. [2025-03-04 15:16:35,127 INFO L140 encePairwiseOnDemand]: 35/38 looper letters, 99 selfloop transitions, 7 changer transitions 6/118 dead transitions. [2025-03-04 15:16:35,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 118 transitions, 1155 flow [2025-03-04 15:16:35,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:16:35,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:16:35,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2025-03-04 15:16:35,129 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5526315789473685 [2025-03-04 15:16:35,129 INFO L175 Difference]: Start difference. First operand has 92 places, 85 transitions, 719 flow. Second operand 4 states and 84 transitions. [2025-03-04 15:16:35,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 118 transitions, 1155 flow [2025-03-04 15:16:35,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 118 transitions, 972 flow, removed 25 selfloop flow, removed 15 redundant places. [2025-03-04 15:16:35,135 INFO L231 Difference]: Finished difference. Result has 72 places, 62 transitions, 417 flow [2025-03-04 15:16:35,135 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=415, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=417, PETRI_PLACES=72, PETRI_TRANSITIONS=62} [2025-03-04 15:16:35,135 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 33 predicate places. [2025-03-04 15:16:35,136 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 62 transitions, 417 flow [2025-03-04 15:16:35,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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-03-04 15:16:35,136 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:16:35,136 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:16:35,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 15:16:35,136 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-04 15:16:35,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:16:35,137 INFO L85 PathProgramCache]: Analyzing trace with hash -2094261568, now seen corresponding path program 1 times [2025-03-04 15:16:35,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:16:35,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208131383] [2025-03-04 15:16:35,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:16:35,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:16:35,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:16:35,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:16:35,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:16:35,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:16:35,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-03-04 15:16:35,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:16:35,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208131383] [2025-03-04 15:16:35,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208131383] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:16:35,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:16:35,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 15:16:35,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125326408] [2025-03-04 15:16:35,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:16:35,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 15:16:35,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:16:35,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 15:16:35,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:16:35,461 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 38 [2025-03-04 15:16:35,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 62 transitions, 417 flow. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 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-03-04 15:16:35,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:16:35,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 38 [2025-03-04 15:16:35,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:16:35,850 INFO L124 PetriNetUnfolderBase]: 561/996 cut-off events. [2025-03-04 15:16:35,850 INFO L125 PetriNetUnfolderBase]: For 1477/1477 co-relation queries the response was YES. [2025-03-04 15:16:35,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3197 conditions, 996 events. 561/996 cut-off events. For 1477/1477 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4628 event pairs, 84 based on Foata normal form. 14/1010 useless extension candidates. Maximal degree in co-relation 3071. Up to 226 conditions per place. [2025-03-04 15:16:35,856 INFO L140 encePairwiseOnDemand]: 29/38 looper letters, 100 selfloop transitions, 28 changer transitions 0/128 dead transitions. [2025-03-04 15:16:35,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 128 transitions, 905 flow [2025-03-04 15:16:35,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 15:16:35,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 15:16:35,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 146 transitions. [2025-03-04 15:16:35,857 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3492822966507177 [2025-03-04 15:16:35,857 INFO L175 Difference]: Start difference. First operand has 72 places, 62 transitions, 417 flow. Second operand 11 states and 146 transitions. [2025-03-04 15:16:35,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 128 transitions, 905 flow [2025-03-04 15:16:35,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 128 transitions, 852 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-03-04 15:16:35,862 INFO L231 Difference]: Finished difference. Result has 81 places, 67 transitions, 477 flow [2025-03-04 15:16:35,863 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=477, PETRI_PLACES=81, PETRI_TRANSITIONS=67} [2025-03-04 15:16:35,863 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 42 predicate places. [2025-03-04 15:16:35,863 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 67 transitions, 477 flow [2025-03-04 15:16:35,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 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-03-04 15:16:35,863 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:16:35,863 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:16:35,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 15:16:35,864 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-04 15:16:35,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:16:35,864 INFO L85 PathProgramCache]: Analyzing trace with hash 774137964, now seen corresponding path program 2 times [2025-03-04 15:16:35,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:16:35,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100206183] [2025-03-04 15:16:35,864 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:16:35,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:16:35,890 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:16:35,896 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:16:35,897 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:16:35,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:16:36,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:16:36,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:16:36,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100206183] [2025-03-04 15:16:36,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100206183] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:16:36,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:16:36,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 15:16:36,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337229496] [2025-03-04 15:16:36,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:16:36,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 15:16:36,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:16:36,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 15:16:36,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:16:36,226 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 38 [2025-03-04 15:16:36,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 67 transitions, 477 flow. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 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-03-04 15:16:36,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:16:36,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 38 [2025-03-04 15:16:36,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:16:36,646 INFO L124 PetriNetUnfolderBase]: 649/1242 cut-off events. [2025-03-04 15:16:36,647 INFO L125 PetriNetUnfolderBase]: For 1618/1618 co-relation queries the response was YES. [2025-03-04 15:16:36,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3920 conditions, 1242 events. 649/1242 cut-off events. For 1618/1618 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 6668 event pairs, 152 based on Foata normal form. 14/1256 useless extension candidates. Maximal degree in co-relation 3785. Up to 379 conditions per place. [2025-03-04 15:16:36,655 INFO L140 encePairwiseOnDemand]: 30/38 looper letters, 106 selfloop transitions, 21 changer transitions 0/131 dead transitions. [2025-03-04 15:16:36,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 131 transitions, 932 flow [2025-03-04 15:16:36,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:16:36,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 15:16:36,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 149 transitions. [2025-03-04 15:16:36,657 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39210526315789473 [2025-03-04 15:16:36,657 INFO L175 Difference]: Start difference. First operand has 81 places, 67 transitions, 477 flow. Second operand 10 states and 149 transitions. [2025-03-04 15:16:36,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 131 transitions, 932 flow [2025-03-04 15:16:36,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 131 transitions, 894 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-03-04 15:16:36,663 INFO L231 Difference]: Finished difference. Result has 90 places, 72 transitions, 526 flow [2025-03-04 15:16:36,663 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=442, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=526, PETRI_PLACES=90, PETRI_TRANSITIONS=72} [2025-03-04 15:16:36,664 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 51 predicate places. [2025-03-04 15:16:36,664 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 72 transitions, 526 flow [2025-03-04 15:16:36,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 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-03-04 15:16:36,664 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:16:36,664 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:16:36,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 15:16:36,665 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-04 15:16:36,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:16:36,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1116436554, now seen corresponding path program 3 times [2025-03-04 15:16:36,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:16:36,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180056092] [2025-03-04 15:16:36,665 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:16:36,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:16:36,679 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:16:36,685 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:16:36,686 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 15:16:36,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:16:36,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:16:36,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:16:36,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180056092] [2025-03-04 15:16:36,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180056092] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:16:36,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:16:36,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 15:16:36,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503099165] [2025-03-04 15:16:36,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:16:36,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 15:16:36,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:16:36,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 15:16:36,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:16:36,981 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 38 [2025-03-04 15:16:36,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 72 transitions, 526 flow. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 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-03-04 15:16:36,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:16:36,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 38 [2025-03-04 15:16:36,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:16:37,354 INFO L124 PetriNetUnfolderBase]: 630/1207 cut-off events. [2025-03-04 15:16:37,354 INFO L125 PetriNetUnfolderBase]: For 2150/2150 co-relation queries the response was YES. [2025-03-04 15:16:37,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3954 conditions, 1207 events. 630/1207 cut-off events. For 2150/2150 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6457 event pairs, 204 based on Foata normal form. 14/1221 useless extension candidates. Maximal degree in co-relation 3816. Up to 480 conditions per place. [2025-03-04 15:16:37,362 INFO L140 encePairwiseOnDemand]: 30/38 looper letters, 95 selfloop transitions, 26 changer transitions 0/125 dead transitions. [2025-03-04 15:16:37,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 125 transitions, 936 flow [2025-03-04 15:16:37,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 15:16:37,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 15:16:37,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 133 transitions. [2025-03-04 15:16:37,364 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2025-03-04 15:16:37,364 INFO L175 Difference]: Start difference. First operand has 90 places, 72 transitions, 526 flow. Second operand 9 states and 133 transitions. [2025-03-04 15:16:37,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 125 transitions, 936 flow [2025-03-04 15:16:37,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 125 transitions, 905 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-03-04 15:16:37,371 INFO L231 Difference]: Finished difference. Result has 100 places, 75 transitions, 605 flow [2025-03-04 15:16:37,372 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=497, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=605, PETRI_PLACES=100, PETRI_TRANSITIONS=75} [2025-03-04 15:16:37,372 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 61 predicate places. [2025-03-04 15:16:37,372 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 75 transitions, 605 flow [2025-03-04 15:16:37,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 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-03-04 15:16:37,373 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:16:37,373 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:16:37,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 15:16:37,373 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-04 15:16:37,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:16:37,373 INFO L85 PathProgramCache]: Analyzing trace with hash -360603574, now seen corresponding path program 4 times [2025-03-04 15:16:37,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:16:37,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123873065] [2025-03-04 15:16:37,373 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:16:37,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:16:37,389 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 15 statements into 2 equivalence classes. [2025-03-04 15:16:37,401 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:16:37,403 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:16:37,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:16:37,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:16:37,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:16:37,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123873065] [2025-03-04 15:16:37,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123873065] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:16:37,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:16:37,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 15:16:37,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623380118] [2025-03-04 15:16:37,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:16:37,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 15:16:37,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:16:37,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 15:16:37,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:16:37,686 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 38 [2025-03-04 15:16:37,687 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 75 transitions, 605 flow. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 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-03-04 15:16:37,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:16:37,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 38 [2025-03-04 15:16:37,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:16:38,161 INFO L124 PetriNetUnfolderBase]: 887/1600 cut-off events. [2025-03-04 15:16:38,161 INFO L125 PetriNetUnfolderBase]: For 3061/3061 co-relation queries the response was YES. [2025-03-04 15:16:38,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5473 conditions, 1600 events. 887/1600 cut-off events. For 3061/3061 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8553 event pairs, 178 based on Foata normal form. 26/1626 useless extension candidates. Maximal degree in co-relation 5321. Up to 499 conditions per place. [2025-03-04 15:16:38,173 INFO L140 encePairwiseOnDemand]: 28/38 looper letters, 123 selfloop transitions, 33 changer transitions 0/156 dead transitions. [2025-03-04 15:16:38,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 156 transitions, 1181 flow [2025-03-04 15:16:38,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 15:16:38,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 15:16:38,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 171 transitions. [2025-03-04 15:16:38,175 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.375 [2025-03-04 15:16:38,175 INFO L175 Difference]: Start difference. First operand has 100 places, 75 transitions, 605 flow. Second operand 12 states and 171 transitions. [2025-03-04 15:16:38,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 156 transitions, 1181 flow [2025-03-04 15:16:38,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 156 transitions, 1134 flow, removed 4 selfloop flow, removed 5 redundant places. [2025-03-04 15:16:38,184 INFO L231 Difference]: Finished difference. Result has 110 places, 81 transitions, 694 flow [2025-03-04 15:16:38,184 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=559, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=694, PETRI_PLACES=110, PETRI_TRANSITIONS=81} [2025-03-04 15:16:38,185 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 71 predicate places. [2025-03-04 15:16:38,185 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 81 transitions, 694 flow [2025-03-04 15:16:38,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 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-03-04 15:16:38,185 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:16:38,185 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:16:38,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 15:16:38,185 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-04 15:16:38,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:16:38,186 INFO L85 PathProgramCache]: Analyzing trace with hash -123545526, now seen corresponding path program 5 times [2025-03-04 15:16:38,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:16:38,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441269767] [2025-03-04 15:16:38,186 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:16:38,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:16:38,201 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:16:38,210 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:16:38,211 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:16:38,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:16:38,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:16:38,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:16:38,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441269767] [2025-03-04 15:16:38,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441269767] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:16:38,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:16:38,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 15:16:38,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356726619] [2025-03-04 15:16:38,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:16:38,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 15:16:38,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:16:38,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 15:16:38,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:16:38,449 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 38 [2025-03-04 15:16:38,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 81 transitions, 694 flow. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 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-03-04 15:16:38,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:16:38,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 38 [2025-03-04 15:16:38,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:16:38,908 INFO L124 PetriNetUnfolderBase]: 941/1700 cut-off events. [2025-03-04 15:16:38,908 INFO L125 PetriNetUnfolderBase]: For 3789/3789 co-relation queries the response was YES. [2025-03-04 15:16:38,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6102 conditions, 1700 events. 941/1700 cut-off events. For 3789/3789 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9225 event pairs, 204 based on Foata normal form. 26/1726 useless extension candidates. Maximal degree in co-relation 5723. Up to 697 conditions per place. [2025-03-04 15:16:38,920 INFO L140 encePairwiseOnDemand]: 28/38 looper letters, 123 selfloop transitions, 32 changer transitions 0/155 dead transitions. [2025-03-04 15:16:38,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 155 transitions, 1245 flow [2025-03-04 15:16:38,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 15:16:38,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 15:16:38,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 165 transitions. [2025-03-04 15:16:38,924 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3618421052631579 [2025-03-04 15:16:38,924 INFO L175 Difference]: Start difference. First operand has 110 places, 81 transitions, 694 flow. Second operand 12 states and 165 transitions. [2025-03-04 15:16:38,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 155 transitions, 1245 flow [2025-03-04 15:16:38,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 155 transitions, 1199 flow, removed 8 selfloop flow, removed 8 redundant places. [2025-03-04 15:16:38,938 INFO L231 Difference]: Finished difference. Result has 114 places, 83 transitions, 742 flow [2025-03-04 15:16:38,938 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=638, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=742, PETRI_PLACES=114, PETRI_TRANSITIONS=83} [2025-03-04 15:16:38,939 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 75 predicate places. [2025-03-04 15:16:38,939 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 83 transitions, 742 flow [2025-03-04 15:16:38,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 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-03-04 15:16:38,939 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:16:38,939 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:16:38,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 15:16:38,939 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-04 15:16:38,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:16:38,939 INFO L85 PathProgramCache]: Analyzing trace with hash -2070933149, now seen corresponding path program 1 times [2025-03-04 15:16:38,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:16:38,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551028855] [2025-03-04 15:16:38,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:16:38,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:16:38,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:16:38,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:16:38,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:16:38,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:16:39,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:16:39,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:16:39,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551028855] [2025-03-04 15:16:39,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551028855] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:16:39,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:16:39,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 15:16:39,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819844542] [2025-03-04 15:16:39,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:16:39,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 15:16:39,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:16:39,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 15:16:39,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:16:39,267 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 38 [2025-03-04 15:16:39,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 83 transitions, 742 flow. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 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-03-04 15:16:39,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:16:39,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 38 [2025-03-04 15:16:39,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:16:39,688 INFO L124 PetriNetUnfolderBase]: 1024/1851 cut-off events. [2025-03-04 15:16:39,688 INFO L125 PetriNetUnfolderBase]: For 4023/4023 co-relation queries the response was YES. [2025-03-04 15:16:39,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6813 conditions, 1851 events. 1024/1851 cut-off events. For 4023/4023 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 10320 event pairs, 146 based on Foata normal form. 12/1863 useless extension candidates. Maximal degree in co-relation 6363. Up to 768 conditions per place. [2025-03-04 15:16:39,697 INFO L140 encePairwiseOnDemand]: 29/38 looper letters, 111 selfloop transitions, 35 changer transitions 0/146 dead transitions. [2025-03-04 15:16:39,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 146 transitions, 1272 flow [2025-03-04 15:16:39,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 15:16:39,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 15:16:39,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 150 transitions. [2025-03-04 15:16:39,701 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32894736842105265 [2025-03-04 15:16:39,701 INFO L175 Difference]: Start difference. First operand has 114 places, 83 transitions, 742 flow. Second operand 12 states and 150 transitions. [2025-03-04 15:16:39,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 146 transitions, 1272 flow [2025-03-04 15:16:39,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 146 transitions, 1190 flow, removed 16 selfloop flow, removed 10 redundant places. [2025-03-04 15:16:39,717 INFO L231 Difference]: Finished difference. Result has 118 places, 88 transitions, 807 flow [2025-03-04 15:16:39,718 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=673, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=807, PETRI_PLACES=118, PETRI_TRANSITIONS=88} [2025-03-04 15:16:39,718 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 79 predicate places. [2025-03-04 15:16:39,719 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 88 transitions, 807 flow [2025-03-04 15:16:39,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 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-03-04 15:16:39,719 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:16:39,719 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:16:39,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 15:16:39,719 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-04 15:16:39,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:16:39,720 INFO L85 PathProgramCache]: Analyzing trace with hash 2048747747, now seen corresponding path program 2 times [2025-03-04 15:16:39,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:16:39,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658799615] [2025-03-04 15:16:39,720 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:16:39,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:16:39,731 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:16:39,737 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:16:39,737 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:16:39,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:16:40,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:16:40,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:16:40,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658799615] [2025-03-04 15:16:40,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658799615] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:16:40,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:16:40,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 15:16:40,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545920523] [2025-03-04 15:16:40,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:16:40,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 15:16:40,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:16:40,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 15:16:40,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:16:40,016 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 38 [2025-03-04 15:16:40,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 88 transitions, 807 flow. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 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-03-04 15:16:40,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:16:40,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 38 [2025-03-04 15:16:40,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:16:40,435 INFO L124 PetriNetUnfolderBase]: 1097/1984 cut-off events. [2025-03-04 15:16:40,435 INFO L125 PetriNetUnfolderBase]: For 4288/4288 co-relation queries the response was YES. [2025-03-04 15:16:40,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7203 conditions, 1984 events. 1097/1984 cut-off events. For 4288/4288 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 11226 event pairs, 164 based on Foata normal form. 12/1996 useless extension candidates. Maximal degree in co-relation 6742. Up to 442 conditions per place. [2025-03-04 15:16:40,446 INFO L140 encePairwiseOnDemand]: 29/38 looper letters, 99 selfloop transitions, 45 changer transitions 0/144 dead transitions. [2025-03-04 15:16:40,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 144 transitions, 1281 flow [2025-03-04 15:16:40,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 15:16:40,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 15:16:40,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 139 transitions. [2025-03-04 15:16:40,448 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.33253588516746413 [2025-03-04 15:16:40,449 INFO L175 Difference]: Start difference. First operand has 118 places, 88 transitions, 807 flow. Second operand 11 states and 139 transitions. [2025-03-04 15:16:40,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 144 transitions, 1281 flow [2025-03-04 15:16:40,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 144 transitions, 1236 flow, removed 8 selfloop flow, removed 3 redundant places. [2025-03-04 15:16:40,462 INFO L231 Difference]: Finished difference. Result has 128 places, 90 transitions, 896 flow [2025-03-04 15:16:40,462 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=764, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=896, PETRI_PLACES=128, PETRI_TRANSITIONS=90} [2025-03-04 15:16:40,462 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 89 predicate places. [2025-03-04 15:16:40,462 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 90 transitions, 896 flow [2025-03-04 15:16:40,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 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-03-04 15:16:40,463 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:16:40,463 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:16:40,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 15:16:40,463 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-04 15:16:40,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:16:40,463 INFO L85 PathProgramCache]: Analyzing trace with hash 2051544257, now seen corresponding path program 3 times [2025-03-04 15:16:40,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:16:40,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001764361] [2025-03-04 15:16:40,463 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:16:40,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:16:40,476 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:16:40,482 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:16:40,482 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 15:16:40,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:16:40,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:16:40,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:16:40,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001764361] [2025-03-04 15:16:40,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001764361] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:16:40,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:16:40,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 15:16:40,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684094111] [2025-03-04 15:16:40,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:16:40,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 15:16:40,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:16:40,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 15:16:40,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:16:40,723 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 38 [2025-03-04 15:16:40,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 90 transitions, 896 flow. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 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-03-04 15:16:40,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:16:40,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 38 [2025-03-04 15:16:40,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:16:41,136 INFO L124 PetriNetUnfolderBase]: 1080/1955 cut-off events. [2025-03-04 15:16:41,136 INFO L125 PetriNetUnfolderBase]: For 4931/4931 co-relation queries the response was YES. [2025-03-04 15:16:41,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7388 conditions, 1955 events. 1080/1955 cut-off events. For 4931/4931 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 11042 event pairs, 184 based on Foata normal form. 12/1967 useless extension candidates. Maximal degree in co-relation 7028. Up to 579 conditions per place. [2025-03-04 15:16:41,147 INFO L140 encePairwiseOnDemand]: 29/38 looper letters, 98 selfloop transitions, 45 changer transitions 0/143 dead transitions. [2025-03-04 15:16:41,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 143 transitions, 1330 flow [2025-03-04 15:16:41,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 15:16:41,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 15:16:41,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 138 transitions. [2025-03-04 15:16:41,152 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.33014354066985646 [2025-03-04 15:16:41,152 INFO L175 Difference]: Start difference. First operand has 128 places, 90 transitions, 896 flow. Second operand 11 states and 138 transitions. [2025-03-04 15:16:41,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 143 transitions, 1330 flow [2025-03-04 15:16:41,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 143 transitions, 1220 flow, removed 6 selfloop flow, removed 12 redundant places. [2025-03-04 15:16:41,166 INFO L231 Difference]: Finished difference. Result has 125 places, 89 transitions, 864 flow [2025-03-04 15:16:41,166 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=774, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=864, PETRI_PLACES=125, PETRI_TRANSITIONS=89} [2025-03-04 15:16:41,167 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 86 predicate places. [2025-03-04 15:16:41,167 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 89 transitions, 864 flow [2025-03-04 15:16:41,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 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-03-04 15:16:41,167 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:16:41,167 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:16:41,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 15:16:41,167 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-04 15:16:41,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:16:41,168 INFO L85 PathProgramCache]: Analyzing trace with hash 566642744, now seen corresponding path program 1 times [2025-03-04 15:16:41,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:16:41,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995945072] [2025-03-04 15:16:41,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:16:41,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:16:41,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:16:41,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:16:41,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:16:41,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:16:41,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:16:41,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:16:41,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995945072] [2025-03-04 15:16:41,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995945072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:16:41,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:16:41,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 15:16:41,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617995188] [2025-03-04 15:16:41,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:16:41,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 15:16:41,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:16:41,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 15:16:41,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-04 15:16:41,496 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 38 [2025-03-04 15:16:41,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 89 transitions, 864 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 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-03-04 15:16:41,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:16:41,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 38 [2025-03-04 15:16:41,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:16:41,864 INFO L124 PetriNetUnfolderBase]: 775/1588 cut-off events. [2025-03-04 15:16:41,864 INFO L125 PetriNetUnfolderBase]: For 3939/3939 co-relation queries the response was YES. [2025-03-04 15:16:41,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6023 conditions, 1588 events. 775/1588 cut-off events. For 3939/3939 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 9900 event pairs, 166 based on Foata normal form. 42/1618 useless extension candidates. Maximal degree in co-relation 5883. Up to 658 conditions per place. [2025-03-04 15:16:41,870 INFO L140 encePairwiseOnDemand]: 29/38 looper letters, 55 selfloop transitions, 23 changer transitions 38/128 dead transitions. [2025-03-04 15:16:41,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 128 transitions, 1183 flow [2025-03-04 15:16:41,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 15:16:41,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 15:16:41,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 157 transitions. [2025-03-04 15:16:41,872 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3442982456140351 [2025-03-04 15:16:41,872 INFO L175 Difference]: Start difference. First operand has 125 places, 89 transitions, 864 flow. Second operand 12 states and 157 transitions. [2025-03-04 15:16:41,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 128 transitions, 1183 flow [2025-03-04 15:16:41,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 128 transitions, 1060 flow, removed 5 selfloop flow, removed 12 redundant places. [2025-03-04 15:16:41,879 INFO L231 Difference]: Finished difference. Result has 123 places, 71 transitions, 631 flow [2025-03-04 15:16:41,880 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=719, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=631, PETRI_PLACES=123, PETRI_TRANSITIONS=71} [2025-03-04 15:16:41,880 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 84 predicate places. [2025-03-04 15:16:41,881 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 71 transitions, 631 flow [2025-03-04 15:16:41,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 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-03-04 15:16:41,881 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:16:41,881 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:16:41,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 15:16:41,881 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-04 15:16:41,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:16:41,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1706191486, now seen corresponding path program 2 times [2025-03-04 15:16:41,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:16:41,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842433340] [2025-03-04 15:16:41,882 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:16:41,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:16:41,893 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:16:41,900 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:16:41,901 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:16:41,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:16:42,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:16:42,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:16:42,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842433340] [2025-03-04 15:16:42,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842433340] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:16:42,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:16:42,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 15:16:42,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499654438] [2025-03-04 15:16:42,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:16:42,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 15:16:42,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:16:42,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 15:16:42,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-04 15:16:42,164 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 38 [2025-03-04 15:16:42,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 71 transitions, 631 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 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-03-04 15:16:42,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:16:42,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 38 [2025-03-04 15:16:42,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:16:42,516 INFO L124 PetriNetUnfolderBase]: 565/1142 cut-off events. [2025-03-04 15:16:42,516 INFO L125 PetriNetUnfolderBase]: For 2267/2267 co-relation queries the response was YES. [2025-03-04 15:16:42,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4140 conditions, 1142 events. 565/1142 cut-off events. For 2267/2267 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 6454 event pairs, 152 based on Foata normal form. 14/1148 useless extension candidates. Maximal degree in co-relation 4074. Up to 766 conditions per place. [2025-03-04 15:16:42,521 INFO L140 encePairwiseOnDemand]: 28/38 looper letters, 57 selfloop transitions, 22 changer transitions 25/114 dead transitions. [2025-03-04 15:16:42,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 114 transitions, 950 flow [2025-03-04 15:16:42,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 15:16:42,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 15:16:42,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 168 transitions. [2025-03-04 15:16:42,522 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.340080971659919 [2025-03-04 15:16:42,522 INFO L175 Difference]: Start difference. First operand has 123 places, 71 transitions, 631 flow. Second operand 13 states and 168 transitions. [2025-03-04 15:16:42,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 114 transitions, 950 flow [2025-03-04 15:16:42,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 114 transitions, 876 flow, removed 1 selfloop flow, removed 13 redundant places. [2025-03-04 15:16:42,527 INFO L231 Difference]: Finished difference. Result has 110 places, 65 transitions, 552 flow [2025-03-04 15:16:42,527 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=557, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=552, PETRI_PLACES=110, PETRI_TRANSITIONS=65} [2025-03-04 15:16:42,527 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 71 predicate places. [2025-03-04 15:16:42,527 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 65 transitions, 552 flow [2025-03-04 15:16:42,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 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-03-04 15:16:42,528 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:16:42,528 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:16:42,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 15:16:42,528 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-04 15:16:42,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:16:42,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1439958256, now seen corresponding path program 1 times [2025-03-04 15:16:42,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:16:42,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451733478] [2025-03-04 15:16:42,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:16:42,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:16:42,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:16:42,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:16:42,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:16:42,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:16:42,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:16:42,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:16:42,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451733478] [2025-03-04 15:16:42,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451733478] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:16:42,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:16:42,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 15:16:42,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843539171] [2025-03-04 15:16:42,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:16:42,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 15:16:42,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:16:42,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 15:16:42,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-04 15:16:42,800 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 38 [2025-03-04 15:16:42,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 65 transitions, 552 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 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-03-04 15:16:42,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:16:42,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 38 [2025-03-04 15:16:42,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:16:43,146 INFO L124 PetriNetUnfolderBase]: 487/986 cut-off events. [2025-03-04 15:16:43,146 INFO L125 PetriNetUnfolderBase]: For 1932/1932 co-relation queries the response was YES. [2025-03-04 15:16:43,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3547 conditions, 986 events. 487/986 cut-off events. For 1932/1932 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5339 event pairs, 136 based on Foata normal form. 12/990 useless extension candidates. Maximal degree in co-relation 3482. Up to 654 conditions per place. [2025-03-04 15:16:43,150 INFO L140 encePairwiseOnDemand]: 28/38 looper letters, 45 selfloop transitions, 14 changer transitions 34/102 dead transitions. [2025-03-04 15:16:43,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 102 transitions, 832 flow [2025-03-04 15:16:43,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 15:16:43,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 15:16:43,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 159 transitions. [2025-03-04 15:16:43,152 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32186234817813764 [2025-03-04 15:16:43,152 INFO L175 Difference]: Start difference. First operand has 110 places, 65 transitions, 552 flow. Second operand 13 states and 159 transitions. [2025-03-04 15:16:43,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 102 transitions, 832 flow [2025-03-04 15:16:43,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 102 transitions, 764 flow, removed 1 selfloop flow, removed 13 redundant places. [2025-03-04 15:16:43,156 INFO L231 Difference]: Finished difference. Result has 105 places, 54 transitions, 410 flow [2025-03-04 15:16:43,157 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=484, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=410, PETRI_PLACES=105, PETRI_TRANSITIONS=54} [2025-03-04 15:16:43,157 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 66 predicate places. [2025-03-04 15:16:43,157 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 54 transitions, 410 flow [2025-03-04 15:16:43,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 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-03-04 15:16:43,157 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:16:43,157 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:16:43,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 15:16:43,158 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-04 15:16:43,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:16:43,158 INFO L85 PathProgramCache]: Analyzing trace with hash 465056382, now seen corresponding path program 3 times [2025-03-04 15:16:43,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:16:43,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837070574] [2025-03-04 15:16:43,158 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:16:43,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:16:43,170 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:16:43,176 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:16:43,176 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 15:16:43,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:16:43,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:16:43,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:16:43,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837070574] [2025-03-04 15:16:43,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837070574] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:16:43,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:16:43,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 15:16:43,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688717092] [2025-03-04 15:16:43,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:16:43,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 15:16:43,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:16:43,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 15:16:43,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-04 15:16:43,477 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 38 [2025-03-04 15:16:43,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 54 transitions, 410 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 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-03-04 15:16:43,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:16:43,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 38 [2025-03-04 15:16:43,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:16:43,780 INFO L124 PetriNetUnfolderBase]: 381/782 cut-off events. [2025-03-04 15:16:43,780 INFO L125 PetriNetUnfolderBase]: For 1480/1480 co-relation queries the response was YES. [2025-03-04 15:16:43,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2717 conditions, 782 events. 381/782 cut-off events. For 1480/1480 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4091 event pairs, 80 based on Foata normal form. 14/792 useless extension candidates. Maximal degree in co-relation 2684. Up to 475 conditions per place. [2025-03-04 15:16:43,784 INFO L140 encePairwiseOnDemand]: 28/38 looper letters, 35 selfloop transitions, 19 changer transitions 25/86 dead transitions. [2025-03-04 15:16:43,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 86 transitions, 651 flow [2025-03-04 15:16:43,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 15:16:43,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 15:16:43,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 156 transitions. [2025-03-04 15:16:43,785 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2932330827067669 [2025-03-04 15:16:43,785 INFO L175 Difference]: Start difference. First operand has 105 places, 54 transitions, 410 flow. Second operand 14 states and 156 transitions. [2025-03-04 15:16:43,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 86 transitions, 651 flow [2025-03-04 15:16:43,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 86 transitions, 551 flow, removed 3 selfloop flow, removed 20 redundant places. [2025-03-04 15:16:43,790 INFO L231 Difference]: Finished difference. Result has 84 places, 43 transitions, 292 flow [2025-03-04 15:16:43,790 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=292, PETRI_PLACES=84, PETRI_TRANSITIONS=43} [2025-03-04 15:16:43,790 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 45 predicate places. [2025-03-04 15:16:43,790 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 43 transitions, 292 flow [2025-03-04 15:16:43,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 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-03-04 15:16:43,790 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:16:43,790 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:16:43,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 15:16:43,792 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-04 15:16:43,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:16:43,792 INFO L85 PathProgramCache]: Analyzing trace with hash 198823152, now seen corresponding path program 2 times [2025-03-04 15:16:43,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:16:43,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859775778] [2025-03-04 15:16:43,793 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:16:43,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:16:43,803 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:16:43,808 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:16:43,809 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:16:43,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:16:44,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-03-04 15:16:44,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:16:44,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859775778] [2025-03-04 15:16:44,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859775778] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:16:44,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:16:44,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 15:16:44,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190915832] [2025-03-04 15:16:44,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:16:44,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 15:16:44,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:16:44,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 15:16:44,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-04 15:16:44,060 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 38 [2025-03-04 15:16:44,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 43 transitions, 292 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 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-03-04 15:16:44,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:16:44,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 38 [2025-03-04 15:16:44,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:16:44,289 INFO L124 PetriNetUnfolderBase]: 303/620 cut-off events. [2025-03-04 15:16:44,289 INFO L125 PetriNetUnfolderBase]: For 881/881 co-relation queries the response was YES. [2025-03-04 15:16:44,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2064 conditions, 620 events. 303/620 cut-off events. For 881/881 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3019 event pairs, 65 based on Foata normal form. 12/628 useless extension candidates. Maximal degree in co-relation 2039. Up to 363 conditions per place. [2025-03-04 15:16:44,292 INFO L140 encePairwiseOnDemand]: 29/38 looper letters, 28 selfloop transitions, 12 changer transitions 28/73 dead transitions. [2025-03-04 15:16:44,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 73 transitions, 509 flow [2025-03-04 15:16:44,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 15:16:44,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 15:16:44,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 134 transitions. [2025-03-04 15:16:44,293 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.29385964912280704 [2025-03-04 15:16:44,293 INFO L175 Difference]: Start difference. First operand has 84 places, 43 transitions, 292 flow. Second operand 12 states and 134 transitions. [2025-03-04 15:16:44,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 73 transitions, 509 flow [2025-03-04 15:16:44,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 73 transitions, 463 flow, removed 1 selfloop flow, removed 12 redundant places. [2025-03-04 15:16:44,295 INFO L231 Difference]: Finished difference. Result has 71 places, 34 transitions, 206 flow [2025-03-04 15:16:44,295 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=206, PETRI_PLACES=71, PETRI_TRANSITIONS=34} [2025-03-04 15:16:44,295 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 32 predicate places. [2025-03-04 15:16:44,295 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 34 transitions, 206 flow [2025-03-04 15:16:44,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 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-03-04 15:16:44,296 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:16:44,296 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:16:44,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 15:16:44,296 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-04 15:16:44,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:16:44,296 INFO L85 PathProgramCache]: Analyzing trace with hash -826637072, now seen corresponding path program 3 times [2025-03-04 15:16:44,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:16:44,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324837980] [2025-03-04 15:16:44,297 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:16:44,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:16:44,308 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 2 equivalence classes. [2025-03-04 15:16:44,312 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 15 of 16 statements. [2025-03-04 15:16:44,313 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 15:16:44,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:16:44,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:16:44,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:16:44,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324837980] [2025-03-04 15:16:44,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324837980] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:16:44,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:16:44,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 15:16:44,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912090366] [2025-03-04 15:16:44,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:16:44,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 15:16:44,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:16:44,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 15:16:44,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-04 15:16:44,588 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 38 [2025-03-04 15:16:44,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 34 transitions, 206 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 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-03-04 15:16:44,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:16:44,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 38 [2025-03-04 15:16:44,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:16:44,780 INFO L124 PetriNetUnfolderBase]: 192/405 cut-off events. [2025-03-04 15:16:44,780 INFO L125 PetriNetUnfolderBase]: For 576/576 co-relation queries the response was YES. [2025-03-04 15:16:44,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1365 conditions, 405 events. 192/405 cut-off events. For 576/576 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1794 event pairs, 32 based on Foata normal form. 24/429 useless extension candidates. Maximal degree in co-relation 1340. Up to 139 conditions per place. [2025-03-04 15:16:44,781 INFO L140 encePairwiseOnDemand]: 29/38 looper letters, 22 selfloop transitions, 9 changer transitions 24/57 dead transitions. [2025-03-04 15:16:44,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 57 transitions, 376 flow [2025-03-04 15:16:44,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 15:16:44,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 15:16:44,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 116 transitions. [2025-03-04 15:16:44,784 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.27751196172248804 [2025-03-04 15:16:44,784 INFO L175 Difference]: Start difference. First operand has 71 places, 34 transitions, 206 flow. Second operand 11 states and 116 transitions. [2025-03-04 15:16:44,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 57 transitions, 376 flow [2025-03-04 15:16:44,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 57 transitions, 320 flow, removed 6 selfloop flow, removed 12 redundant places. [2025-03-04 15:16:44,785 INFO L231 Difference]: Finished difference. Result has 60 places, 25 transitions, 122 flow [2025-03-04 15:16:44,785 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=122, PETRI_PLACES=60, PETRI_TRANSITIONS=25} [2025-03-04 15:16:44,785 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 21 predicate places. [2025-03-04 15:16:44,785 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 25 transitions, 122 flow [2025-03-04 15:16:44,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 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-03-04 15:16:44,786 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:16:44,786 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:16:44,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 15:16:44,786 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-04 15:16:44,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:16:44,786 INFO L85 PathProgramCache]: Analyzing trace with hash -913328882, now seen corresponding path program 4 times [2025-03-04 15:16:44,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:16:44,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227999390] [2025-03-04 15:16:44,786 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:16:44,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:16:44,797 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-03-04 15:16:44,801 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:16:44,801 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:16:44,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:16:45,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:16:45,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:16:45,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227999390] [2025-03-04 15:16:45,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227999390] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:16:45,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:16:45,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 15:16:45,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924662055] [2025-03-04 15:16:45,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:16:45,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 15:16:45,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:16:45,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 15:16:45,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-04 15:16:45,054 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 38 [2025-03-04 15:16:45,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 25 transitions, 122 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 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-03-04 15:16:45,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:16:45,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 38 [2025-03-04 15:16:45,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:16:45,222 INFO L124 PetriNetUnfolderBase]: 69/154 cut-off events. [2025-03-04 15:16:45,222 INFO L125 PetriNetUnfolderBase]: For 136/136 co-relation queries the response was YES. [2025-03-04 15:16:45,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 483 conditions, 154 events. 69/154 cut-off events. For 136/136 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 444 event pairs, 0 based on Foata normal form. 12/166 useless extension candidates. Maximal degree in co-relation 477. Up to 58 conditions per place. [2025-03-04 15:16:45,222 INFO L140 encePairwiseOnDemand]: 29/38 looper letters, 0 selfloop transitions, 0 changer transitions 42/42 dead transitions. [2025-03-04 15:16:45,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 42 transitions, 243 flow [2025-03-04 15:16:45,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 15:16:45,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 15:16:45,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 107 transitions. [2025-03-04 15:16:45,223 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.25598086124401914 [2025-03-04 15:16:45,223 INFO L175 Difference]: Start difference. First operand has 60 places, 25 transitions, 122 flow. Second operand 11 states and 107 transitions. [2025-03-04 15:16:45,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 42 transitions, 243 flow [2025-03-04 15:16:45,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 42 transitions, 199 flow, removed 1 selfloop flow, removed 15 redundant places. [2025-03-04 15:16:45,224 INFO L231 Difference]: Finished difference. Result has 44 places, 0 transitions, 0 flow [2025-03-04 15:16:45,224 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=0, PETRI_PLACES=44, PETRI_TRANSITIONS=0} [2025-03-04 15:16:45,224 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 5 predicate places. [2025-03-04 15:16:45,224 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 0 transitions, 0 flow [2025-03-04 15:16:45,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 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-03-04 15:16:45,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2025-03-04 15:16:45,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 8 remaining) [2025-03-04 15:16:45,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-03-04 15:16:45,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-03-04 15:16:45,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-03-04 15:16:45,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-03-04 15:16:45,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-03-04 15:16:45,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-03-04 15:16:45,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 15:16:45,227 INFO L422 BasicCegarLoop]: Path program histogram: [5, 4, 3, 3, 2, 2, 1, 1, 1] [2025-03-04 15:16:45,232 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 15:16:45,232 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 15:16:45,238 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 03:16:45 BasicIcfg [2025-03-04 15:16:45,239 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 15:16:45,239 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 15:16:45,239 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 15:16:45,239 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 15:16:45,240 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:16:29" (3/4) ... [2025-03-04 15:16:45,241 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 15:16:45,243 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure my_callback [2025-03-04 15:16:45,250 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 127 nodes and edges [2025-03-04 15:16:45,250 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 37 nodes and edges [2025-03-04 15:16:45,250 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-03-04 15:16:45,251 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 15:16:45,318 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 15:16:45,318 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 15:16:45,318 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 15:16:45,319 INFO L158 Benchmark]: Toolchain (without parser) took 17143.44ms. Allocated memory was 167.8MB in the beginning and 570.4MB in the end (delta: 402.7MB). Free memory was 120.2MB in the beginning and 201.7MB in the end (delta: -81.4MB). Peak memory consumption was 318.4MB. Max. memory is 16.1GB. [2025-03-04 15:16:45,320 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 119.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:16:45,320 INFO L158 Benchmark]: CACSL2BoogieTranslator took 458.42ms. Allocated memory is still 167.8MB. Free memory was 120.2MB in the beginning and 89.5MB in the end (delta: 30.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-04 15:16:45,320 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.68ms. Allocated memory is still 167.8MB. Free memory was 89.5MB in the beginning and 87.2MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:16:45,320 INFO L158 Benchmark]: Boogie Preprocessor took 32.74ms. Allocated memory is still 167.8MB. Free memory was 87.2MB in the beginning and 84.0MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:16:45,321 INFO L158 Benchmark]: IcfgBuilder took 604.65ms. Allocated memory is still 167.8MB. Free memory was 84.0MB in the beginning and 36.5MB in the end (delta: 47.5MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-04 15:16:45,321 INFO L158 Benchmark]: TraceAbstraction took 15915.31ms. Allocated memory was 167.8MB in the beginning and 570.4MB in the end (delta: 402.7MB). Free memory was 36.0MB in the beginning and 205.9MB in the end (delta: -169.8MB). Peak memory consumption was 242.9MB. Max. memory is 16.1GB. [2025-03-04 15:16:45,321 INFO L158 Benchmark]: Witness Printer took 79.34ms. Allocated memory is still 570.4MB. Free memory was 205.9MB in the beginning and 201.7MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:16:45,322 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 119.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 458.42ms. Allocated memory is still 167.8MB. Free memory was 120.2MB in the beginning and 89.5MB in the end (delta: 30.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.68ms. Allocated memory is still 167.8MB. Free memory was 89.5MB in the beginning and 87.2MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.74ms. Allocated memory is still 167.8MB. Free memory was 87.2MB in the beginning and 84.0MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 604.65ms. Allocated memory is still 167.8MB. Free memory was 84.0MB in the beginning and 36.5MB in the end (delta: 47.5MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 15915.31ms. Allocated memory was 167.8MB in the beginning and 570.4MB in the end (delta: 402.7MB). Free memory was 36.0MB in the beginning and 205.9MB in the end (delta: -169.8MB). Peak memory consumption was 242.9MB. Max. memory is 16.1GB. * Witness Printer took 79.34ms. Allocated memory is still 570.4MB. Free memory was 205.9MB in the beginning and 201.7MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3905]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 3905]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 4 procedures, 48 locations, 8 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 15.8s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 8.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1876 SdHoareTripleChecker+Valid, 4.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1777 mSDsluCounter, 1255 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1181 mSDsCounter, 261 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7005 IncrementalHoareTripleChecker+Invalid, 7266 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 261 mSolverCounterUnsat, 74 mSDtfsCounter, 7005 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 292 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 259 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=896occurred in iteration=14, InterpolantAutomatonStates: 246, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 316 NumberOfCodeBlocks, 315 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 294 ConstructedInterpolants, 0 QuantifiedInterpolants, 2967 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 15:16:45,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE