./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_02-simple_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_02-simple_racefree.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b3e7d0a2f10d1449a9a354d4032bafdd0ae7a7fd76aceb835acbee3134ec74e4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 06:34:14,914 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 06:34:14,962 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 06:34:14,966 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 06:34:14,966 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 06:34:14,985 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 06:34:14,985 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 06:34:14,985 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 06:34:14,986 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 06:34:14,986 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 06:34:14,986 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 06:34:14,986 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 06:34:14,986 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 06:34:14,986 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 06:34:14,986 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 06:34:14,986 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 06:34:14,986 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 06:34:14,986 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 06:34:14,986 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 06:34:14,987 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 06:34:14,987 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 06:34:14,987 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 06:34:14,987 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 06:34:14,987 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 06:34:14,987 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 06:34:14,987 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 06:34:14,987 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 06:34:14,987 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 06:34:14,987 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 06:34:14,987 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 06:34:14,987 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 06:34:14,987 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 06:34:14,987 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 06:34:14,987 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 06:34:14,987 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 06:34:14,988 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 06:34:14,988 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 06:34:14,988 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 06:34:14,989 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 06:34:14,989 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 06:34:14,989 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 06:34:14,989 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 06:34:14,989 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 06:34:14,989 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 06:34:14,989 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 06:34:14,989 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b3e7d0a2f10d1449a9a354d4032bafdd0ae7a7fd76aceb835acbee3134ec74e4 [2025-03-09 06:34:15,211 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 06:34:15,219 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 06:34:15,221 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 06:34:15,222 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 06:34:15,222 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 06:34:15,224 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_02-simple_racefree.i [2025-03-09 06:34:16,338 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad493a938/a9383e098b7a40cd823eb1604c88d082/FLAGf2c3534b3 [2025-03-09 06:34:16,622 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 06:34:16,625 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_02-simple_racefree.i [2025-03-09 06:34:16,638 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad493a938/a9383e098b7a40cd823eb1604c88d082/FLAGf2c3534b3 [2025-03-09 06:34:16,915 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad493a938/a9383e098b7a40cd823eb1604c88d082 [2025-03-09 06:34:16,917 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 06:34:16,918 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 06:34:16,919 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 06:34:16,919 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 06:34:16,922 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 06:34:16,922 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:34:16" (1/1) ... [2025-03-09 06:34:16,923 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57efafa0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:34:16, skipping insertion in model container [2025-03-09 06:34:16,923 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:34:16" (1/1) ... [2025-03-09 06:34:16,950 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 06:34:17,202 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:34:17,220 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 06:34:17,256 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:34:17,285 INFO L204 MainTranslator]: Completed translation [2025-03-09 06:34:17,285 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:34:17 WrapperNode [2025-03-09 06:34:17,285 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 06:34:17,286 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 06:34:17,286 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 06:34:17,286 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 06:34:17,290 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:34:17" (1/1) ... [2025-03-09 06:34:17,298 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:34:17" (1/1) ... [2025-03-09 06:34:17,315 INFO L138 Inliner]: procedures = 171, calls = 36, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 130 [2025-03-09 06:34:17,315 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 06:34:17,316 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 06:34:17,316 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 06:34:17,316 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 06:34:17,323 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:34:17" (1/1) ... [2025-03-09 06:34:17,323 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:34:17" (1/1) ... [2025-03-09 06:34:17,325 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:34:17" (1/1) ... [2025-03-09 06:34:17,334 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 5, 5, 2]. 36 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 5, 5, 0]. The 1 writes are split as follows [0, 0, 0, 1]. [2025-03-09 06:34:17,334 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:34:17" (1/1) ... [2025-03-09 06:34:17,334 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:34:17" (1/1) ... [2025-03-09 06:34:17,339 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:34:17" (1/1) ... [2025-03-09 06:34:17,340 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:34:17" (1/1) ... [2025-03-09 06:34:17,341 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:34:17" (1/1) ... [2025-03-09 06:34:17,342 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:34:17" (1/1) ... [2025-03-09 06:34:17,343 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 06:34:17,344 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 06:34:17,344 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 06:34:17,344 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 06:34:17,345 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:34:17" (1/1) ... [2025-03-09 06:34:17,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 06:34:17,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:34:17,372 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 06:34:17,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 06:34:17,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 06:34:17,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 06:34:17,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 06:34:17,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-09 06:34:17,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 06:34:17,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 06:34:17,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 06:34:17,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-09 06:34:17,391 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-09 06:34:17,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 06:34:17,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 06:34:17,391 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-09 06:34:17,391 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-09 06:34:17,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 06:34:17,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 06:34:17,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 06:34:17,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 06:34:17,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-09 06:34:17,391 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-09 06:34:17,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 06:34:17,391 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 06:34:17,392 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 06:34:17,511 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 06:34:17,512 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 06:34:17,702 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L707: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-03-09 06:34:17,702 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L707-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-03-09 06:34:17,732 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 06:34:17,732 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 06:34:17,892 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 06:34:17,892 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 06:34:17,893 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:34:17 BoogieIcfgContainer [2025-03-09 06:34:17,893 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 06:34:17,894 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 06:34:17,895 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 06:34:17,898 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 06:34:17,898 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 06:34:16" (1/3) ... [2025-03-09 06:34:17,899 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a91d5e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:34:17, skipping insertion in model container [2025-03-09 06:34:17,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:34:17" (2/3) ... [2025-03-09 06:34:17,900 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a91d5e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:34:17, skipping insertion in model container [2025-03-09 06:34:17,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:34:17" (3/3) ... [2025-03-09 06:34:17,901 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_02-simple_racefree.i [2025-03-09 06:34:17,914 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 06:34:17,916 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_02-simple_racefree.i that has 2 procedures, 50 locations, 1 initial locations, 5 loop locations, and 8 error locations. [2025-03-09 06:34:17,917 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 06:34:17,959 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-09 06:34:17,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 59 transitions, 125 flow [2025-03-09 06:34:18,017 INFO L124 PetriNetUnfolderBase]: 11/74 cut-off events. [2025-03-09 06:34:18,019 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-09 06:34:18,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 74 events. 11/74 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 221 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 50. Up to 4 conditions per place. [2025-03-09 06:34:18,021 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 59 transitions, 125 flow [2025-03-09 06:34:18,023 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 58 transitions, 123 flow [2025-03-09 06:34:18,028 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 06:34:18,056 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;@148ff073, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 06:34:18,056 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-03-09 06:34:18,063 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 06:34:18,064 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-03-09 06:34:18,064 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 06:34:18,065 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:34:18,065 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 06:34:18,066 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-09 06:34:18,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:34:18,071 INFO L85 PathProgramCache]: Analyzing trace with hash 392651746, now seen corresponding path program 1 times [2025-03-09 06:34:18,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:34:18,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790486062] [2025-03-09 06:34:18,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:34:18,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:34:18,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:34:18,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:34:18,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:34:18,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:34:18,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:34:18,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:34:18,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790486062] [2025-03-09 06:34:18,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790486062] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:34:18,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:34:18,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:34:18,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482938686] [2025-03-09 06:34:18,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:34:18,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:34:18,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:34:18,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:34:18,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:34:18,398 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2025-03-09 06:34:18,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 58 transitions, 123 flow. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:34:18,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:34:18,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2025-03-09 06:34:18,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:34:18,583 INFO L124 PetriNetUnfolderBase]: 132/369 cut-off events. [2025-03-09 06:34:18,583 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-09 06:34:18,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 666 conditions, 369 events. 132/369 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1776 event pairs, 0 based on Foata normal form. 63/401 useless extension candidates. Maximal degree in co-relation 636. Up to 255 conditions per place. [2025-03-09 06:34:18,587 INFO L140 encePairwiseOnDemand]: 45/59 looper letters, 46 selfloop transitions, 3 changer transitions 0/71 dead transitions. [2025-03-09 06:34:18,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 71 transitions, 247 flow [2025-03-09 06:34:18,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:34:18,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:34:18,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 160 transitions. [2025-03-09 06:34:18,598 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6779661016949152 [2025-03-09 06:34:18,599 INFO L175 Difference]: Start difference. First operand has 53 places, 58 transitions, 123 flow. Second operand 4 states and 160 transitions. [2025-03-09 06:34:18,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 71 transitions, 247 flow [2025-03-09 06:34:18,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 71 transitions, 247 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 06:34:18,609 INFO L231 Difference]: Finished difference. Result has 55 places, 48 transitions, 113 flow [2025-03-09 06:34:18,611 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=113, PETRI_PLACES=55, PETRI_TRANSITIONS=48} [2025-03-09 06:34:18,615 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 2 predicate places. [2025-03-09 06:34:18,616 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 48 transitions, 113 flow [2025-03-09 06:34:18,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:34:18,617 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:34:18,617 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-09 06:34:18,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 06:34:18,617 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-09 06:34:18,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:34:18,618 INFO L85 PathProgramCache]: Analyzing trace with hash -2002423291, now seen corresponding path program 1 times [2025-03-09 06:34:18,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:34:18,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888404075] [2025-03-09 06:34:18,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:34:18,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:34:18,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:34:18,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:34:18,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:34:18,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:34:18,660 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:34:18,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:34:18,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:34:18,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:34:18,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:34:18,703 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:34:18,711 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 06:34:18,712 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-03-09 06:34:18,713 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 13 remaining) [2025-03-09 06:34:18,713 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 13 remaining) [2025-03-09 06:34:18,713 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 13 remaining) [2025-03-09 06:34:18,713 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 13 remaining) [2025-03-09 06:34:18,714 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 13 remaining) [2025-03-09 06:34:18,714 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 13 remaining) [2025-03-09 06:34:18,714 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 13 remaining) [2025-03-09 06:34:18,714 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 13 remaining) [2025-03-09 06:34:18,714 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 13 remaining) [2025-03-09 06:34:18,714 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 13 remaining) [2025-03-09 06:34:18,714 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 13 remaining) [2025-03-09 06:34:18,714 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 13 remaining) [2025-03-09 06:34:18,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 06:34:18,714 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-09 06:34:18,716 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-09 06:34:18,716 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-09 06:34:18,752 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-09 06:34:18,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 91 transitions, 198 flow [2025-03-09 06:34:18,781 INFO L124 PetriNetUnfolderBase]: 21/140 cut-off events. [2025-03-09 06:34:18,782 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-09 06:34:18,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 140 events. 21/140 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 515 event pairs, 0 based on Foata normal form. 0/97 useless extension candidates. Maximal degree in co-relation 89. Up to 6 conditions per place. [2025-03-09 06:34:18,784 INFO L82 GeneralOperation]: Start removeDead. Operand has 80 places, 91 transitions, 198 flow [2025-03-09 06:34:18,785 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 80 places, 91 transitions, 198 flow [2025-03-09 06:34:18,787 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 06:34:18,788 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;@148ff073, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 06:34:18,788 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-03-09 06:34:18,790 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 06:34:18,791 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-03-09 06:34:18,791 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 06:34:18,791 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:34:18,792 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 06:34:18,792 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-09 06:34:18,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:34:18,792 INFO L85 PathProgramCache]: Analyzing trace with hash 479522331, now seen corresponding path program 1 times [2025-03-09 06:34:18,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:34:18,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92462552] [2025-03-09 06:34:18,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:34:18,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:34:18,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:34:18,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:34:18,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:34:18,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:34:18,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:34:18,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:34:18,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92462552] [2025-03-09 06:34:18,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92462552] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:34:18,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:34:18,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:34:18,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150928210] [2025-03-09 06:34:18,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:34:18,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:34:18,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:34:18,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:34:18,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:34:18,885 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 91 [2025-03-09 06:34:18,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 91 transitions, 198 flow. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:34:18,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:34:18,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 91 [2025-03-09 06:34:18,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:34:19,675 INFO L124 PetriNetUnfolderBase]: 4028/8280 cut-off events. [2025-03-09 06:34:19,675 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2025-03-09 06:34:19,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14758 conditions, 8280 events. 4028/8280 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 66298 event pairs, 2274 based on Foata normal form. 1267/8705 useless extension candidates. Maximal degree in co-relation 3174. Up to 6374 conditions per place. [2025-03-09 06:34:19,732 INFO L140 encePairwiseOnDemand]: 71/91 looper letters, 64 selfloop transitions, 3 changer transitions 0/102 dead transitions. [2025-03-09 06:34:19,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 102 transitions, 354 flow [2025-03-09 06:34:19,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:34:19,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:34:19,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 236 transitions. [2025-03-09 06:34:19,735 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6483516483516484 [2025-03-09 06:34:19,735 INFO L175 Difference]: Start difference. First operand has 80 places, 91 transitions, 198 flow. Second operand 4 states and 236 transitions. [2025-03-09 06:34:19,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 102 transitions, 354 flow [2025-03-09 06:34:19,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 102 transitions, 354 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 06:34:19,737 INFO L231 Difference]: Finished difference. Result has 85 places, 79 transitions, 194 flow [2025-03-09 06:34:19,738 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=194, PETRI_PLACES=85, PETRI_TRANSITIONS=79} [2025-03-09 06:34:19,738 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 5 predicate places. [2025-03-09 06:34:19,738 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 79 transitions, 194 flow [2025-03-09 06:34:19,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:34:19,740 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:34:19,740 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:34:19,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 06:34:19,740 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-09 06:34:19,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:34:19,741 INFO L85 PathProgramCache]: Analyzing trace with hash -296011007, now seen corresponding path program 1 times [2025-03-09 06:34:19,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:34:19,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788305579] [2025-03-09 06:34:19,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:34:19,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:34:19,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 06:34:19,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 06:34:19,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:34:19,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:34:19,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:34:19,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:34:19,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788305579] [2025-03-09 06:34:19,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788305579] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:34:19,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:34:19,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:34:19,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607760664] [2025-03-09 06:34:19,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:34:19,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:34:19,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:34:19,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:34:19,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:34:19,855 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 91 [2025-03-09 06:34:19,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 79 transitions, 194 flow. Second operand has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:34:19,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:34:19,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 91 [2025-03-09 06:34:19,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:34:20,757 INFO L124 PetriNetUnfolderBase]: 5811/12013 cut-off events. [2025-03-09 06:34:20,758 INFO L125 PetriNetUnfolderBase]: For 535/941 co-relation queries the response was YES. [2025-03-09 06:34:20,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21816 conditions, 12013 events. 5811/12013 cut-off events. For 535/941 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 103383 event pairs, 1739 based on Foata normal form. 221/10984 useless extension candidates. Maximal degree in co-relation 21710. Up to 4468 conditions per place. [2025-03-09 06:34:20,868 INFO L140 encePairwiseOnDemand]: 82/91 looper letters, 118 selfloop transitions, 14 changer transitions 0/169 dead transitions. [2025-03-09 06:34:20,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 169 transitions, 678 flow [2025-03-09 06:34:20,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 06:34:20,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 06:34:20,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 311 transitions. [2025-03-09 06:34:20,872 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6835164835164835 [2025-03-09 06:34:20,872 INFO L175 Difference]: Start difference. First operand has 85 places, 79 transitions, 194 flow. Second operand 5 states and 311 transitions. [2025-03-09 06:34:20,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 169 transitions, 678 flow [2025-03-09 06:34:20,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 169 transitions, 674 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:34:20,878 INFO L231 Difference]: Finished difference. Result has 92 places, 92 transitions, 298 flow [2025-03-09 06:34:20,879 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=298, PETRI_PLACES=92, PETRI_TRANSITIONS=92} [2025-03-09 06:34:20,880 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 12 predicate places. [2025-03-09 06:34:20,881 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 92 transitions, 298 flow [2025-03-09 06:34:20,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:34:20,881 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:34:20,881 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 06:34:20,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 06:34:20,881 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-09 06:34:20,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:34:20,882 INFO L85 PathProgramCache]: Analyzing trace with hash 121354059, now seen corresponding path program 1 times [2025-03-09 06:34:20,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:34:20,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314342513] [2025-03-09 06:34:20,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:34:20,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:34:20,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 06:34:20,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 06:34:20,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:34:20,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:34:20,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:34:20,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:34:20,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314342513] [2025-03-09 06:34:20,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314342513] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:34:20,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:34:20,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 06:34:20,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417618786] [2025-03-09 06:34:20,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:34:20,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 06:34:20,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:34:20,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 06:34:20,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 06:34:20,991 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 91 [2025-03-09 06:34:20,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 92 transitions, 298 flow. Second operand has 6 states, 6 states have (on average 36.5) internal successors, (219), 6 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:34:20,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:34:20,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 91 [2025-03-09 06:34:20,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:34:21,941 INFO L124 PetriNetUnfolderBase]: 5837/11869 cut-off events. [2025-03-09 06:34:21,942 INFO L125 PetriNetUnfolderBase]: For 4611/4916 co-relation queries the response was YES. [2025-03-09 06:34:21,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25305 conditions, 11869 events. 5837/11869 cut-off events. For 4611/4916 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 101911 event pairs, 1572 based on Foata normal form. 268/11235 useless extension candidates. Maximal degree in co-relation 14079. Up to 6844 conditions per place. [2025-03-09 06:34:22,016 INFO L140 encePairwiseOnDemand]: 86/91 looper letters, 129 selfloop transitions, 6 changer transitions 0/172 dead transitions. [2025-03-09 06:34:22,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 172 transitions, 830 flow [2025-03-09 06:34:22,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 06:34:22,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 06:34:22,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 321 transitions. [2025-03-09 06:34:22,018 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5879120879120879 [2025-03-09 06:34:22,018 INFO L175 Difference]: Start difference. First operand has 92 places, 92 transitions, 298 flow. Second operand 6 states and 321 transitions. [2025-03-09 06:34:22,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 172 transitions, 830 flow [2025-03-09 06:34:22,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 172 transitions, 830 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 06:34:22,026 INFO L231 Difference]: Finished difference. Result has 96 places, 91 transitions, 306 flow [2025-03-09 06:34:22,026 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=306, PETRI_PLACES=96, PETRI_TRANSITIONS=91} [2025-03-09 06:34:22,027 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 16 predicate places. [2025-03-09 06:34:22,027 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 91 transitions, 306 flow [2025-03-09 06:34:22,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 36.5) internal successors, (219), 6 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:34:22,027 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:34:22,027 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:34:22,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 06:34:22,027 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-09 06:34:22,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:34:22,028 INFO L85 PathProgramCache]: Analyzing trace with hash -586406150, now seen corresponding path program 1 times [2025-03-09 06:34:22,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:34:22,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298531768] [2025-03-09 06:34:22,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:34:22,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:34:22,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 06:34:22,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 06:34:22,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:34:22,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:34:22,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:34:22,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:34:22,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298531768] [2025-03-09 06:34:22,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298531768] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:34:22,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:34:22,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:34:22,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002580468] [2025-03-09 06:34:22,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:34:22,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:34:22,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:34:22,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:34:22,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:34:22,103 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 91 [2025-03-09 06:34:22,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 91 transitions, 306 flow. Second operand has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:34:22,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:34:22,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 91 [2025-03-09 06:34:22,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:34:22,863 INFO L124 PetriNetUnfolderBase]: 6089/12900 cut-off events. [2025-03-09 06:34:22,863 INFO L125 PetriNetUnfolderBase]: For 6830/7065 co-relation queries the response was YES. [2025-03-09 06:34:22,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27194 conditions, 12900 events. 6089/12900 cut-off events. For 6830/7065 co-relation queries the response was YES. Maximal size of possible extension queue 450. Compared 115446 event pairs, 1525 based on Foata normal form. 227/12209 useless extension candidates. Maximal degree in co-relation 22785. Up to 6239 conditions per place. [2025-03-09 06:34:22,925 INFO L140 encePairwiseOnDemand]: 82/91 looper letters, 119 selfloop transitions, 19 changer transitions 0/174 dead transitions. [2025-03-09 06:34:22,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 174 transitions, 842 flow [2025-03-09 06:34:22,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 06:34:22,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 06:34:22,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 309 transitions. [2025-03-09 06:34:22,928 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6791208791208792 [2025-03-09 06:34:22,928 INFO L175 Difference]: Start difference. First operand has 96 places, 91 transitions, 306 flow. Second operand 5 states and 309 transitions. [2025-03-09 06:34:22,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 174 transitions, 842 flow [2025-03-09 06:34:22,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 174 transitions, 819 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-03-09 06:34:22,937 INFO L231 Difference]: Finished difference. Result has 98 places, 99 transitions, 411 flow [2025-03-09 06:34:22,938 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=411, PETRI_PLACES=98, PETRI_TRANSITIONS=99} [2025-03-09 06:34:22,938 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 18 predicate places. [2025-03-09 06:34:22,938 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 99 transitions, 411 flow [2025-03-09 06:34:22,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:34:22,938 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:34:22,939 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-03-09 06:34:22,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 06:34:22,939 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-09 06:34:22,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:34:22,939 INFO L85 PathProgramCache]: Analyzing trace with hash -532991050, now seen corresponding path program 1 times [2025-03-09 06:34:22,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:34:22,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711340295] [2025-03-09 06:34:22,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:34:22,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:34:22,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 06:34:22,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 06:34:22,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:34:22,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:34:22,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:34:22,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:34:22,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711340295] [2025-03-09 06:34:22,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711340295] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:34:22,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:34:22,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:34:22,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535460636] [2025-03-09 06:34:22,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:34:22,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:34:22,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:34:22,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:34:22,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:34:23,001 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 91 [2025-03-09 06:34:23,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 99 transitions, 411 flow. Second operand has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:34:23,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:34:23,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 91 [2025-03-09 06:34:23,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:34:23,620 INFO L124 PetriNetUnfolderBase]: 6057/12382 cut-off events. [2025-03-09 06:34:23,620 INFO L125 PetriNetUnfolderBase]: For 10371/10479 co-relation queries the response was YES. [2025-03-09 06:34:23,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27912 conditions, 12382 events. 6057/12382 cut-off events. For 10371/10479 co-relation queries the response was YES. Maximal size of possible extension queue 424. Compared 106952 event pairs, 1444 based on Foata normal form. 268/11880 useless extension candidates. Maximal degree in co-relation 22329. Up to 8305 conditions per place. [2025-03-09 06:34:23,737 INFO L140 encePairwiseOnDemand]: 86/91 looper letters, 116 selfloop transitions, 6 changer transitions 0/159 dead transitions. [2025-03-09 06:34:23,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 159 transitions, 903 flow [2025-03-09 06:34:23,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:34:23,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:34:23,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 226 transitions. [2025-03-09 06:34:23,738 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6208791208791209 [2025-03-09 06:34:23,738 INFO L175 Difference]: Start difference. First operand has 98 places, 99 transitions, 411 flow. Second operand 4 states and 226 transitions. [2025-03-09 06:34:23,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 159 transitions, 903 flow [2025-03-09 06:34:23,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 159 transitions, 899 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-09 06:34:23,746 INFO L231 Difference]: Finished difference. Result has 100 places, 99 transitions, 423 flow [2025-03-09 06:34:23,746 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=423, PETRI_PLACES=100, PETRI_TRANSITIONS=99} [2025-03-09 06:34:23,747 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 20 predicate places. [2025-03-09 06:34:23,747 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 99 transitions, 423 flow [2025-03-09 06:34:23,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:34:23,747 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:34:23,747 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1] [2025-03-09 06:34:23,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 06:34:23,747 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-09 06:34:23,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:34:23,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1103275243, now seen corresponding path program 1 times [2025-03-09 06:34:23,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:34:23,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496864628] [2025-03-09 06:34:23,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:34:23,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:34:23,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 06:34:23,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 06:34:23,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:34:23,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:34:23,775 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:34:23,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 06:34:23,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 06:34:23,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:34:23,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:34:23,796 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:34:23,797 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 06:34:23,797 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 17 remaining) [2025-03-09 06:34:23,797 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 17 remaining) [2025-03-09 06:34:23,797 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 17 remaining) [2025-03-09 06:34:23,797 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 17 remaining) [2025-03-09 06:34:23,797 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 17 remaining) [2025-03-09 06:34:23,797 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 17 remaining) [2025-03-09 06:34:23,797 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 17 remaining) [2025-03-09 06:34:23,797 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 17 remaining) [2025-03-09 06:34:23,797 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 17 remaining) [2025-03-09 06:34:23,797 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 17 remaining) [2025-03-09 06:34:23,797 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 17 remaining) [2025-03-09 06:34:23,797 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 17 remaining) [2025-03-09 06:34:23,797 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 17 remaining) [2025-03-09 06:34:23,797 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 17 remaining) [2025-03-09 06:34:23,797 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 17 remaining) [2025-03-09 06:34:23,797 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 17 remaining) [2025-03-09 06:34:23,797 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 17 remaining) [2025-03-09 06:34:23,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 06:34:23,798 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-09 06:34:23,798 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-09 06:34:23,798 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-09 06:34:23,820 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-09 06:34:23,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 123 transitions, 273 flow [2025-03-09 06:34:23,843 INFO L124 PetriNetUnfolderBase]: 34/225 cut-off events. [2025-03-09 06:34:23,843 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-09 06:34:23,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 225 events. 34/225 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 909 event pairs, 1 based on Foata normal form. 0/155 useless extension candidates. Maximal degree in co-relation 155. Up to 12 conditions per place. [2025-03-09 06:34:23,845 INFO L82 GeneralOperation]: Start removeDead. Operand has 107 places, 123 transitions, 273 flow [2025-03-09 06:34:23,846 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 123 transitions, 273 flow [2025-03-09 06:34:23,847 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 06:34:23,848 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;@148ff073, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 06:34:23,848 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2025-03-09 06:34:23,850 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 06:34:23,850 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-03-09 06:34:23,850 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 06:34:23,850 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:34:23,850 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 06:34:23,850 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-09 06:34:23,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:34:23,851 INFO L85 PathProgramCache]: Analyzing trace with hash 596930676, now seen corresponding path program 1 times [2025-03-09 06:34:23,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:34:23,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771022316] [2025-03-09 06:34:23,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:34:23,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:34:23,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:34:23,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:34:23,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:34:23,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:34:23,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:34:23,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:34:23,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771022316] [2025-03-09 06:34:23,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771022316] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:34:23,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:34:23,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:34:23,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165351504] [2025-03-09 06:34:23,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:34:23,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:34:23,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:34:23,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:34:23,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:34:23,916 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 123 [2025-03-09 06:34:23,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 123 transitions, 273 flow. Second operand has 4 states, 4 states have (on average 49.25) internal successors, (197), 4 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:34:23,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:34:23,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 123 [2025-03-09 06:34:23,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:34:30,995 INFO L124 PetriNetUnfolderBase]: 76325/138029 cut-off events. [2025-03-09 06:34:30,995 INFO L125 PetriNetUnfolderBase]: For 1879/1879 co-relation queries the response was YES. [2025-03-09 06:34:31,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 245126 conditions, 138029 events. 76325/138029 cut-off events. For 1879/1879 co-relation queries the response was YES. Maximal size of possible extension queue 3134. Compared 1439381 event pairs, 49600 based on Foata normal form. 22462/147889 useless extension candidates. Maximal degree in co-relation 15953. Up to 105935 conditions per place. [2025-03-09 06:34:31,629 INFO L140 encePairwiseOnDemand]: 97/123 looper letters, 77 selfloop transitions, 3 changer transitions 0/128 dead transitions. [2025-03-09 06:34:31,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 128 transitions, 443 flow [2025-03-09 06:34:31,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:34:31,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:34:31,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 307 transitions. [2025-03-09 06:34:31,631 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6239837398373984 [2025-03-09 06:34:31,631 INFO L175 Difference]: Start difference. First operand has 107 places, 123 transitions, 273 flow. Second operand 4 states and 307 transitions. [2025-03-09 06:34:31,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 128 transitions, 443 flow [2025-03-09 06:34:31,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 128 transitions, 443 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 06:34:31,633 INFO L231 Difference]: Finished difference. Result has 112 places, 105 transitions, 257 flow [2025-03-09 06:34:31,634 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=257, PETRI_PLACES=112, PETRI_TRANSITIONS=105} [2025-03-09 06:34:31,634 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 5 predicate places. [2025-03-09 06:34:31,634 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 105 transitions, 257 flow [2025-03-09 06:34:31,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.25) internal successors, (197), 4 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:34:31,634 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:34:31,635 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:34:31,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 06:34:31,635 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-09 06:34:31,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:34:31,635 INFO L85 PathProgramCache]: Analyzing trace with hash -189389286, now seen corresponding path program 1 times [2025-03-09 06:34:31,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:34:31,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461768820] [2025-03-09 06:34:31,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:34:31,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:34:31,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 06:34:31,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 06:34:31,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:34:31,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:34:31,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:34:31,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:34:31,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461768820] [2025-03-09 06:34:31,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461768820] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:34:31,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:34:31,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:34:31,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492679918] [2025-03-09 06:34:31,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:34:31,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:34:31,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:34:31,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:34:31,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:34:31,696 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 123 [2025-03-09 06:34:31,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 105 transitions, 257 flow. Second operand has 4 states, 4 states have (on average 50.75) internal successors, (203), 4 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:34:31,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:34:31,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 123 [2025-03-09 06:34:31,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:34:43,109 INFO L124 PetriNetUnfolderBase]: 122469/209052 cut-off events. [2025-03-09 06:34:43,110 INFO L125 PetriNetUnfolderBase]: For 8457/14064 co-relation queries the response was YES. [2025-03-09 06:34:43,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 386492 conditions, 209052 events. 122469/209052 cut-off events. For 8457/14064 co-relation queries the response was YES. Maximal size of possible extension queue 4990. Compared 2153998 event pairs, 40461 based on Foata normal form. 2848/193077 useless extension candidates. Maximal degree in co-relation 386385. Up to 90933 conditions per place. [2025-03-09 06:34:44,596 INFO L140 encePairwiseOnDemand]: 112/123 looper letters, 170 selfloop transitions, 18 changer transitions 0/238 dead transitions. [2025-03-09 06:34:44,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 238 transitions, 969 flow [2025-03-09 06:34:44,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 06:34:44,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 06:34:44,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 432 transitions. [2025-03-09 06:34:44,598 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7024390243902439 [2025-03-09 06:34:44,598 INFO L175 Difference]: Start difference. First operand has 112 places, 105 transitions, 257 flow. Second operand 5 states and 432 transitions. [2025-03-09 06:34:44,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 238 transitions, 969 flow [2025-03-09 06:34:44,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 238 transitions, 965 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:34:44,614 INFO L231 Difference]: Finished difference. Result has 119 places, 122 transitions, 395 flow [2025-03-09 06:34:44,614 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=395, PETRI_PLACES=119, PETRI_TRANSITIONS=122} [2025-03-09 06:34:44,615 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 12 predicate places. [2025-03-09 06:34:44,615 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 122 transitions, 395 flow [2025-03-09 06:34:44,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.75) internal successors, (203), 4 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:34:44,615 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:34:44,615 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 06:34:44,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 06:34:44,615 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-09 06:34:44,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:34:44,615 INFO L85 PathProgramCache]: Analyzing trace with hash -58964245, now seen corresponding path program 1 times [2025-03-09 06:34:44,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:34:44,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690635157] [2025-03-09 06:34:44,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:34:44,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:34:44,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 06:34:44,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 06:34:44,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:34:44,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:34:44,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:34:44,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:34:44,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690635157] [2025-03-09 06:34:44,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690635157] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:34:44,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:34:44,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 06:34:44,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036474722] [2025-03-09 06:34:44,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:34:44,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 06:34:44,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:34:44,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 06:34:44,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 06:34:44,704 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 123 [2025-03-09 06:34:44,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 122 transitions, 395 flow. Second operand has 6 states, 6 states have (on average 49.5) internal successors, (297), 6 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:34:44,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:34:44,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 123 [2025-03-09 06:34:44,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand