./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 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-races/race-3_1-container_of-global.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 75716fdd637a22328d600b3257cf24f40a7920b464397c315485c5ed90fb6ece --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:40:20,694 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:40:20,761 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 06:40:20,766 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:40:20,770 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:40:20,794 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:40:20,795 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:40:20,795 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:40:20,796 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:40:20,796 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:40:20,796 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:40:20,797 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:40:20,797 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:40:20,797 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:40:20,797 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:40:20,797 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:40:20,798 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:40:20,798 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:40:20,798 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:40:20,798 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:40:20,798 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:40:20,798 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:40:20,798 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:40:20,798 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:40:20,798 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:40:20,798 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:40:20,799 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:40:20,799 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:40:20,799 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:40:20,799 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:40:20,799 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:40:20,799 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:40:20,799 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:40:20,799 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:40:20,799 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:40:20,799 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:40:20,799 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:40:20,799 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:40:20,799 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:40:20,799 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:40:20,799 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:40:20,799 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:40:20,799 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:40:20,799 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:40:20,799 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:40:20,799 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:40:20,799 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:40:20,799 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:40:20,800 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:40:20,800 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:40:20,800 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 75716fdd637a22328d600b3257cf24f40a7920b464397c315485c5ed90fb6ece [2025-01-10 06:40:21,056 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:40:21,066 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:40:21,067 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:40:21,068 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:40:21,068 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:40:21,070 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-races/race-3_1-container_of-global.i [2025-01-10 06:40:22,329 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/74b6faa0a/c86d5c341a55444396c0bbed95b69468/FLAGabebef683 [2025-01-10 06:40:22,854 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:40:22,855 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-races/race-3_1-container_of-global.i [2025-01-10 06:40:22,892 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/74b6faa0a/c86d5c341a55444396c0bbed95b69468/FLAGabebef683 [2025-01-10 06:40:22,984 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/74b6faa0a/c86d5c341a55444396c0bbed95b69468 [2025-01-10 06:40:22,986 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:40:22,988 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:40:22,990 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:40:22,990 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:40:22,994 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:40:22,994 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:40:22" (1/1) ... [2025-01-10 06:40:22,995 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28828d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:40:22, skipping insertion in model container [2025-01-10 06:40:22,995 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:40:22" (1/1) ... [2025-01-10 06:40:23,043 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:40:23,304 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:40:23,314 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:40:23,379 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:40:23,412 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:40:23,414 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:40:23 WrapperNode [2025-01-10 06:40:23,414 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:40:23,415 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:40:23,415 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:40:23,415 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:40:23,423 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:40:23" (1/1) ... [2025-01-10 06:40:23,432 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:40:23" (1/1) ... [2025-01-10 06:40:23,446 INFO L138 Inliner]: procedures = 246, calls = 40, calls flagged for inlining = 13, calls inlined = 18, statements flattened = 145 [2025-01-10 06:40:23,446 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:40:23,447 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:40:23,447 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:40:23,447 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:40:23,452 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:40:23" (1/1) ... [2025-01-10 06:40:23,452 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:40:23" (1/1) ... [2025-01-10 06:40:23,455 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:40:23" (1/1) ... [2025-01-10 06:40:23,464 INFO L175 MemorySlicer]: Split 17 memory accesses to 3 slices as follows [2, 2, 13]. 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, 2, 6]. [2025-01-10 06:40:23,464 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:40:23" (1/1) ... [2025-01-10 06:40:23,464 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:40:23" (1/1) ... [2025-01-10 06:40:23,472 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:40:23" (1/1) ... [2025-01-10 06:40:23,473 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:40:23" (1/1) ... [2025-01-10 06:40:23,475 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:40:23" (1/1) ... [2025-01-10 06:40:23,476 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:40:23" (1/1) ... [2025-01-10 06:40:23,477 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:40:23" (1/1) ... [2025-01-10 06:40:23,480 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:40:23,481 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:40:23,481 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:40:23,481 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:40:23,482 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:40:23" (1/1) ... [2025-01-10 06:40:23,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:40:23,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:40:23,509 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 06:40:23,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 06:40:23,532 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2025-01-10 06:40:23,532 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2025-01-10 06:40:23,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 06:40:23,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 06:40:23,532 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-10 06:40:23,533 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 06:40:23,533 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 06:40:23,533 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 06:40:23,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 06:40:23,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 06:40:23,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 06:40:23,533 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-10 06:40:23,534 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:40:23,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-10 06:40:23,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-10 06:40:23,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-10 06:40:23,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:40:23,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 06:40:23,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 06:40:23,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:40:23,535 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:40:23,537 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 06:40:23,751 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:40:23,752 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:40:23,991 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 06:40:23,992 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:40:24,149 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:40:24,150 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 06:40:24,150 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:40:24 BoogieIcfgContainer [2025-01-10 06:40:24,150 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:40:24,152 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:40:24,152 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:40:24,155 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:40:24,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:40:22" (1/3) ... [2025-01-10 06:40:24,156 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b52d467 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:40:24, skipping insertion in model container [2025-01-10 06:40:24,157 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:40:23" (2/3) ... [2025-01-10 06:40:24,157 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b52d467 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:40:24, skipping insertion in model container [2025-01-10 06:40:24,157 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:40:24" (3/3) ... [2025-01-10 06:40:24,158 INFO L128 eAbstractionObserver]: Analyzing ICFG race-3_1-container_of-global.i [2025-01-10 06:40:24,200 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:40:24,203 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-01-10 06:40:24,203 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 06:40:24,239 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-10 06:40:24,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 38 transitions, 90 flow [2025-01-10 06:40:24,280 INFO L124 PetriNetUnfolderBase]: 2/41 cut-off events. [2025-01-10 06:40:24,282 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 06:40:24,284 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 5. Compared 79 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-01-10 06:40:24,284 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 38 transitions, 90 flow [2025-01-10 06:40:24,286 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 32 transitions, 73 flow [2025-01-10 06:40:24,292 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:40:24,300 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;@65e0c3da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:40:24,300 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-01-10 06:40:24,305 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:40:24,305 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2025-01-10 06:40:24,305 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:40:24,306 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:24,306 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:40:24,307 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 06:40:24,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:24,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1371065065, now seen corresponding path program 1 times [2025-01-10 06:40:24,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:24,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333198888] [2025-01-10 06:40:24,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:40:24,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:24,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:40:24,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:40:24,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:40:24,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:24,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:40:24,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:24,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333198888] [2025-01-10 06:40:24,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333198888] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:24,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:24,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:40:24,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244360732] [2025-01-10 06:40:24,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:24,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:40:24,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:24,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:40:24,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:40:24,984 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 38 [2025-01-10 06:40:24,987 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-01-10 06:40:24,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:24,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 38 [2025-01-10 06:40:24,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:25,384 INFO L124 PetriNetUnfolderBase]: 621/1208 cut-off events. [2025-01-10 06:40:25,386 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2025-01-10 06:40:25,390 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 84. Compared 6838 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-01-10 06:40:25,397 INFO L140 encePairwiseOnDemand]: 28/38 looper letters, 58 selfloop transitions, 18 changer transitions 3/84 dead transitions. [2025-01-10 06:40:25,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 84 transitions, 344 flow [2025-01-10 06:40:25,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 06:40:25,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 06:40:25,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 155 transitions. [2025-01-10 06:40:25,410 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45321637426900585 [2025-01-10 06:40:25,413 INFO L175 Difference]: Start difference. First operand has 39 places, 32 transitions, 73 flow. Second operand 9 states and 155 transitions. [2025-01-10 06:40:25,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 84 transitions, 344 flow [2025-01-10 06:40:25,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 84 transitions, 336 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:40:25,423 INFO L231 Difference]: Finished difference. Result has 48 places, 50 transitions, 182 flow [2025-01-10 06:40:25,429 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-01-10 06:40:25,431 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 9 predicate places. [2025-01-10 06:40:25,432 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 50 transitions, 182 flow [2025-01-10 06:40:25,432 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-01-10 06:40:25,432 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:25,432 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:40:25,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:40:25,435 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 06:40:25,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:25,436 INFO L85 PathProgramCache]: Analyzing trace with hash 625871757, now seen corresponding path program 1 times [2025-01-10 06:40:25,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:25,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413215776] [2025-01-10 06:40:25,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:40:25,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:25,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:40:25,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:40:25,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:40:25,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:25,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:40:25,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:25,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413215776] [2025-01-10 06:40:25,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413215776] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:25,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:25,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:40:25,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229404839] [2025-01-10 06:40:25,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:25,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:40:25,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:25,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:40:25,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:40:25,684 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 38 [2025-01-10 06:40:25,684 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-01-10 06:40:25,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:25,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 38 [2025-01-10 06:40:25,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:26,065 INFO L124 PetriNetUnfolderBase]: 672/1238 cut-off events. [2025-01-10 06:40:26,065 INFO L125 PetriNetUnfolderBase]: For 466/466 co-relation queries the response was YES. [2025-01-10 06:40:26,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2972 conditions, 1238 events. 672/1238 cut-off events. For 466/466 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 6664 event pairs, 319 based on Foata normal form. 44/1248 useless extension candidates. Maximal degree in co-relation 2499. Up to 951 conditions per place. [2025-01-10 06:40:26,072 INFO L140 encePairwiseOnDemand]: 28/38 looper letters, 60 selfloop transitions, 24 changer transitions 5/94 dead transitions. [2025-01-10 06:40:26,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 94 transitions, 496 flow [2025-01-10 06:40:26,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 06:40:26,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 06:40:26,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 153 transitions. [2025-01-10 06:40:26,074 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4473684210526316 [2025-01-10 06:40:26,074 INFO L175 Difference]: Start difference. First operand has 48 places, 50 transitions, 182 flow. Second operand 9 states and 153 transitions. [2025-01-10 06:40:26,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 94 transitions, 496 flow [2025-01-10 06:40:26,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 94 transitions, 494 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:40:26,077 INFO L231 Difference]: Finished difference. Result has 57 places, 62 transitions, 299 flow [2025-01-10 06:40:26,078 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-01-10 06:40:26,078 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 18 predicate places. [2025-01-10 06:40:26,078 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 62 transitions, 299 flow [2025-01-10 06:40:26,078 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-01-10 06:40:26,078 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:26,079 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:40:26,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 06:40:26,079 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 06:40:26,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:26,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1799878917, now seen corresponding path program 1 times [2025-01-10 06:40:26,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:26,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368329964] [2025-01-10 06:40:26,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:40:26,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:26,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:40:26,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:40:26,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:40:26,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:26,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:40:26,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:26,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368329964] [2025-01-10 06:40:26,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368329964] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:26,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:26,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 06:40:26,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731291638] [2025-01-10 06:40:26,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:26,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 06:40:26,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:26,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 06:40:26,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:40:26,647 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 38 [2025-01-10 06:40:26,648 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-01-10 06:40:26,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:26,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 38 [2025-01-10 06:40:26,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:27,081 INFO L124 PetriNetUnfolderBase]: 728/1329 cut-off events. [2025-01-10 06:40:27,082 INFO L125 PetriNetUnfolderBase]: For 1096/1096 co-relation queries the response was YES. [2025-01-10 06:40:27,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3679 conditions, 1329 events. 728/1329 cut-off events. For 1096/1096 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 7237 event pairs, 234 based on Foata normal form. 52/1381 useless extension candidates. Maximal degree in co-relation 3575. Up to 1039 conditions per place. [2025-01-10 06:40:27,088 INFO L140 encePairwiseOnDemand]: 26/38 looper letters, 60 selfloop transitions, 26 changer transitions 18/109 dead transitions. [2025-01-10 06:40:27,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 109 transitions, 657 flow [2025-01-10 06:40:27,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 06:40:27,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 06:40:27,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 183 transitions. [2025-01-10 06:40:27,091 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43779904306220097 [2025-01-10 06:40:27,091 INFO L175 Difference]: Start difference. First operand has 57 places, 62 transitions, 299 flow. Second operand 11 states and 183 transitions. [2025-01-10 06:40:27,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 109 transitions, 657 flow [2025-01-10 06:40:27,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 109 transitions, 655 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:40:27,096 INFO L231 Difference]: Finished difference. Result has 69 places, 65 transitions, 390 flow [2025-01-10 06:40:27,096 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=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=390, PETRI_PLACES=69, PETRI_TRANSITIONS=65} [2025-01-10 06:40:27,097 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 30 predicate places. [2025-01-10 06:40:27,097 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 65 transitions, 390 flow [2025-01-10 06:40:27,097 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-01-10 06:40:27,097 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:27,097 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:40:27,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:40:27,098 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 06:40:27,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:27,098 INFO L85 PathProgramCache]: Analyzing trace with hash 899651241, now seen corresponding path program 2 times [2025-01-10 06:40:27,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:27,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125935517] [2025-01-10 06:40:27,098 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:40:27,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:27,124 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:40:27,131 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:40:27,132 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:40:27,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:27,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:40:27,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:27,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125935517] [2025-01-10 06:40:27,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125935517] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:27,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:27,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 06:40:27,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299037694] [2025-01-10 06:40:27,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:27,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 06:40:27,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:27,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 06:40:27,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:40:27,602 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 38 [2025-01-10 06:40:27,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 65 transitions, 390 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-01-10 06:40:27,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:27,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 38 [2025-01-10 06:40:27,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:28,319 INFO L124 PetriNetUnfolderBase]: 796/1474 cut-off events. [2025-01-10 06:40:28,319 INFO L125 PetriNetUnfolderBase]: For 2714/2714 co-relation queries the response was YES. [2025-01-10 06:40:28,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4598 conditions, 1474 events. 796/1474 cut-off events. For 2714/2714 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 8270 event pairs, 309 based on Foata normal form. 52/1526 useless extension candidates. Maximal degree in co-relation 3666. Up to 1023 conditions per place. [2025-01-10 06:40:28,338 INFO L140 encePairwiseOnDemand]: 26/38 looper letters, 75 selfloop transitions, 39 changer transitions 12/131 dead transitions. [2025-01-10 06:40:28,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 131 transitions, 932 flow [2025-01-10 06:40:28,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 06:40:28,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-10 06:40:28,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 212 transitions. [2025-01-10 06:40:28,340 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4291497975708502 [2025-01-10 06:40:28,340 INFO L175 Difference]: Start difference. First operand has 69 places, 65 transitions, 390 flow. Second operand 13 states and 212 transitions. [2025-01-10 06:40:28,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 131 transitions, 932 flow [2025-01-10 06:40:28,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 131 transitions, 848 flow, removed 6 selfloop flow, removed 8 redundant places. [2025-01-10 06:40:28,362 INFO L231 Difference]: Finished difference. Result has 77 places, 81 transitions, 588 flow [2025-01-10 06:40:28,362 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=588, PETRI_PLACES=77, PETRI_TRANSITIONS=81} [2025-01-10 06:40:28,362 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 38 predicate places. [2025-01-10 06:40:28,362 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 81 transitions, 588 flow [2025-01-10 06:40:28,363 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-01-10 06:40:28,363 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:28,363 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:40:28,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 06:40:28,363 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 06:40:28,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:28,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1789759587, now seen corresponding path program 3 times [2025-01-10 06:40:28,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:28,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331832] [2025-01-10 06:40:28,363 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 06:40:28,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:28,394 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:40:28,410 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:40:28,410 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 06:40:28,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:28,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:40:28,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:28,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331832] [2025-01-10 06:40:28,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331832] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:28,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:28,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 06:40:28,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730161486] [2025-01-10 06:40:28,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:28,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 06:40:28,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:28,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 06:40:28,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:40:28,892 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 38 [2025-01-10 06:40:28,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 81 transitions, 588 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-01-10 06:40:28,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:28,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 38 [2025-01-10 06:40:28,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:29,361 INFO L124 PetriNetUnfolderBase]: 780/1420 cut-off events. [2025-01-10 06:40:29,365 INFO L125 PetriNetUnfolderBase]: For 3745/3745 co-relation queries the response was YES. [2025-01-10 06:40:29,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4907 conditions, 1420 events. 780/1420 cut-off events. For 3745/3745 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 7687 event pairs, 224 based on Foata normal form. 52/1472 useless extension candidates. Maximal degree in co-relation 4785. Up to 1011 conditions per place. [2025-01-10 06:40:29,372 INFO L140 encePairwiseOnDemand]: 26/38 looper letters, 78 selfloop transitions, 42 changer transitions 17/142 dead transitions. [2025-01-10 06:40:29,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 142 transitions, 1122 flow [2025-01-10 06:40:29,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 06:40:29,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 06:40:29,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 205 transitions. [2025-01-10 06:40:29,374 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44956140350877194 [2025-01-10 06:40:29,374 INFO L175 Difference]: Start difference. First operand has 77 places, 81 transitions, 588 flow. Second operand 12 states and 205 transitions. [2025-01-10 06:40:29,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 142 transitions, 1122 flow [2025-01-10 06:40:29,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 142 transitions, 1037 flow, removed 14 selfloop flow, removed 7 redundant places. [2025-01-10 06:40:29,383 INFO L231 Difference]: Finished difference. Result has 85 places, 88 transitions, 717 flow [2025-01-10 06:40:29,384 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=717, PETRI_PLACES=85, PETRI_TRANSITIONS=88} [2025-01-10 06:40:29,385 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 46 predicate places. [2025-01-10 06:40:29,385 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 88 transitions, 717 flow [2025-01-10 06:40:29,386 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-01-10 06:40:29,386 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:29,386 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:40:29,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:40:29,386 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 06:40:29,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:29,386 INFO L85 PathProgramCache]: Analyzing trace with hash 546323968, now seen corresponding path program 1 times [2025-01-10 06:40:29,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:29,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667543302] [2025-01-10 06:40:29,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:40:29,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:29,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:40:29,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:40:29,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:40:29,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:29,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:40:29,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:29,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667543302] [2025-01-10 06:40:29,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667543302] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:29,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:29,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 06:40:29,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823042596] [2025-01-10 06:40:29,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:29,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 06:40:29,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:29,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 06:40:29,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:40:29,693 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 38 [2025-01-10 06:40:29,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 88 transitions, 717 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-01-10 06:40:29,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:29,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 38 [2025-01-10 06:40:29,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:30,131 INFO L124 PetriNetUnfolderBase]: 759/1422 cut-off events. [2025-01-10 06:40:30,132 INFO L125 PetriNetUnfolderBase]: For 4142/4169 co-relation queries the response was YES. [2025-01-10 06:40:30,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5138 conditions, 1422 events. 759/1422 cut-off events. For 4142/4169 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 8006 event pairs, 247 based on Foata normal form. 48/1470 useless extension candidates. Maximal degree in co-relation 5005. Up to 1000 conditions per place. [2025-01-10 06:40:30,141 INFO L140 encePairwiseOnDemand]: 26/38 looper letters, 75 selfloop transitions, 42 changer transitions 12/134 dead transitions. [2025-01-10 06:40:30,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 134 transitions, 1125 flow [2025-01-10 06:40:30,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 06:40:30,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-10 06:40:30,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 212 transitions. [2025-01-10 06:40:30,144 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4291497975708502 [2025-01-10 06:40:30,144 INFO L175 Difference]: Start difference. First operand has 85 places, 88 transitions, 717 flow. Second operand 13 states and 212 transitions. [2025-01-10 06:40:30,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 134 transitions, 1125 flow [2025-01-10 06:40:30,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 134 transitions, 1076 flow, removed 10 selfloop flow, removed 5 redundant places. [2025-01-10 06:40:30,158 INFO L231 Difference]: Finished difference. Result has 94 places, 85 transitions, 750 flow [2025-01-10 06:40:30,158 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=671, PETRI_DIFFERENCE_MINUEND_PLACES=80, 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=750, PETRI_PLACES=94, PETRI_TRANSITIONS=85} [2025-01-10 06:40:30,159 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 55 predicate places. [2025-01-10 06:40:30,159 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 85 transitions, 750 flow [2025-01-10 06:40:30,159 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-01-10 06:40:30,159 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:30,159 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:40:30,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:40:30,159 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 06:40:30,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:30,160 INFO L85 PathProgramCache]: Analyzing trace with hash 899642880, now seen corresponding path program 2 times [2025-01-10 06:40:30,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:30,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299884407] [2025-01-10 06:40:30,160 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:40:30,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:30,201 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:40:30,208 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:40:30,208 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:40:30,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:30,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:40:30,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:30,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299884407] [2025-01-10 06:40:30,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299884407] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:30,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:30,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 06:40:30,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892982578] [2025-01-10 06:40:30,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:30,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 06:40:30,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:30,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 06:40:30,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:40:30,467 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 38 [2025-01-10 06:40:30,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 85 transitions, 750 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-01-10 06:40:30,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:30,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 38 [2025-01-10 06:40:30,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:31,160 INFO L124 PetriNetUnfolderBase]: 768/1446 cut-off events. [2025-01-10 06:40:31,160 INFO L125 PetriNetUnfolderBase]: For 5195/5226 co-relation queries the response was YES. [2025-01-10 06:40:31,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5498 conditions, 1446 events. 768/1446 cut-off events. For 5195/5226 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 8142 event pairs, 301 based on Foata normal form. 48/1494 useless extension candidates. Maximal degree in co-relation 4337. Up to 1019 conditions per place. [2025-01-10 06:40:31,181 INFO L140 encePairwiseOnDemand]: 26/38 looper letters, 73 selfloop transitions, 40 changer transitions 13/131 dead transitions. [2025-01-10 06:40:31,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 131 transitions, 1178 flow [2025-01-10 06:40:31,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 06:40:31,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 06:40:31,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 198 transitions. [2025-01-10 06:40:31,187 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4342105263157895 [2025-01-10 06:40:31,187 INFO L175 Difference]: Start difference. First operand has 94 places, 85 transitions, 750 flow. Second operand 12 states and 198 transitions. [2025-01-10 06:40:31,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 131 transitions, 1178 flow [2025-01-10 06:40:31,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 131 transitions, 1044 flow, removed 5 selfloop flow, removed 15 redundant places. [2025-01-10 06:40:31,216 INFO L231 Difference]: Finished difference. Result has 92 places, 85 transitions, 720 flow [2025-01-10 06:40:31,216 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=619, 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=720, PETRI_PLACES=92, PETRI_TRANSITIONS=85} [2025-01-10 06:40:31,217 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 53 predicate places. [2025-01-10 06:40:31,217 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 85 transitions, 720 flow [2025-01-10 06:40:31,217 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-01-10 06:40:31,217 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:31,217 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:40:31,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 06:40:31,217 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 06:40:31,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:31,217 INFO L85 PathProgramCache]: Analyzing trace with hash -578233808, now seen corresponding path program 1 times [2025-01-10 06:40:31,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:31,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585957644] [2025-01-10 06:40:31,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:40:31,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:31,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:40:31,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:40:31,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:40:31,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:31,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:40:31,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:31,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585957644] [2025-01-10 06:40:31,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585957644] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:31,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:31,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:40:31,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71513648] [2025-01-10 06:40:31,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:31,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:40:31,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:31,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:40:31,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:40:31,298 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2025-01-10 06:40:31,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 85 transitions, 720 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-01-10 06:40:31,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:31,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2025-01-10 06:40:31,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:31,497 INFO L124 PetriNetUnfolderBase]: 365/703 cut-off events. [2025-01-10 06:40:31,498 INFO L125 PetriNetUnfolderBase]: For 1975/2060 co-relation queries the response was YES. [2025-01-10 06:40:31,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2506 conditions, 703 events. 365/703 cut-off events. For 1975/2060 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 3358 event pairs, 61 based on Foata normal form. 0/703 useless extension candidates. Maximal degree in co-relation 2446. Up to 346 conditions per place. [2025-01-10 06:40:31,511 INFO L140 encePairwiseOnDemand]: 35/38 looper letters, 99 selfloop transitions, 7 changer transitions 6/118 dead transitions. [2025-01-10 06:40:31,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 118 transitions, 1160 flow [2025-01-10 06:40:31,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:40:31,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:40:31,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2025-01-10 06:40:31,513 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5526315789473685 [2025-01-10 06:40:31,513 INFO L175 Difference]: Start difference. First operand has 92 places, 85 transitions, 720 flow. Second operand 4 states and 84 transitions. [2025-01-10 06:40:31,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 118 transitions, 1160 flow [2025-01-10 06:40:31,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 118 transitions, 977 flow, removed 25 selfloop flow, removed 15 redundant places. [2025-01-10 06:40:31,526 INFO L231 Difference]: Finished difference. Result has 72 places, 62 transitions, 418 flow [2025-01-10 06:40:31,531 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=416, 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=418, PETRI_PLACES=72, PETRI_TRANSITIONS=62} [2025-01-10 06:40:31,531 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 33 predicate places. [2025-01-10 06:40:31,531 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 62 transitions, 418 flow [2025-01-10 06:40:31,531 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-01-10 06:40:31,531 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:31,531 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:40:31,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 06:40:31,532 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 06:40:31,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:31,532 INFO L85 PathProgramCache]: Analyzing trace with hash -665345599, now seen corresponding path program 1 times [2025-01-10 06:40:31,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:31,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326462815] [2025-01-10 06:40:31,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:40:31,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:31,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 06:40:31,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 06:40:31,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:40:31,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:31,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:40:31,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:31,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326462815] [2025-01-10 06:40:31,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326462815] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:31,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:31,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 06:40:31,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502015124] [2025-01-10 06:40:31,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:31,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 06:40:31,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:31,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 06:40:31,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:40:31,940 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 38 [2025-01-10 06:40:31,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 62 transitions, 418 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-01-10 06:40:31,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:31,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 38 [2025-01-10 06:40:31,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:32,314 INFO L124 PetriNetUnfolderBase]: 486/911 cut-off events. [2025-01-10 06:40:32,315 INFO L125 PetriNetUnfolderBase]: For 1556/1556 co-relation queries the response was YES. [2025-01-10 06:40:32,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2924 conditions, 911 events. 486/911 cut-off events. For 1556/1556 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4463 event pairs, 84 based on Foata normal form. 14/925 useless extension candidates. Maximal degree in co-relation 2795. Up to 226 conditions per place. [2025-01-10 06:40:32,319 INFO L140 encePairwiseOnDemand]: 30/38 looper letters, 95 selfloop transitions, 21 changer transitions 0/117 dead transitions. [2025-01-10 06:40:32,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 117 transitions, 839 flow [2025-01-10 06:40:32,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 06:40:32,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 06:40:32,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 135 transitions. [2025-01-10 06:40:32,323 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39473684210526316 [2025-01-10 06:40:32,323 INFO L175 Difference]: Start difference. First operand has 72 places, 62 transitions, 418 flow. Second operand 9 states and 135 transitions. [2025-01-10 06:40:32,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 117 transitions, 839 flow [2025-01-10 06:40:32,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 117 transitions, 793 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-01-10 06:40:32,329 INFO L231 Difference]: Finished difference. Result has 80 places, 64 transitions, 462 flow [2025-01-10 06:40:32,330 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=397, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=462, PETRI_PLACES=80, PETRI_TRANSITIONS=64} [2025-01-10 06:40:32,330 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 41 predicate places. [2025-01-10 06:40:32,330 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 64 transitions, 462 flow [2025-01-10 06:40:32,331 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-01-10 06:40:32,331 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:32,331 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:40:32,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 06:40:32,331 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 06:40:32,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:32,332 INFO L85 PathProgramCache]: Analyzing trace with hash -2120512723, now seen corresponding path program 2 times [2025-01-10 06:40:32,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:32,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956177765] [2025-01-10 06:40:32,332 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:40:32,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:32,345 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 1 equivalence classes. [2025-01-10 06:40:32,352 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 06:40:32,353 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:40:32,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:32,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:40:32,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:32,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956177765] [2025-01-10 06:40:32,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956177765] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:32,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:32,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 06:40:32,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443607775] [2025-01-10 06:40:32,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:32,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 06:40:32,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:32,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 06:40:32,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:40:32,642 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 38 [2025-01-10 06:40:32,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 64 transitions, 462 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-01-10 06:40:32,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:32,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 38 [2025-01-10 06:40:32,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:33,089 INFO L124 PetriNetUnfolderBase]: 639/1224 cut-off events. [2025-01-10 06:40:33,090 INFO L125 PetriNetUnfolderBase]: For 1853/1853 co-relation queries the response was YES. [2025-01-10 06:40:33,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3882 conditions, 1224 events. 639/1224 cut-off events. For 1853/1853 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6587 event pairs, 152 based on Foata normal form. 14/1238 useless extension candidates. Maximal degree in co-relation 3743. Up to 379 conditions per place. [2025-01-10 06:40:33,097 INFO L140 encePairwiseOnDemand]: 30/38 looper letters, 106 selfloop transitions, 21 changer transitions 0/128 dead transitions. [2025-01-10 06:40:33,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 128 transitions, 923 flow [2025-01-10 06:40:33,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 06:40:33,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 06:40:33,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 149 transitions. [2025-01-10 06:40:33,099 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39210526315789473 [2025-01-10 06:40:33,099 INFO L175 Difference]: Start difference. First operand has 80 places, 64 transitions, 462 flow. Second operand 10 states and 149 transitions. [2025-01-10 06:40:33,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 128 transitions, 923 flow [2025-01-10 06:40:33,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 128 transitions, 861 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-01-10 06:40:33,108 INFO L231 Difference]: Finished difference. Result has 87 places, 69 transitions, 494 flow [2025-01-10 06:40:33,108 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=494, PETRI_PLACES=87, PETRI_TRANSITIONS=69} [2025-01-10 06:40:33,109 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 48 predicate places. [2025-01-10 06:40:33,109 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 69 transitions, 494 flow [2025-01-10 06:40:33,110 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-01-10 06:40:33,110 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:33,110 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:40:33,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 06:40:33,110 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 06:40:33,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:33,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1749614773, now seen corresponding path program 3 times [2025-01-10 06:40:33,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:33,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486801703] [2025-01-10 06:40:33,111 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 06:40:33,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:33,123 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 1 equivalence classes. [2025-01-10 06:40:33,132 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 06:40:33,132 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 06:40:33,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:33,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:40:33,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:33,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486801703] [2025-01-10 06:40:33,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486801703] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:33,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:33,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 06:40:33,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703832884] [2025-01-10 06:40:33,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:33,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 06:40:33,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:33,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 06:40:33,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:40:33,459 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 38 [2025-01-10 06:40:33,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 69 transitions, 494 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-01-10 06:40:33,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:33,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 38 [2025-01-10 06:40:33,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:34,036 INFO L124 PetriNetUnfolderBase]: 733/1316 cut-off events. [2025-01-10 06:40:34,036 INFO L125 PetriNetUnfolderBase]: For 1950/1950 co-relation queries the response was YES. [2025-01-10 06:40:34,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4262 conditions, 1316 events. 733/1316 cut-off events. For 1950/1950 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 6613 event pairs, 204 based on Foata normal form. 14/1330 useless extension candidates. Maximal degree in co-relation 4125. Up to 480 conditions per place. [2025-01-10 06:40:34,047 INFO L140 encePairwiseOnDemand]: 29/38 looper letters, 102 selfloop transitions, 30 changer transitions 0/132 dead transitions. [2025-01-10 06:40:34,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 132 transitions, 956 flow [2025-01-10 06:40:34,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 06:40:34,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 06:40:34,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 144 transitions. [2025-01-10 06:40:34,049 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3444976076555024 [2025-01-10 06:40:34,050 INFO L175 Difference]: Start difference. First operand has 87 places, 69 transitions, 494 flow. Second operand 11 states and 144 transitions. [2025-01-10 06:40:34,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 132 transitions, 956 flow [2025-01-10 06:40:34,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 132 transitions, 925 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-01-10 06:40:34,059 INFO L231 Difference]: Finished difference. Result has 98 places, 75 transitions, 571 flow [2025-01-10 06:40:34,060 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=465, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=571, PETRI_PLACES=98, PETRI_TRANSITIONS=75} [2025-01-10 06:40:34,060 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 59 predicate places. [2025-01-10 06:40:34,060 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 75 transitions, 571 flow [2025-01-10 06:40:34,060 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-01-10 06:40:34,060 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:34,060 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:40:34,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 06:40:34,061 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 06:40:34,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:34,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1039713035, now seen corresponding path program 4 times [2025-01-10 06:40:34,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:34,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470890657] [2025-01-10 06:40:34,061 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 06:40:34,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:34,077 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 15 statements into 2 equivalence classes. [2025-01-10 06:40:34,089 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 06:40:34,092 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 06:40:34,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:34,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:40:34,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:34,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470890657] [2025-01-10 06:40:34,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470890657] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:34,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:34,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 06:40:34,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772787524] [2025-01-10 06:40:34,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:34,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 06:40:34,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:34,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 06:40:34,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:40:34,349 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 38 [2025-01-10 06:40:34,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 75 transitions, 571 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-01-10 06:40:34,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:34,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 38 [2025-01-10 06:40:34,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:34,769 INFO L124 PetriNetUnfolderBase]: 782/1505 cut-off events. [2025-01-10 06:40:34,769 INFO L125 PetriNetUnfolderBase]: For 2766/2766 co-relation queries the response was YES. [2025-01-10 06:40:34,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5060 conditions, 1505 events. 782/1505 cut-off events. For 2766/2766 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 8604 event pairs, 194 based on Foata normal form. 14/1519 useless extension candidates. Maximal degree in co-relation 4912. Up to 513 conditions per place. [2025-01-10 06:40:34,780 INFO L140 encePairwiseOnDemand]: 30/38 looper letters, 114 selfloop transitions, 26 changer transitions 0/144 dead transitions. [2025-01-10 06:40:34,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 144 transitions, 1068 flow [2025-01-10 06:40:34,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 06:40:34,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 06:40:34,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 158 transitions. [2025-01-10 06:40:34,782 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41578947368421054 [2025-01-10 06:40:34,782 INFO L175 Difference]: Start difference. First operand has 98 places, 75 transitions, 571 flow. Second operand 10 states and 158 transitions. [2025-01-10 06:40:34,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 144 transitions, 1068 flow [2025-01-10 06:40:34,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 144 transitions, 1049 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-01-10 06:40:34,791 INFO L231 Difference]: Finished difference. Result has 108 places, 78 transitions, 665 flow [2025-01-10 06:40:34,792 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=552, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=665, PETRI_PLACES=108, PETRI_TRANSITIONS=78} [2025-01-10 06:40:34,793 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 69 predicate places. [2025-01-10 06:40:34,793 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 78 transitions, 665 flow [2025-01-10 06:40:34,794 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-01-10 06:40:34,794 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:34,794 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:40:34,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 06:40:34,794 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 06:40:34,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:34,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1031124866, now seen corresponding path program 1 times [2025-01-10 06:40:34,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:34,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651781824] [2025-01-10 06:40:34,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:40:34,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:34,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 06:40:34,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 06:40:34,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:40:34,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:35,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:40:35,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:35,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651781824] [2025-01-10 06:40:35,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651781824] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:35,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:35,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 06:40:35,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417347237] [2025-01-10 06:40:35,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:35,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 06:40:35,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:35,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 06:40:35,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:40:35,050 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 38 [2025-01-10 06:40:35,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 78 transitions, 665 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-01-10 06:40:35,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:35,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 38 [2025-01-10 06:40:35,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:35,421 INFO L124 PetriNetUnfolderBase]: 818/1513 cut-off events. [2025-01-10 06:40:35,421 INFO L125 PetriNetUnfolderBase]: For 3554/3558 co-relation queries the response was YES. [2025-01-10 06:40:35,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5411 conditions, 1513 events. 818/1513 cut-off events. For 3554/3558 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 8284 event pairs, 218 based on Foata normal form. 12/1521 useless extension candidates. Maximal degree in co-relation 5264. Up to 518 conditions per place. [2025-01-10 06:40:35,430 INFO L140 encePairwiseOnDemand]: 30/38 looper letters, 104 selfloop transitions, 25 changer transitions 0/132 dead transitions. [2025-01-10 06:40:35,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 132 transitions, 1084 flow [2025-01-10 06:40:35,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 06:40:35,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 06:40:35,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 138 transitions. [2025-01-10 06:40:35,434 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40350877192982454 [2025-01-10 06:40:35,434 INFO L175 Difference]: Start difference. First operand has 108 places, 78 transitions, 665 flow. Second operand 9 states and 138 transitions. [2025-01-10 06:40:35,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 132 transitions, 1084 flow [2025-01-10 06:40:35,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 132 transitions, 1057 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-01-10 06:40:35,445 INFO L231 Difference]: Finished difference. Result has 118 places, 82 transitions, 745 flow [2025-01-10 06:40:35,446 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=638, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=745, PETRI_PLACES=118, PETRI_TRANSITIONS=82} [2025-01-10 06:40:35,447 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 79 predicate places. [2025-01-10 06:40:35,447 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 82 transitions, 745 flow [2025-01-10 06:40:35,447 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-01-10 06:40:35,447 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:35,447 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:40:35,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 06:40:35,447 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 06:40:35,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:35,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1276771083, now seen corresponding path program 5 times [2025-01-10 06:40:35,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:35,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829927587] [2025-01-10 06:40:35,448 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 06:40:35,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:35,461 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 15 statements into 1 equivalence classes. [2025-01-10 06:40:35,470 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 06:40:35,470 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:40:35,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:35,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:40:35,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:35,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829927587] [2025-01-10 06:40:35,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829927587] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:35,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:35,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 06:40:35,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243891253] [2025-01-10 06:40:35,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:35,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 06:40:35,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:35,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 06:40:35,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:40:35,752 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 38 [2025-01-10 06:40:35,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 82 transitions, 745 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-01-10 06:40:35,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:35,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 38 [2025-01-10 06:40:35,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:36,521 INFO L124 PetriNetUnfolderBase]: 941/1700 cut-off events. [2025-01-10 06:40:36,522 INFO L125 PetriNetUnfolderBase]: For 4369/4369 co-relation queries the response was YES. [2025-01-10 06:40:36,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6338 conditions, 1700 events. 941/1700 cut-off events. For 4369/4369 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 9248 event pairs, 204 based on Foata normal form. 26/1726 useless extension candidates. Maximal degree in co-relation 5941. Up to 697 conditions per place. [2025-01-10 06:40:36,529 INFO L140 encePairwiseOnDemand]: 28/38 looper letters, 122 selfloop transitions, 31 changer transitions 0/153 dead transitions. [2025-01-10 06:40:36,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 153 transitions, 1269 flow [2025-01-10 06:40:36,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 06:40:36,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 06:40:36,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 165 transitions. [2025-01-10 06:40:36,533 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3618421052631579 [2025-01-10 06:40:36,533 INFO L175 Difference]: Start difference. First operand has 118 places, 82 transitions, 745 flow. Second operand 12 states and 165 transitions. [2025-01-10 06:40:36,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 153 transitions, 1269 flow [2025-01-10 06:40:36,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 153 transitions, 1238 flow, removed 4 selfloop flow, removed 6 redundant places. [2025-01-10 06:40:36,545 INFO L231 Difference]: Finished difference. Result has 124 places, 84 transitions, 802 flow [2025-01-10 06:40:36,545 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=702, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=802, PETRI_PLACES=124, PETRI_TRANSITIONS=84} [2025-01-10 06:40:36,546 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 85 predicate places. [2025-01-10 06:40:36,547 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 84 transitions, 802 flow [2025-01-10 06:40:36,547 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-01-10 06:40:36,547 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:36,547 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:40:36,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 06:40:36,547 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 06:40:36,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:36,548 INFO L85 PathProgramCache]: Analyzing trace with hash -670616540, now seen corresponding path program 2 times [2025-01-10 06:40:36,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:36,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821063967] [2025-01-10 06:40:36,548 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:40:36,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:36,568 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 1 equivalence classes. [2025-01-10 06:40:36,573 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 06:40:36,574 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:40:36,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:36,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:40:36,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:36,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821063967] [2025-01-10 06:40:36,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821063967] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:36,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:36,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 06:40:36,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911432119] [2025-01-10 06:40:36,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:36,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 06:40:36,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:36,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 06:40:36,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:40:36,866 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 38 [2025-01-10 06:40:36,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 84 transitions, 802 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-01-10 06:40:36,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:36,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 38 [2025-01-10 06:40:36,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:37,451 INFO L124 PetriNetUnfolderBase]: 1024/1851 cut-off events. [2025-01-10 06:40:37,451 INFO L125 PetriNetUnfolderBase]: For 4631/4631 co-relation queries the response was YES. [2025-01-10 06:40:37,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7113 conditions, 1851 events. 1024/1851 cut-off events. For 4631/4631 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 10292 event pairs, 174 based on Foata normal form. 12/1863 useless extension candidates. Maximal degree in co-relation 6659. Up to 768 conditions per place. [2025-01-10 06:40:37,461 INFO L140 encePairwiseOnDemand]: 29/38 looper letters, 112 selfloop transitions, 36 changer transitions 0/148 dead transitions. [2025-01-10 06:40:37,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 148 transitions, 1346 flow [2025-01-10 06:40:37,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 06:40:37,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 06:40:37,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 150 transitions. [2025-01-10 06:40:37,463 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32894736842105265 [2025-01-10 06:40:37,463 INFO L175 Difference]: Start difference. First operand has 124 places, 84 transitions, 802 flow. Second operand 12 states and 150 transitions. [2025-01-10 06:40:37,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 148 transitions, 1346 flow [2025-01-10 06:40:37,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 148 transitions, 1268 flow, removed 18 selfloop flow, removed 10 redundant places. [2025-01-10 06:40:37,479 INFO L231 Difference]: Finished difference. Result has 128 places, 90 transitions, 877 flow [2025-01-10 06:40:37,479 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=736, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=877, PETRI_PLACES=128, PETRI_TRANSITIONS=90} [2025-01-10 06:40:37,479 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 89 predicate places. [2025-01-10 06:40:37,479 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 90 transitions, 877 flow [2025-01-10 06:40:37,479 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-01-10 06:40:37,480 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:37,480 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:40:37,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 06:40:37,480 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 06:40:37,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:37,480 INFO L85 PathProgramCache]: Analyzing trace with hash -814507070, now seen corresponding path program 3 times [2025-01-10 06:40:37,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:37,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36678257] [2025-01-10 06:40:37,480 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 06:40:37,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:37,493 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 1 equivalence classes. [2025-01-10 06:40:37,498 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 06:40:37,499 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 06:40:37,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:37,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:40:37,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:37,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36678257] [2025-01-10 06:40:37,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36678257] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:37,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:37,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 06:40:37,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960004079] [2025-01-10 06:40:37,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:37,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 06:40:37,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:37,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 06:40:37,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:40:37,734 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 38 [2025-01-10 06:40:37,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 90 transitions, 877 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-01-10 06:40:37,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:37,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 38 [2025-01-10 06:40:37,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:38,202 INFO L124 PetriNetUnfolderBase]: 1097/1984 cut-off events. [2025-01-10 06:40:38,203 INFO L125 PetriNetUnfolderBase]: For 4820/4820 co-relation queries the response was YES. [2025-01-10 06:40:38,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7532 conditions, 1984 events. 1097/1984 cut-off events. For 4820/4820 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 11236 event pairs, 192 based on Foata normal form. 12/1996 useless extension candidates. Maximal degree in co-relation 7068. Up to 608 conditions per place. [2025-01-10 06:40:38,213 INFO L140 encePairwiseOnDemand]: 29/38 looper letters, 101 selfloop transitions, 45 changer transitions 0/146 dead transitions. [2025-01-10 06:40:38,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 146 transitions, 1356 flow [2025-01-10 06:40:38,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 06:40:38,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 06:40:38,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 139 transitions. [2025-01-10 06:40:38,215 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.33253588516746413 [2025-01-10 06:40:38,215 INFO L175 Difference]: Start difference. First operand has 128 places, 90 transitions, 877 flow. Second operand 11 states and 139 transitions. [2025-01-10 06:40:38,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 146 transitions, 1356 flow [2025-01-10 06:40:38,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 146 transitions, 1309 flow, removed 8 selfloop flow, removed 3 redundant places. [2025-01-10 06:40:38,231 INFO L231 Difference]: Finished difference. Result has 138 places, 92 transitions, 979 flow [2025-01-10 06:40:38,232 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=832, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=979, PETRI_PLACES=138, PETRI_TRANSITIONS=92} [2025-01-10 06:40:38,232 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 99 predicate places. [2025-01-10 06:40:38,232 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 92 transitions, 979 flow [2025-01-10 06:40:38,233 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-01-10 06:40:38,233 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:38,233 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:40:38,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 06:40:38,234 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 06:40:38,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:38,234 INFO L85 PathProgramCache]: Analyzing trace with hash -817303580, now seen corresponding path program 4 times [2025-01-10 06:40:38,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:38,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053692998] [2025-01-10 06:40:38,234 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 06:40:38,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:38,245 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 15 statements into 2 equivalence classes. [2025-01-10 06:40:38,253 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 06:40:38,253 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 06:40:38,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:38,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:40:38,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:38,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053692998] [2025-01-10 06:40:38,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053692998] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:38,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:38,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 06:40:38,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349935283] [2025-01-10 06:40:38,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:38,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 06:40:38,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:38,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 06:40:38,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:40:38,479 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 38 [2025-01-10 06:40:38,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 92 transitions, 979 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-01-10 06:40:38,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:38,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 38 [2025-01-10 06:40:38,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:38,839 INFO L124 PetriNetUnfolderBase]: 960/1824 cut-off events. [2025-01-10 06:40:38,839 INFO L125 PetriNetUnfolderBase]: For 5849/5849 co-relation queries the response was YES. [2025-01-10 06:40:38,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7344 conditions, 1824 events. 960/1824 cut-off events. For 5849/5849 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 10824 event pairs, 160 based on Foata normal form. 12/1830 useless extension candidates. Maximal degree in co-relation 7036. Up to 456 conditions per place. [2025-01-10 06:40:38,848 INFO L140 encePairwiseOnDemand]: 30/38 looper letters, 93 selfloop transitions, 34 changer transitions 0/136 dead transitions. [2025-01-10 06:40:38,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 136 transitions, 1354 flow [2025-01-10 06:40:38,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 06:40:38,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 06:40:38,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 125 transitions. [2025-01-10 06:40:38,850 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3654970760233918 [2025-01-10 06:40:38,850 INFO L175 Difference]: Start difference. First operand has 138 places, 92 transitions, 979 flow. Second operand 9 states and 125 transitions. [2025-01-10 06:40:38,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 136 transitions, 1354 flow [2025-01-10 06:40:38,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 136 transitions, 1281 flow, removed 4 selfloop flow, removed 11 redundant places. [2025-01-10 06:40:38,862 INFO L231 Difference]: Finished difference. Result has 135 places, 92 transitions, 979 flow [2025-01-10 06:40:38,862 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=894, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=979, PETRI_PLACES=135, PETRI_TRANSITIONS=92} [2025-01-10 06:40:38,863 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 96 predicate places. [2025-01-10 06:40:38,863 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 92 transitions, 979 flow [2025-01-10 06:40:38,863 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-01-10 06:40:38,863 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:38,863 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:40:38,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 06:40:38,863 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 06:40:38,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:38,864 INFO L85 PathProgramCache]: Analyzing trace with hash 873129159, now seen corresponding path program 1 times [2025-01-10 06:40:38,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:38,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447817016] [2025-01-10 06:40:38,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:40:38,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:38,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 06:40:38,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 06:40:38,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:40:38,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:39,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:40:39,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:39,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447817016] [2025-01-10 06:40:39,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447817016] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:39,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:39,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 06:40:39,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988041622] [2025-01-10 06:40:39,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:39,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 06:40:39,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:39,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 06:40:39,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-10 06:40:39,140 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 38 [2025-01-10 06:40:39,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 92 transitions, 979 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-01-10 06:40:39,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:39,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 38 [2025-01-10 06:40:39,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:39,504 INFO L124 PetriNetUnfolderBase]: 775/1588 cut-off events. [2025-01-10 06:40:39,504 INFO L125 PetriNetUnfolderBase]: For 5791/5791 co-relation queries the response was YES. [2025-01-10 06:40:39,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6572 conditions, 1588 events. 775/1588 cut-off events. For 5791/5791 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 9913 event pairs, 166 based on Foata normal form. 42/1618 useless extension candidates. Maximal degree in co-relation 6431. Up to 658 conditions per place. [2025-01-10 06:40:39,511 INFO L140 encePairwiseOnDemand]: 29/38 looper letters, 58 selfloop transitions, 23 changer transitions 37/131 dead transitions. [2025-01-10 06:40:39,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 131 transitions, 1295 flow [2025-01-10 06:40:39,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 06:40:39,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 06:40:39,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 157 transitions. [2025-01-10 06:40:39,513 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3442982456140351 [2025-01-10 06:40:39,513 INFO L175 Difference]: Start difference. First operand has 135 places, 92 transitions, 979 flow. Second operand 12 states and 157 transitions. [2025-01-10 06:40:39,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 131 transitions, 1295 flow [2025-01-10 06:40:39,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 131 transitions, 1183 flow, removed 7 selfloop flow, removed 10 redundant places. [2025-01-10 06:40:39,524 INFO L231 Difference]: Finished difference. Result has 134 places, 75 transitions, 733 flow [2025-01-10 06:40:39,524 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=836, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=733, PETRI_PLACES=134, PETRI_TRANSITIONS=75} [2025-01-10 06:40:39,525 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 95 predicate places. [2025-01-10 06:40:39,525 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 75 transitions, 733 flow [2025-01-10 06:40:39,525 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-01-10 06:40:39,525 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:39,525 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:40:39,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 06:40:39,525 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 06:40:39,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:39,526 INFO L85 PathProgramCache]: Analyzing trace with hash -2128633757, now seen corresponding path program 2 times [2025-01-10 06:40:39,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:39,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659978825] [2025-01-10 06:40:39,526 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:40:39,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:39,536 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 1 equivalence classes. [2025-01-10 06:40:39,540 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 06:40:39,540 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:40:39,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:39,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:40:39,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:39,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659978825] [2025-01-10 06:40:39,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659978825] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:39,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:39,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 06:40:39,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243364504] [2025-01-10 06:40:39,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:39,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 06:40:39,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:39,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 06:40:39,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-10 06:40:39,802 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 38 [2025-01-10 06:40:39,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 75 transitions, 733 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-01-10 06:40:39,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:39,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 38 [2025-01-10 06:40:39,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:40,140 INFO L124 PetriNetUnfolderBase]: 565/1142 cut-off events. [2025-01-10 06:40:40,141 INFO L125 PetriNetUnfolderBase]: For 3260/3260 co-relation queries the response was YES. [2025-01-10 06:40:40,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4475 conditions, 1142 events. 565/1142 cut-off events. For 3260/3260 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 6481 event pairs, 152 based on Foata normal form. 14/1148 useless extension candidates. Maximal degree in co-relation 4402. Up to 766 conditions per place. [2025-01-10 06:40:40,145 INFO L140 encePairwiseOnDemand]: 28/38 looper letters, 59 selfloop transitions, 22 changer transitions 25/117 dead transitions. [2025-01-10 06:40:40,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 117 transitions, 1048 flow [2025-01-10 06:40:40,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 06:40:40,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-10 06:40:40,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 168 transitions. [2025-01-10 06:40:40,146 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.340080971659919 [2025-01-10 06:40:40,146 INFO L175 Difference]: Start difference. First operand has 134 places, 75 transitions, 733 flow. Second operand 13 states and 168 transitions. [2025-01-10 06:40:40,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 117 transitions, 1048 flow [2025-01-10 06:40:40,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 117 transitions, 971 flow, removed 3 selfloop flow, removed 12 redundant places. [2025-01-10 06:40:40,152 INFO L231 Difference]: Finished difference. Result has 121 places, 68 transitions, 628 flow [2025-01-10 06:40:40,152 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=648, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=628, PETRI_PLACES=121, PETRI_TRANSITIONS=68} [2025-01-10 06:40:40,152 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 82 predicate places. [2025-01-10 06:40:40,152 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 68 transitions, 628 flow [2025-01-10 06:40:40,152 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-01-10 06:40:40,153 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:40,153 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:40:40,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-10 06:40:40,153 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 06:40:40,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:40,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1900100309, now seen corresponding path program 1 times [2025-01-10 06:40:40,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:40,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716280968] [2025-01-10 06:40:40,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:40:40,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:40,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 06:40:40,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 06:40:40,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:40:40,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:40,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:40:40,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:40,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716280968] [2025-01-10 06:40:40,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716280968] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:40,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:40,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 06:40:40,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965708372] [2025-01-10 06:40:40,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:40,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 06:40:40,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:40,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 06:40:40,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-10 06:40:40,470 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 38 [2025-01-10 06:40:40,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 68 transitions, 628 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-01-10 06:40:40,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:40,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 38 [2025-01-10 06:40:40,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:40,785 INFO L124 PetriNetUnfolderBase]: 487/986 cut-off events. [2025-01-10 06:40:40,785 INFO L125 PetriNetUnfolderBase]: For 2471/2471 co-relation queries the response was YES. [2025-01-10 06:40:40,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3780 conditions, 986 events. 487/986 cut-off events. For 2471/2471 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 3710. Up to 654 conditions per place. [2025-01-10 06:40:40,789 INFO L140 encePairwiseOnDemand]: 28/38 looper letters, 46 selfloop transitions, 14 changer transitions 35/104 dead transitions. [2025-01-10 06:40:40,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 104 transitions, 903 flow [2025-01-10 06:40:40,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 06:40:40,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-10 06:40:40,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 159 transitions. [2025-01-10 06:40:40,790 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32186234817813764 [2025-01-10 06:40:40,790 INFO L175 Difference]: Start difference. First operand has 121 places, 68 transitions, 628 flow. Second operand 13 states and 159 transitions. [2025-01-10 06:40:40,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 104 transitions, 903 flow [2025-01-10 06:40:40,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 104 transitions, 814 flow, removed 1 selfloop flow, removed 16 redundant places. [2025-01-10 06:40:40,795 INFO L231 Difference]: Finished difference. Result has 111 places, 55 transitions, 433 flow [2025-01-10 06:40:40,795 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=532, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=433, PETRI_PLACES=111, PETRI_TRANSITIONS=55} [2025-01-10 06:40:40,795 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 72 predicate places. [2025-01-10 06:40:40,795 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 55 transitions, 433 flow [2025-01-10 06:40:40,796 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-01-10 06:40:40,796 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:40,796 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:40:40,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-10 06:40:40,796 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 06:40:40,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:40,796 INFO L85 PathProgramCache]: Analyzing trace with hash 925198435, now seen corresponding path program 3 times [2025-01-10 06:40:40,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:40,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172761559] [2025-01-10 06:40:40,796 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 06:40:40,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:40,807 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 1 equivalence classes. [2025-01-10 06:40:40,810 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 06:40:40,811 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 06:40:40,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:41,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:40:41,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:41,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172761559] [2025-01-10 06:40:41,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172761559] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:41,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:41,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 06:40:41,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153300144] [2025-01-10 06:40:41,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:41,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 06:40:41,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:41,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 06:40:41,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-10 06:40:41,059 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 38 [2025-01-10 06:40:41,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 55 transitions, 433 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-01-10 06:40:41,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:41,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 38 [2025-01-10 06:40:41,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:41,372 INFO L124 PetriNetUnfolderBase]: 381/782 cut-off events. [2025-01-10 06:40:41,372 INFO L125 PetriNetUnfolderBase]: For 1571/1571 co-relation queries the response was YES. [2025-01-10 06:40:41,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2800 conditions, 782 events. 381/782 cut-off events. For 1571/1571 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4106 event pairs, 80 based on Foata normal form. 14/792 useless extension candidates. Maximal degree in co-relation 2766. Up to 475 conditions per place. [2025-01-10 06:40:41,375 INFO L140 encePairwiseOnDemand]: 28/38 looper letters, 36 selfloop transitions, 19 changer transitions 25/87 dead transitions. [2025-01-10 06:40:41,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 87 transitions, 675 flow [2025-01-10 06:40:41,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 06:40:41,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-01-10 06:40:41,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 156 transitions. [2025-01-10 06:40:41,376 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2932330827067669 [2025-01-10 06:40:41,376 INFO L175 Difference]: Start difference. First operand has 111 places, 55 transitions, 433 flow. Second operand 14 states and 156 transitions. [2025-01-10 06:40:41,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 87 transitions, 675 flow [2025-01-10 06:40:41,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 87 transitions, 580 flow, removed 3 selfloop flow, removed 20 redundant places. [2025-01-10 06:40:41,380 INFO L231 Difference]: Finished difference. Result has 87 places, 44 transitions, 313 flow [2025-01-10 06:40:41,380 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=313, PETRI_PLACES=87, PETRI_TRANSITIONS=44} [2025-01-10 06:40:41,380 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 48 predicate places. [2025-01-10 06:40:41,380 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 44 transitions, 313 flow [2025-01-10 06:40:41,380 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-01-10 06:40:41,380 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:41,381 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:40:41,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-10 06:40:41,381 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 06:40:41,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:41,381 INFO L85 PathProgramCache]: Analyzing trace with hash 658965205, now seen corresponding path program 2 times [2025-01-10 06:40:41,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:41,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178559163] [2025-01-10 06:40:41,381 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:40:41,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:41,391 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 1 equivalence classes. [2025-01-10 06:40:41,395 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 06:40:41,395 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:40:41,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:41,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:40:41,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:41,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178559163] [2025-01-10 06:40:41,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178559163] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:41,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:41,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 06:40:41,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439207377] [2025-01-10 06:40:41,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:41,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 06:40:41,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:41,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 06:40:41,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-10 06:40:41,638 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 38 [2025-01-10 06:40:41,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 44 transitions, 313 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-01-10 06:40:41,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:41,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 38 [2025-01-10 06:40:41,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:41,862 INFO L124 PetriNetUnfolderBase]: 303/620 cut-off events. [2025-01-10 06:40:41,862 INFO L125 PetriNetUnfolderBase]: For 883/883 co-relation queries the response was YES. [2025-01-10 06:40:41,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2165 conditions, 620 events. 303/620 cut-off events. For 883/883 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3016 event pairs, 65 based on Foata normal form. 12/628 useless extension candidates. Maximal degree in co-relation 2139. Up to 363 conditions per place. [2025-01-10 06:40:41,864 INFO L140 encePairwiseOnDemand]: 29/38 looper letters, 29 selfloop transitions, 12 changer transitions 28/74 dead transitions. [2025-01-10 06:40:41,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 74 transitions, 532 flow [2025-01-10 06:40:41,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 06:40:41,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 06:40:41,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 134 transitions. [2025-01-10 06:40:41,865 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.29385964912280704 [2025-01-10 06:40:41,865 INFO L175 Difference]: Start difference. First operand has 87 places, 44 transitions, 313 flow. Second operand 12 states and 134 transitions. [2025-01-10 06:40:41,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 74 transitions, 532 flow [2025-01-10 06:40:41,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 74 transitions, 478 flow, removed 1 selfloop flow, removed 13 redundant places. [2025-01-10 06:40:41,867 INFO L231 Difference]: Finished difference. Result has 73 places, 35 transitions, 217 flow [2025-01-10 06:40:41,867 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=217, PETRI_PLACES=73, PETRI_TRANSITIONS=35} [2025-01-10 06:40:41,867 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 34 predicate places. [2025-01-10 06:40:41,867 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 35 transitions, 217 flow [2025-01-10 06:40:41,867 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-01-10 06:40:41,867 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:41,868 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:40:41,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-10 06:40:41,869 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 06:40:41,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:41,869 INFO L85 PathProgramCache]: Analyzing trace with hash 520085141, now seen corresponding path program 3 times [2025-01-10 06:40:41,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:41,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117966332] [2025-01-10 06:40:41,869 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 06:40:41,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:41,890 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 2 equivalence classes. [2025-01-10 06:40:41,894 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 15 of 16 statements. [2025-01-10 06:40:41,894 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 06:40:41,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:42,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:40:42,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:42,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117966332] [2025-01-10 06:40:42,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117966332] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:42,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:42,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 06:40:42,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597079940] [2025-01-10 06:40:42,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:42,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 06:40:42,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:42,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 06:40:42,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-10 06:40:42,165 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 38 [2025-01-10 06:40:42,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 35 transitions, 217 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-01-10 06:40:42,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:42,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 38 [2025-01-10 06:40:42,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:42,363 INFO L124 PetriNetUnfolderBase]: 192/405 cut-off events. [2025-01-10 06:40:42,364 INFO L125 PetriNetUnfolderBase]: For 623/623 co-relation queries the response was YES. [2025-01-10 06:40:42,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1362 conditions, 405 events. 192/405 cut-off events. For 623/623 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1801 event pairs, 32 based on Foata normal form. 24/429 useless extension candidates. Maximal degree in co-relation 1353. Up to 139 conditions per place. [2025-01-10 06:40:42,365 INFO L140 encePairwiseOnDemand]: 29/38 looper letters, 22 selfloop transitions, 9 changer transitions 24/57 dead transitions. [2025-01-10 06:40:42,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 57 transitions, 379 flow [2025-01-10 06:40:42,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 06:40:42,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 06:40:42,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 116 transitions. [2025-01-10 06:40:42,365 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.27751196172248804 [2025-01-10 06:40:42,365 INFO L175 Difference]: Start difference. First operand has 73 places, 35 transitions, 217 flow. Second operand 11 states and 116 transitions. [2025-01-10 06:40:42,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 57 transitions, 379 flow [2025-01-10 06:40:42,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 57 transitions, 325 flow, removed 5 selfloop flow, removed 11 redundant places. [2025-01-10 06:40:42,367 INFO L231 Difference]: Finished difference. Result has 61 places, 25 transitions, 126 flow [2025-01-10 06:40:42,367 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=51, 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=126, PETRI_PLACES=61, PETRI_TRANSITIONS=25} [2025-01-10 06:40:42,368 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 22 predicate places. [2025-01-10 06:40:42,368 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 25 transitions, 126 flow [2025-01-10 06:40:42,368 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-01-10 06:40:42,368 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:42,368 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:40:42,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-10 06:40:42,368 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 06:40:42,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:42,369 INFO L85 PathProgramCache]: Analyzing trace with hash 433393331, now seen corresponding path program 4 times [2025-01-10 06:40:42,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:42,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142977582] [2025-01-10 06:40:42,369 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 06:40:42,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:42,381 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-01-10 06:40:42,385 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 06:40:42,385 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 06:40:42,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:42,634 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:40:42,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:42,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142977582] [2025-01-10 06:40:42,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142977582] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:40:42,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146709255] [2025-01-10 06:40:42,635 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 06:40:42,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:40:42,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:40:42,643 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:40:42,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 06:40:42,746 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-01-10 06:40:42,768 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 06:40:42,768 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 06:40:42,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:42,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-10 06:40:42,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:40:42,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-01-10 06:40:42,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:40:42,865 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:40:42,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1146709255] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:42,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:40:42,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2025-01-10 06:40:42,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202198763] [2025-01-10 06:40:42,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:42,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:40:42,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:42,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:40:42,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-01-10 06:40:42,867 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 38 [2025-01-10 06:40:42,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 25 transitions, 126 flow. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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-01-10 06:40:42,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:42,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 38 [2025-01-10 06:40:42,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:42,963 INFO L124 PetriNetUnfolderBase]: 55/136 cut-off events. [2025-01-10 06:40:42,963 INFO L125 PetriNetUnfolderBase]: For 97/97 co-relation queries the response was YES. [2025-01-10 06:40:42,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 444 conditions, 136 events. 55/136 cut-off events. For 97/97 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 374 event pairs, 4 based on Foata normal form. 4/140 useless extension candidates. Maximal degree in co-relation 437. Up to 43 conditions per place. [2025-01-10 06:40:42,965 INFO L140 encePairwiseOnDemand]: 33/38 looper letters, 30 selfloop transitions, 7 changer transitions 0/40 dead transitions. [2025-01-10 06:40:42,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 40 transitions, 251 flow [2025-01-10 06:40:42,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:40:42,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:40:42,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 94 transitions. [2025-01-10 06:40:42,966 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41228070175438597 [2025-01-10 06:40:42,966 INFO L175 Difference]: Start difference. First operand has 61 places, 25 transitions, 126 flow. Second operand 6 states and 94 transitions. [2025-01-10 06:40:42,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 40 transitions, 251 flow [2025-01-10 06:40:42,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 40 transitions, 194 flow, removed 1 selfloop flow, removed 16 redundant places. [2025-01-10 06:40:42,968 INFO L231 Difference]: Finished difference. Result has 42 places, 27 transitions, 100 flow [2025-01-10 06:40:42,968 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=100, PETRI_PLACES=42, PETRI_TRANSITIONS=27} [2025-01-10 06:40:42,969 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 3 predicate places. [2025-01-10 06:40:42,969 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 27 transitions, 100 flow [2025-01-10 06:40:42,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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-01-10 06:40:42,969 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:42,969 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:40:42,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 06:40:43,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-01-10 06:40:43,173 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 06:40:43,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:43,174 INFO L85 PathProgramCache]: Analyzing trace with hash 547489570, now seen corresponding path program 1 times [2025-01-10 06:40:43,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:43,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612566779] [2025-01-10 06:40:43,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:40:43,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:43,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 06:40:43,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 06:40:43,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:40:43,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:43,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:40:43,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:43,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612566779] [2025-01-10 06:40:43,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612566779] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:43,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:43,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-10 06:40:43,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068334122] [2025-01-10 06:40:43,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:43,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 06:40:43,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:43,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 06:40:43,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:40:43,497 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 38 [2025-01-10 06:40:43,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 27 transitions, 100 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 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-01-10 06:40:43,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:43,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 38 [2025-01-10 06:40:43,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:43,721 INFO L124 PetriNetUnfolderBase]: 55/128 cut-off events. [2025-01-10 06:40:43,721 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-01-10 06:40:43,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 362 conditions, 128 events. 55/128 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 319 event pairs, 4 based on Foata normal form. 8/136 useless extension candidates. Maximal degree in co-relation 356. Up to 47 conditions per place. [2025-01-10 06:40:43,722 INFO L140 encePairwiseOnDemand]: 29/38 looper letters, 0 selfloop transitions, 0 changer transitions 42/42 dead transitions. [2025-01-10 06:40:43,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 42 transitions, 221 flow [2025-01-10 06:40:43,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 06:40:43,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 06:40:43,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 106 transitions. [2025-01-10 06:40:43,722 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2535885167464115 [2025-01-10 06:40:43,722 INFO L175 Difference]: Start difference. First operand has 42 places, 27 transitions, 100 flow. Second operand 11 states and 106 transitions. [2025-01-10 06:40:43,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 42 transitions, 221 flow [2025-01-10 06:40:43,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 42 transitions, 219 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:40:43,723 INFO L231 Difference]: Finished difference. Result has 49 places, 0 transitions, 0 flow [2025-01-10 06:40:43,723 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=0, PETRI_PLACES=49, PETRI_TRANSITIONS=0} [2025-01-10 06:40:43,724 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 10 predicate places. [2025-01-10 06:40:43,724 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 0 transitions, 0 flow [2025-01-10 06:40:43,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 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-01-10 06:40:43,727 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2025-01-10 06:40:43,727 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 8 remaining) [2025-01-10 06:40:43,727 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-01-10 06:40:43,727 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-01-10 06:40:43,727 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-01-10 06:40:43,727 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-01-10 06:40:43,727 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-01-10 06:40:43,727 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-01-10 06:40:43,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-10 06:40:43,727 INFO L422 BasicCegarLoop]: Path program histogram: [5, 4, 4, 3, 3, 2, 1, 1, 1, 1] [2025-01-10 06:40:43,732 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-10 06:40:43,732 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 06:40:43,737 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 06:40:43 BasicIcfg [2025-01-10 06:40:43,738 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 06:40:43,738 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 06:40:43,738 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 06:40:43,738 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 06:40:43,739 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:40:24" (3/4) ... [2025-01-10 06:40:43,740 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 06:40:43,742 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure my_callback [2025-01-10 06:40:43,746 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 122 nodes and edges [2025-01-10 06:40:43,747 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 43 nodes and edges [2025-01-10 06:40:43,747 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-01-10 06:40:43,747 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-10 06:40:43,807 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 06:40:43,808 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 06:40:43,808 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 06:40:43,808 INFO L158 Benchmark]: Toolchain (without parser) took 20820.82ms. Allocated memory was 167.8MB in the beginning and 587.2MB in the end (delta: 419.4MB). Free memory was 129.0MB in the beginning and 533.7MB in the end (delta: -404.6MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. [2025-01-10 06:40:43,809 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 226.5MB. Free memory is still 145.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:40:43,809 INFO L158 Benchmark]: CACSL2BoogieTranslator took 425.18ms. Allocated memory is still 167.8MB. Free memory was 128.7MB in the beginning and 98.2MB in the end (delta: 30.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-10 06:40:43,809 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.56ms. Allocated memory is still 167.8MB. Free memory was 98.2MB in the beginning and 95.7MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:40:43,809 INFO L158 Benchmark]: Boogie Preprocessor took 33.44ms. Allocated memory is still 167.8MB. Free memory was 95.7MB in the beginning and 92.3MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 06:40:43,809 INFO L158 Benchmark]: RCFGBuilder took 669.30ms. Allocated memory is still 167.8MB. Free memory was 92.3MB in the beginning and 44.6MB in the end (delta: 47.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-01-10 06:40:43,810 INFO L158 Benchmark]: TraceAbstraction took 19585.95ms. Allocated memory was 167.8MB in the beginning and 587.2MB in the end (delta: 419.4MB). Free memory was 43.9MB in the beginning and 542.0MB in the end (delta: -498.1MB). Peak memory consumption was 265.2MB. Max. memory is 16.1GB. [2025-01-10 06:40:43,810 INFO L158 Benchmark]: Witness Printer took 69.85ms. Allocated memory is still 587.2MB. Free memory was 542.0MB in the beginning and 533.7MB in the end (delta: 8.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:40:43,811 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 226.5MB. Free memory is still 145.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 425.18ms. Allocated memory is still 167.8MB. Free memory was 128.7MB in the beginning and 98.2MB in the end (delta: 30.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.56ms. Allocated memory is still 167.8MB. Free memory was 98.2MB in the beginning and 95.7MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.44ms. Allocated memory is still 167.8MB. Free memory was 95.7MB in the beginning and 92.3MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 669.30ms. Allocated memory is still 167.8MB. Free memory was 92.3MB in the beginning and 44.6MB in the end (delta: 47.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 19585.95ms. Allocated memory was 167.8MB in the beginning and 587.2MB in the end (delta: 419.4MB). Free memory was 43.9MB in the beginning and 542.0MB in the end (delta: -498.1MB). Peak memory consumption was 265.2MB. Max. memory is 16.1GB. * Witness Printer took 69.85ms. Allocated memory is still 587.2MB. Free memory was 542.0MB in the beginning and 533.7MB in the end (delta: 8.4MB). 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: 19.5s, OverallIterations: 25, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 11.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2086 SdHoareTripleChecker+Valid, 5.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1957 mSDsluCounter, 1521 SdHoareTripleChecker+Invalid, 4.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1409 mSDsCounter, 273 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7774 IncrementalHoareTripleChecker+Invalid, 8047 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 273 mSolverCounterUnsat, 112 mSDtfsCounter, 7774 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 343 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 294 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=979occurred in iteration=16, InterpolantAutomatonStates: 268, 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.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 377 NumberOfCodeBlocks, 376 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 351 ConstructedInterpolants, 0 QuantifiedInterpolants, 3498 SizeOfPredicates, 6 NumberOfNonLiveVariables, 199 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 26 InterpolantComputations, 25 PerfectInterpolantSequences, 5/6 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-01-10 06:40:43,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE