./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_42-trylock2_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_42-trylock2_racefree.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 844ba080c7d33529db727776ee230d62edb7b62a6350a8061572438c458d73d3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:46:49,411 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:46:49,458 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 06:46:49,463 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:46:49,467 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:46:49,491 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:46:49,494 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:46:49,494 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:46:49,495 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:46:49,495 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:46:49,495 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:46:49,496 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:46:49,496 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:46:49,496 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:46:49,496 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:46:49,497 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:46:49,497 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:46:49,497 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:46:49,497 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:46:49,497 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:46:49,497 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:46:49,497 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:46:49,498 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:46:49,498 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:46:49,498 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:46:49,498 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:46:49,498 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:46:49,498 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:46:49,498 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:46:49,498 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:46:49,498 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:46:49,498 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:46:49,498 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:46:49,498 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:46:49,498 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:46:49,499 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:46:49,499 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:46:49,499 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:46:49,499 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:46:49,499 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:46:49,499 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:46:49,500 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:46:49,500 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:46:49,500 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:46:49,500 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:46:49,500 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:46:49,500 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:46:49,500 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:46:49,500 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:46:49,500 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:46:49,500 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 844ba080c7d33529db727776ee230d62edb7b62a6350a8061572438c458d73d3 [2025-01-10 06:46:49,741 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:46:49,749 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:46:49,753 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:46:49,754 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:46:49,754 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:46:49,757 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_42-trylock2_racefree.i [2025-01-10 06:46:50,967 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/66c4e6496/e63b2df72ef443a5b46cd0d7533534ec/FLAGf1ebf005e [2025-01-10 06:46:51,344 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:46:51,345 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_42-trylock2_racefree.i [2025-01-10 06:46:51,356 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/66c4e6496/e63b2df72ef443a5b46cd0d7533534ec/FLAGf1ebf005e [2025-01-10 06:46:51,566 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/66c4e6496/e63b2df72ef443a5b46cd0d7533534ec [2025-01-10 06:46:51,567 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:46:51,569 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:46:51,570 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:46:51,570 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:46:51,573 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:46:51,574 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:46:51" (1/1) ... [2025-01-10 06:46:51,574 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ff09b43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:46:51, skipping insertion in model container [2025-01-10 06:46:51,574 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:46:51" (1/1) ... [2025-01-10 06:46:51,600 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:46:51,817 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:46:51,832 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:46:51,890 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:46:51,926 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:46:51,928 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:46:51 WrapperNode [2025-01-10 06:46:51,929 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:46:51,930 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:46:51,930 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:46:51,931 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:46:51,936 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:46:51" (1/1) ... [2025-01-10 06:46:51,951 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:46:51" (1/1) ... [2025-01-10 06:46:51,973 INFO L138 Inliner]: procedures = 172, calls = 61, calls flagged for inlining = 7, calls inlined = 10, statements flattened = 150 [2025-01-10 06:46:51,975 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:46:51,976 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:46:51,976 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:46:51,976 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:46:51,982 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:46:51" (1/1) ... [2025-01-10 06:46:51,982 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:46:51" (1/1) ... [2025-01-10 06:46:51,986 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:46:51" (1/1) ... [2025-01-10 06:46:51,996 INFO L175 MemorySlicer]: Split 19 memory accesses to 5 slices as follows [2, 5, 5, 5, 2]. 26 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 5, 5, 5, 0]. The 1 writes are split as follows [0, 0, 0, 0, 1]. [2025-01-10 06:46:51,996 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:46:51" (1/1) ... [2025-01-10 06:46:51,996 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:46:51" (1/1) ... [2025-01-10 06:46:52,001 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:46:51" (1/1) ... [2025-01-10 06:46:52,002 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:46:51" (1/1) ... [2025-01-10 06:46:52,004 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:46:51" (1/1) ... [2025-01-10 06:46:52,006 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:46:51" (1/1) ... [2025-01-10 06:46:52,006 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:46:51" (1/1) ... [2025-01-10 06:46:52,008 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:46:52,009 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:46:52,009 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:46:52,009 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:46:52,009 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:46:51" (1/1) ... [2025-01-10 06:46:52,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:46:52,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:46:52,034 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 06:46:52,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 06:46:52,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 06:46:52,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 06:46:52,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 06:46:52,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-10 06:46:52,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-10 06:46:52,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 06:46:52,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 06:46:52,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 06:46:52,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-10 06:46:52,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-10 06:46:52,061 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-10 06:46:52,061 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:46:52,062 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 06:46:52,062 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-10 06:46:52,062 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-10 06:46:52,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 06:46:52,063 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexTryLock [2025-01-10 06:46:52,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:46:52,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 06:46:52,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 06:46:52,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-10 06:46:52,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-10 06:46:52,063 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-10 06:46:52,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:46:52,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:46:52,065 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 06:46:52,217 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:46:52,218 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:46:52,541 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 06:46:52,541 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:46:52,749 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:46:52,751 INFO L312 CfgBuilder]: Removed 11 assume(true) statements. [2025-01-10 06:46:52,751 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:46:52 BoogieIcfgContainer [2025-01-10 06:46:52,751 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:46:52,753 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:46:52,753 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:46:52,757 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:46:52,757 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:46:51" (1/3) ... [2025-01-10 06:46:52,759 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a51d131 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:46:52, skipping insertion in model container [2025-01-10 06:46:52,759 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:46:51" (2/3) ... [2025-01-10 06:46:52,759 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a51d131 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:46:52, skipping insertion in model container [2025-01-10 06:46:52,759 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:46:52" (3/3) ... [2025-01-10 06:46:52,760 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_42-trylock2_racefree.i [2025-01-10 06:46:52,770 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:46:52,771 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_42-trylock2_racefree.i that has 2 procedures, 98 locations, 1 initial locations, 13 loop locations, and 12 error locations. [2025-01-10 06:46:52,771 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 06:46:52,809 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-01-10 06:46:52,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 121 transitions, 249 flow [2025-01-10 06:46:52,911 INFO L124 PetriNetUnfolderBase]: 33/167 cut-off events. [2025-01-10 06:46:52,915 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 06:46:52,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 167 events. 33/167 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 683 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 112. Up to 6 conditions per place. [2025-01-10 06:46:52,921 INFO L82 GeneralOperation]: Start removeDead. Operand has 101 places, 121 transitions, 249 flow [2025-01-10 06:46:52,928 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 101 places, 120 transitions, 247 flow [2025-01-10 06:46:52,941 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:46:52,952 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;@71383634, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:46:52,954 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2025-01-10 06:46:52,961 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:46:52,964 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-01-10 06:46:52,964 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:46:52,964 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:46:52,965 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:46:52,965 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-01-10 06:46:52,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:46:52,970 INFO L85 PathProgramCache]: Analyzing trace with hash 626498358, now seen corresponding path program 1 times [2025-01-10 06:46:52,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:46:52,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783298662] [2025-01-10 06:46:52,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:46:52,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:46:53,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:46:53,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:46:53,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:46:53,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:46:53,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:46:53,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:46:53,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783298662] [2025-01-10 06:46:53,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783298662] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:46:53,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:46:53,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:46:53,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890892839] [2025-01-10 06:46:53,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:46:53,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:46:53,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:46:53,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:46:53,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:46:53,259 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 121 [2025-01-10 06:46:53,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 120 transitions, 247 flow. Second operand has 4 states, 4 states have (on average 47.25) internal successors, (189), 4 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:46:53,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:46:53,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 121 [2025-01-10 06:46:53,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:46:53,607 INFO L124 PetriNetUnfolderBase]: 589/1526 cut-off events. [2025-01-10 06:46:53,607 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 06:46:53,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2718 conditions, 1526 events. 589/1526 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 9504 event pairs, 0 based on Foata normal form. 334/1789 useless extension candidates. Maximal degree in co-relation 2678. Up to 1120 conditions per place. [2025-01-10 06:46:53,620 INFO L140 encePairwiseOnDemand]: 94/121 looper letters, 91 selfloop transitions, 3 changer transitions 0/140 dead transitions. [2025-01-10 06:46:53,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 140 transitions, 475 flow [2025-01-10 06:46:53,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:46:53,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:46:53,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 326 transitions. [2025-01-10 06:46:53,629 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6735537190082644 [2025-01-10 06:46:53,630 INFO L175 Difference]: Start difference. First operand has 101 places, 120 transitions, 247 flow. Second operand 4 states and 326 transitions. [2025-01-10 06:46:53,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 140 transitions, 475 flow [2025-01-10 06:46:53,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 140 transitions, 475 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:46:53,640 INFO L231 Difference]: Finished difference. Result has 103 places, 97 transitions, 211 flow [2025-01-10 06:46:53,642 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=211, PETRI_PLACES=103, PETRI_TRANSITIONS=97} [2025-01-10 06:46:53,644 INFO L279 CegarLoopForPetriNet]: 101 programPoint places, 2 predicate places. [2025-01-10 06:46:53,644 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 97 transitions, 211 flow [2025-01-10 06:46:53,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.25) internal successors, (189), 4 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:46:53,644 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:46:53,644 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-01-10 06:46:53,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:46:53,645 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-01-10 06:46:53,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:46:53,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1914599702, now seen corresponding path program 1 times [2025-01-10 06:46:53,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:46:53,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069727835] [2025-01-10 06:46:53,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:46:53,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:46:53,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:46:53,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:46:53,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:46:53,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:46:53,680 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:46:53,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:46:53,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:46:53,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:46:53,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:46:53,713 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:46:53,713 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 06:46:53,714 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 21 remaining) [2025-01-10 06:46:53,718 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 21 remaining) [2025-01-10 06:46:53,719 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 21 remaining) [2025-01-10 06:46:53,719 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 21 remaining) [2025-01-10 06:46:53,719 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 21 remaining) [2025-01-10 06:46:53,719 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 21 remaining) [2025-01-10 06:46:53,719 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 21 remaining) [2025-01-10 06:46:53,719 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 21 remaining) [2025-01-10 06:46:53,719 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 21 remaining) [2025-01-10 06:46:53,719 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 21 remaining) [2025-01-10 06:46:53,719 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 21 remaining) [2025-01-10 06:46:53,719 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 21 remaining) [2025-01-10 06:46:53,719 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 21 remaining) [2025-01-10 06:46:53,719 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 21 remaining) [2025-01-10 06:46:53,719 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 21 remaining) [2025-01-10 06:46:53,719 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 21 remaining) [2025-01-10 06:46:53,719 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 21 remaining) [2025-01-10 06:46:53,719 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 21 remaining) [2025-01-10 06:46:53,719 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 21 remaining) [2025-01-10 06:46:53,719 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 21 remaining) [2025-01-10 06:46:53,719 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 21 remaining) [2025-01-10 06:46:53,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 06:46:53,720 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-10 06:46:53,721 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 06:46:53,721 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-10 06:46:53,752 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-10 06:46:53,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 184 transitions, 384 flow [2025-01-10 06:46:53,783 INFO L124 PetriNetUnfolderBase]: 57/295 cut-off events. [2025-01-10 06:46:53,784 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-10 06:46:53,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 307 conditions, 295 events. 57/295 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1417 event pairs, 0 based on Foata normal form. 0/208 useless extension candidates. Maximal degree in co-relation 182. Up to 9 conditions per place. [2025-01-10 06:46:53,785 INFO L82 GeneralOperation]: Start removeDead. Operand has 153 places, 184 transitions, 384 flow [2025-01-10 06:46:53,788 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 153 places, 184 transitions, 384 flow [2025-01-10 06:46:53,789 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:46:53,789 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;@71383634, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:46:53,790 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2025-01-10 06:46:53,792 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:46:53,793 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-01-10 06:46:53,793 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:46:53,793 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:46:53,793 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:46:53,793 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2025-01-10 06:46:53,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:46:53,793 INFO L85 PathProgramCache]: Analyzing trace with hash 802149099, now seen corresponding path program 1 times [2025-01-10 06:46:53,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:46:53,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397244371] [2025-01-10 06:46:53,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:46:53,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:46:53,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:46:53,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:46:53,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:46:53,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:46:53,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:46:53,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:46:53,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397244371] [2025-01-10 06:46:53,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397244371] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:46:53,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:46:53,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:46:53,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020385878] [2025-01-10 06:46:53,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:46:53,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:46:53,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:46:53,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:46:53,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:46:53,900 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 184 [2025-01-10 06:46:53,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 184 transitions, 384 flow. Second operand has 4 states, 4 states have (on average 75.25) internal successors, (301), 4 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:46:53,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:46:53,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 184 [2025-01-10 06:46:53,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:46:58,779 INFO L124 PetriNetUnfolderBase]: 28423/59919 cut-off events. [2025-01-10 06:46:58,780 INFO L125 PetriNetUnfolderBase]: For 127/127 co-relation queries the response was YES. [2025-01-10 06:46:58,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103660 conditions, 59919 events. 28423/59919 cut-off events. For 127/127 co-relation queries the response was YES. Maximal size of possible extension queue 948. Compared 610750 event pairs, 21714 based on Foata normal form. 12694/67776 useless extension candidates. Maximal degree in co-relation 45518. Up to 43557 conditions per place. [2025-01-10 06:46:59,109 INFO L140 encePairwiseOnDemand]: 145/184 looper letters, 119 selfloop transitions, 3 changer transitions 0/196 dead transitions. [2025-01-10 06:46:59,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 196 transitions, 652 flow [2025-01-10 06:46:59,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:46:59,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:46:59,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 478 transitions. [2025-01-10 06:46:59,116 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6494565217391305 [2025-01-10 06:46:59,116 INFO L175 Difference]: Start difference. First operand has 153 places, 184 transitions, 384 flow. Second operand 4 states and 478 transitions. [2025-01-10 06:46:59,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 196 transitions, 652 flow [2025-01-10 06:46:59,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 196 transitions, 652 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:46:59,123 INFO L231 Difference]: Finished difference. Result has 158 places, 153 transitions, 342 flow [2025-01-10 06:46:59,123 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=184, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=342, PETRI_PLACES=158, PETRI_TRANSITIONS=153} [2025-01-10 06:46:59,123 INFO L279 CegarLoopForPetriNet]: 153 programPoint places, 5 predicate places. [2025-01-10 06:46:59,124 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 153 transitions, 342 flow [2025-01-10 06:46:59,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.25) internal successors, (301), 4 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:46:59,125 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:46:59,125 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:46:59,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:46:59,125 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2025-01-10 06:46:59,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:46:59,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1338319610, now seen corresponding path program 1 times [2025-01-10 06:46:59,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:46:59,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181410664] [2025-01-10 06:46:59,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:46:59,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:46:59,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:46:59,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:46:59,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:46:59,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:46:59,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:46:59,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:46:59,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181410664] [2025-01-10 06:46:59,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181410664] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:46:59,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:46:59,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:46:59,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6450812] [2025-01-10 06:46:59,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:46:59,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:46:59,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:46:59,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:46:59,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:46:59,237 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 184 [2025-01-10 06:46:59,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 153 transitions, 342 flow. Second operand has 4 states, 4 states have (on average 76.75) internal successors, (307), 4 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:46:59,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:46:59,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 184 [2025-01-10 06:46:59,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:47:06,844 INFO L124 PetriNetUnfolderBase]: 49861/100493 cut-off events. [2025-01-10 06:47:06,845 INFO L125 PetriNetUnfolderBase]: For 1286/2368 co-relation queries the response was YES. [2025-01-10 06:47:07,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177891 conditions, 100493 events. 49861/100493 cut-off events. For 1286/2368 co-relation queries the response was YES. Maximal size of possible extension queue 1664. Compared 1079103 event pairs, 12342 based on Foata normal form. 1024/95082 useless extension candidates. Maximal degree in co-relation 177716. Up to 42027 conditions per place. [2025-01-10 06:47:07,413 INFO L140 encePairwiseOnDemand]: 173/184 looper letters, 234 selfloop transitions, 16 changer transitions 0/326 dead transitions. [2025-01-10 06:47:07,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 326 transitions, 1228 flow [2025-01-10 06:47:07,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:47:07,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:47:07,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 626 transitions. [2025-01-10 06:47:07,416 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6804347826086956 [2025-01-10 06:47:07,416 INFO L175 Difference]: Start difference. First operand has 158 places, 153 transitions, 342 flow. Second operand 5 states and 626 transitions. [2025-01-10 06:47:07,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 326 transitions, 1228 flow [2025-01-10 06:47:07,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 326 transitions, 1224 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:47:07,426 INFO L231 Difference]: Finished difference. Result has 165 places, 168 transitions, 466 flow [2025-01-10 06:47:07,427 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=184, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=466, PETRI_PLACES=165, PETRI_TRANSITIONS=168} [2025-01-10 06:47:07,427 INFO L279 CegarLoopForPetriNet]: 153 programPoint places, 12 predicate places. [2025-01-10 06:47:07,428 INFO L471 AbstractCegarLoop]: Abstraction has has 165 places, 168 transitions, 466 flow [2025-01-10 06:47:07,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 76.75) internal successors, (307), 4 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:47:07,428 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:47:07,429 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 06:47:07,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 06:47:07,429 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2025-01-10 06:47:07,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:47:07,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1979929924, now seen corresponding path program 1 times [2025-01-10 06:47:07,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:47:07,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400262395] [2025-01-10 06:47:07,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:47:07,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:47:07,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:47:07,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:47:07,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:47:07,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:47:07,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:47:07,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:47:07,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400262395] [2025-01-10 06:47:07,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400262395] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:47:07,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:47:07,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:47:07,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896258000] [2025-01-10 06:47:07,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:47:07,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:47:07,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:47:07,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:47:07,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:47:07,535 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 184 [2025-01-10 06:47:07,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 168 transitions, 466 flow. Second operand has 6 states, 6 states have (on average 75.5) internal successors, (453), 6 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:47:07,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:47:07,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 184 [2025-01-10 06:47:07,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:47:14,872 INFO L124 PetriNetUnfolderBase]: 49354/101214 cut-off events. [2025-01-10 06:47:14,872 INFO L125 PetriNetUnfolderBase]: For 21694/21725 co-relation queries the response was YES. [2025-01-10 06:47:15,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195766 conditions, 101214 events. 49354/101214 cut-off events. For 21694/21725 co-relation queries the response was YES. Maximal size of possible extension queue 1652. Compared 1096887 event pairs, 27229 based on Foata normal form. 512/95030 useless extension candidates. Maximal degree in co-relation 107297. Up to 68781 conditions per place. [2025-01-10 06:47:15,403 INFO L140 encePairwiseOnDemand]: 179/184 looper letters, 224 selfloop transitions, 6 changer transitions 0/304 dead transitions. [2025-01-10 06:47:15,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 304 transitions, 1280 flow [2025-01-10 06:47:15,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:47:15,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:47:15,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 650 transitions. [2025-01-10 06:47:15,406 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5887681159420289 [2025-01-10 06:47:15,406 INFO L175 Difference]: Start difference. First operand has 165 places, 168 transitions, 466 flow. Second operand 6 states and 650 transitions. [2025-01-10 06:47:15,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 304 transitions, 1280 flow [2025-01-10 06:47:15,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 304 transitions, 1280 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:47:15,425 INFO L231 Difference]: Finished difference. Result has 169 places, 167 transitions, 474 flow [2025-01-10 06:47:15,425 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=184, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=474, PETRI_PLACES=169, PETRI_TRANSITIONS=167} [2025-01-10 06:47:15,426 INFO L279 CegarLoopForPetriNet]: 153 programPoint places, 16 predicate places. [2025-01-10 06:47:15,426 INFO L471 AbstractCegarLoop]: Abstraction has has 169 places, 167 transitions, 474 flow [2025-01-10 06:47:15,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 75.5) internal successors, (453), 6 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:47:15,426 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:47:15,426 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-01-10 06:47:15,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:47:15,426 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2025-01-10 06:47:15,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:47:15,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1248286373, now seen corresponding path program 1 times [2025-01-10 06:47:15,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:47:15,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943942049] [2025-01-10 06:47:15,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:47:15,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:47:15,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:47:15,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:47:15,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:47:15,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:47:15,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:47:15,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:47:15,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943942049] [2025-01-10 06:47:15,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943942049] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:47:15,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:47:15,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:47:15,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836074274] [2025-01-10 06:47:15,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:47:15,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:47:15,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:47:15,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:47:15,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:47:15,503 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 184 [2025-01-10 06:47:15,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 167 transitions, 474 flow. Second operand has 4 states, 4 states have (on average 76.25) internal successors, (305), 4 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:47:15,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:47:15,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 184 [2025-01-10 06:47:15,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:47:22,957 INFO L124 PetriNetUnfolderBase]: 48065/97546 cut-off events. [2025-01-10 06:47:22,958 INFO L125 PetriNetUnfolderBase]: For 22851/22879 co-relation queries the response was YES. [2025-01-10 06:47:23,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 191263 conditions, 97546 events. 48065/97546 cut-off events. For 22851/22879 co-relation queries the response was YES. Maximal size of possible extension queue 1600. Compared 1046452 event pairs, 16099 based on Foata normal form. 512/92729 useless extension candidates. Maximal degree in co-relation 147120. Up to 69961 conditions per place. [2025-01-10 06:47:23,520 INFO L140 encePairwiseOnDemand]: 179/184 looper letters, 181 selfloop transitions, 6 changer transitions 0/261 dead transitions. [2025-01-10 06:47:23,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 261 transitions, 1098 flow [2025-01-10 06:47:23,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:47:23,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:47:23,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 457 transitions. [2025-01-10 06:47:23,525 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6209239130434783 [2025-01-10 06:47:23,526 INFO L175 Difference]: Start difference. First operand has 169 places, 167 transitions, 474 flow. Second operand 4 states and 457 transitions. [2025-01-10 06:47:23,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 261 transitions, 1098 flow [2025-01-10 06:47:23,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 261 transitions, 1082 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-01-10 06:47:23,551 INFO L231 Difference]: Finished difference. Result has 167 places, 167 transitions, 474 flow [2025-01-10 06:47:23,551 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=184, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=474, PETRI_PLACES=167, PETRI_TRANSITIONS=167} [2025-01-10 06:47:23,552 INFO L279 CegarLoopForPetriNet]: 153 programPoint places, 14 predicate places. [2025-01-10 06:47:23,552 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 167 transitions, 474 flow [2025-01-10 06:47:23,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 76.25) internal successors, (305), 4 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:47:23,552 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:47:23,553 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1] [2025-01-10 06:47:23,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:47:23,553 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2025-01-10 06:47:23,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:47:23,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1307358225, now seen corresponding path program 1 times [2025-01-10 06:47:23,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:47:23,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894136008] [2025-01-10 06:47:23,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:47:23,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:47:23,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:47:23,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:47:23,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:47:23,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:47:23,583 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:47:23,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:47:23,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:47:23,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:47:23,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:47:23,607 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:47:23,610 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 06:47:23,610 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 29 remaining) [2025-01-10 06:47:23,610 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 29 remaining) [2025-01-10 06:47:23,610 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 29 remaining) [2025-01-10 06:47:23,610 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 29 remaining) [2025-01-10 06:47:23,610 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 29 remaining) [2025-01-10 06:47:23,610 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 29 remaining) [2025-01-10 06:47:23,611 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 29 remaining) [2025-01-10 06:47:23,611 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 29 remaining) [2025-01-10 06:47:23,611 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 29 remaining) [2025-01-10 06:47:23,611 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 29 remaining) [2025-01-10 06:47:23,611 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 29 remaining) [2025-01-10 06:47:23,611 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 29 remaining) [2025-01-10 06:47:23,611 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 29 remaining) [2025-01-10 06:47:23,611 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 29 remaining) [2025-01-10 06:47:23,611 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 29 remaining) [2025-01-10 06:47:23,611 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 29 remaining) [2025-01-10 06:47:23,611 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 29 remaining) [2025-01-10 06:47:23,612 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 29 remaining) [2025-01-10 06:47:23,612 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 29 remaining) [2025-01-10 06:47:23,612 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 29 remaining) [2025-01-10 06:47:23,612 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 29 remaining) [2025-01-10 06:47:23,612 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 29 remaining) [2025-01-10 06:47:23,612 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 29 remaining) [2025-01-10 06:47:23,612 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 29 remaining) [2025-01-10 06:47:23,612 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 29 remaining) [2025-01-10 06:47:23,612 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 29 remaining) [2025-01-10 06:47:23,612 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 29 remaining) [2025-01-10 06:47:23,612 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 29 remaining) [2025-01-10 06:47:23,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 29 remaining) [2025-01-10 06:47:23,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 06:47:23,613 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-01-10 06:47:23,613 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 06:47:23,616 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-10 06:47:23,661 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-10 06:47:23,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 205 places, 247 transitions, 521 flow [2025-01-10 06:47:23,726 INFO L124 PetriNetUnfolderBase]: 84/442 cut-off events. [2025-01-10 06:47:23,726 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-01-10 06:47:23,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 467 conditions, 442 events. 84/442 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2265 event pairs, 1 based on Foata normal form. 0/310 useless extension candidates. Maximal degree in co-relation 310. Up to 12 conditions per place. [2025-01-10 06:47:23,732 INFO L82 GeneralOperation]: Start removeDead. Operand has 205 places, 247 transitions, 521 flow [2025-01-10 06:47:23,737 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 205 places, 247 transitions, 521 flow [2025-01-10 06:47:23,738 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:47:23,738 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;@71383634, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:47:23,739 INFO L334 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2025-01-10 06:47:23,741 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:47:23,742 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-01-10 06:47:23,742 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:47:23,742 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:47:23,743 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:47:23,743 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2025-01-10 06:47:23,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:47:23,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1037921055, now seen corresponding path program 1 times [2025-01-10 06:47:23,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:47:23,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942230304] [2025-01-10 06:47:23,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:47:23,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:47:23,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:47:23,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:47:23,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:47:23,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:47:23,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:47:23,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:47:23,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942230304] [2025-01-10 06:47:23,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942230304] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:47:23,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:47:23,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:47:23,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867453331] [2025-01-10 06:47:23,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:47:23,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:47:23,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:47:23,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:47:23,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:47:23,810 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 247 [2025-01-10 06:47:23,810 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 247 transitions, 521 flow. Second operand has 4 states, 4 states have (on average 103.25) internal successors, (413), 4 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:47:23,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:47:23,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 247 [2025-01-10 06:47:23,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand