./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/goblint-regression/04-mutex_46-escape_nr.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/04-mutex_46-escape_nr.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 b71c523f20411078d17c9943b891d34ddfc00131917c4009fb579cdffacef23c --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 06:33:13,757 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 06:33:13,815 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 06:33:13,819 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 06:33:13,820 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 06:33:13,841 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 06:33:13,841 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 06:33:13,841 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 06:33:13,842 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 06:33:13,842 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 06:33:13,843 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 06:33:13,843 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 06:33:13,843 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 06:33:13,843 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 06:33:13,844 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 06:33:13,844 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 06:33:13,844 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 06:33:13,844 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 06:33:13,844 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 06:33:13,844 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 06:33:13,844 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 06:33:13,844 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 06:33:13,844 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 06:33:13,844 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 06:33:13,845 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 06:33:13,845 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 06:33:13,845 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 06:33:13,845 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 06:33:13,845 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 06:33:13,845 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 06:33:13,845 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 06:33:13,845 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 06:33:13,845 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 06:33:13,845 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 06:33:13,845 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 06:33:13,845 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 06:33:13,845 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 06:33:13,845 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 06:33:13,845 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 06:33:13,845 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 06:33:13,845 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 06:33:13,845 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 06:33:13,845 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 06:33:13,845 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 06:33:13,845 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 06:33:13,846 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 -> b71c523f20411078d17c9943b891d34ddfc00131917c4009fb579cdffacef23c [2025-03-09 06:33:14,088 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 06:33:14,097 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 06:33:14,101 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 06:33:14,103 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 06:33:14,103 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 06:33:14,104 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/04-mutex_46-escape_nr.i [2025-03-09 06:33:15,313 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fd9b3696/fbf5c063e5ce4f658b730d8a5d38f6e8/FLAG55913aad7 [2025-03-09 06:33:15,566 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 06:33:15,566 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/04-mutex_46-escape_nr.i [2025-03-09 06:33:15,579 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fd9b3696/fbf5c063e5ce4f658b730d8a5d38f6e8/FLAG55913aad7 [2025-03-09 06:33:15,589 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fd9b3696/fbf5c063e5ce4f658b730d8a5d38f6e8 [2025-03-09 06:33:15,591 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 06:33:15,592 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 06:33:15,593 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 06:33:15,593 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 06:33:15,596 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 06:33:15,597 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:33:15" (1/1) ... [2025-03-09 06:33:15,597 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a9287a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:33:15, skipping insertion in model container [2025-03-09 06:33:15,597 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:33:15" (1/1) ... [2025-03-09 06:33:15,631 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 06:33:15,976 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:33:15,996 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 06:33:16,031 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:33:16,080 INFO L204 MainTranslator]: Completed translation [2025-03-09 06:33:16,081 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:33:16 WrapperNode [2025-03-09 06:33:16,082 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 06:33:16,082 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 06:33:16,083 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 06:33:16,083 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 06:33:16,087 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:33:16" (1/1) ... [2025-03-09 06:33:16,097 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:33:16" (1/1) ... [2025-03-09 06:33:16,118 INFO L138 Inliner]: procedures = 264, calls = 23, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 106 [2025-03-09 06:33:16,118 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 06:33:16,118 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 06:33:16,118 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 06:33:16,119 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 06:33:16,126 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:33:16" (1/1) ... [2025-03-09 06:33:16,127 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:33:16" (1/1) ... [2025-03-09 06:33:16,130 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:33:16" (1/1) ... [2025-03-09 06:33:16,148 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [5, 6]. 55 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [5, 1]. The 2 writes are split as follows [0, 2]. [2025-03-09 06:33:16,148 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:33:16" (1/1) ... [2025-03-09 06:33:16,149 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:33:16" (1/1) ... [2025-03-09 06:33:16,152 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:33:16" (1/1) ... [2025-03-09 06:33:16,153 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:33:16" (1/1) ... [2025-03-09 06:33:16,154 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:33:16" (1/1) ... [2025-03-09 06:33:16,154 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:33:16" (1/1) ... [2025-03-09 06:33:16,156 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 06:33:16,157 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 06:33:16,157 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 06:33:16,157 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 06:33:16,158 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:33:16" (1/1) ... [2025-03-09 06:33:16,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 06:33:16,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:33:16,182 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:33:16,186 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:33:16,199 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 06:33:16,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 06:33:16,199 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-09 06:33:16,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 06:33:16,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 06:33:16,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 06:33:16,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 06:33:16,199 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-09 06:33:16,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 06:33:16,200 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-09 06:33:16,200 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-09 06:33:16,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 06:33:16,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 06:33:16,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 06:33:16,200 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 06:33:16,201 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:33:16,300 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 06:33:16,302 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 06:33:16,453 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L930: havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-03-09 06:33:16,454 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L930-1: SUMMARY for call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset); srcloc: null [2025-03-09 06:33:16,481 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 06:33:16,481 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 06:33:16,622 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 06:33:16,623 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 06:33:16,623 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:33:16 BoogieIcfgContainer [2025-03-09 06:33:16,624 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 06:33:16,626 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 06:33:16,626 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 06:33:16,630 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 06:33:16,630 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 06:33:15" (1/3) ... [2025-03-09 06:33:16,631 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@744c807d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:33:16, skipping insertion in model container [2025-03-09 06:33:16,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:33:16" (2/3) ... [2025-03-09 06:33:16,632 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@744c807d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:33:16, skipping insertion in model container [2025-03-09 06:33:16,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:33:16" (3/3) ... [2025-03-09 06:33:16,633 INFO L128 eAbstractionObserver]: Analyzing ICFG 04-mutex_46-escape_nr.i [2025-03-09 06:33:16,644 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 06:33:16,645 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 04-mutex_46-escape_nr.i that has 2 procedures, 26 locations, 1 initial locations, 0 loop locations, and 4 error locations. [2025-03-09 06:33:16,645 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 06:33:16,682 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-09 06:33:16,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 26 transitions, 59 flow [2025-03-09 06:33:16,738 INFO L124 PetriNetUnfolderBase]: 1/25 cut-off events. [2025-03-09 06:33:16,740 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-09 06:33:16,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 25 events. 1/25 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 34 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 1. Up to 2 conditions per place. [2025-03-09 06:33:16,743 INFO L82 GeneralOperation]: Start removeDead. Operand has 29 places, 26 transitions, 59 flow [2025-03-09 06:33:16,747 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 25 places, 21 transitions, 45 flow [2025-03-09 06:33:16,755 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 06:33:16,763 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;@4565540b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 06:33:16,764 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-09 06:33:16,771 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 06:33:16,772 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-03-09 06:33:16,772 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 06:33:16,772 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:33:16,772 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:33:16,773 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-09 06:33:16,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:33:16,780 INFO L85 PathProgramCache]: Analyzing trace with hash -486292886, now seen corresponding path program 1 times [2025-03-09 06:33:16,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:33:16,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102411617] [2025-03-09 06:33:16,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:33:16,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:33:16,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:33:16,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:33:16,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:33:16,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:33:17,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:33:17,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:33:17,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102411617] [2025-03-09 06:33:17,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102411617] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:33:17,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:33:17,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 06:33:17,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656867810] [2025-03-09 06:33:17,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:33:17,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 06:33:17,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:33:17,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 06:33:17,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-09 06:33:17,339 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 26 [2025-03-09 06:33:17,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 21 transitions, 45 flow. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:33:17,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:33:17,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 26 [2025-03-09 06:33:17,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:33:17,517 INFO L124 PetriNetUnfolderBase]: 40/117 cut-off events. [2025-03-09 06:33:17,518 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 06:33:17,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 117 events. 40/117 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 408 event pairs, 2 based on Foata normal form. 6/114 useless extension candidates. Maximal degree in co-relation 211. Up to 35 conditions per place. [2025-03-09 06:33:17,520 INFO L140 encePairwiseOnDemand]: 17/26 looper letters, 20 selfloop transitions, 10 changer transitions 7/42 dead transitions. [2025-03-09 06:33:17,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 42 transitions, 161 flow [2025-03-09 06:33:17,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 06:33:17,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 06:33:17,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 93 transitions. [2025-03-09 06:33:17,533 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3974358974358974 [2025-03-09 06:33:17,535 INFO L175 Difference]: Start difference. First operand has 25 places, 21 transitions, 45 flow. Second operand 9 states and 93 transitions. [2025-03-09 06:33:17,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 42 transitions, 161 flow [2025-03-09 06:33:17,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 160 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:33:17,541 INFO L231 Difference]: Finished difference. Result has 37 places, 26 transitions, 100 flow [2025-03-09 06:33:17,543 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=100, PETRI_PLACES=37, PETRI_TRANSITIONS=26} [2025-03-09 06:33:17,547 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 12 predicate places. [2025-03-09 06:33:17,547 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 26 transitions, 100 flow [2025-03-09 06:33:17,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:33:17,547 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:33:17,548 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:33:17,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 06:33:17,548 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-09 06:33:17,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:33:17,548 INFO L85 PathProgramCache]: Analyzing trace with hash -486495523, now seen corresponding path program 1 times [2025-03-09 06:33:17,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:33:17,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159185398] [2025-03-09 06:33:17,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:33:17,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:33:17,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:33:17,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:33:17,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:33:17,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:33:17,715 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:33:17,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:33:17,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159185398] [2025-03-09 06:33:17,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159185398] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:33:17,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:33:17,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:33:17,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028437203] [2025-03-09 06:33:17,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:33:17,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 06:33:17,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:33:17,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 06:33:17,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 06:33:17,726 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 26 [2025-03-09 06:33:17,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 26 transitions, 100 flow. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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:33:17,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:33:17,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 26 [2025-03-09 06:33:17,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:33:17,823 INFO L124 PetriNetUnfolderBase]: 41/135 cut-off events. [2025-03-09 06:33:17,823 INFO L125 PetriNetUnfolderBase]: For 70/70 co-relation queries the response was YES. [2025-03-09 06:33:17,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 319 conditions, 135 events. 41/135 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 513 event pairs, 17 based on Foata normal form. 7/142 useless extension candidates. Maximal degree in co-relation 300. Up to 44 conditions per place. [2025-03-09 06:33:17,824 INFO L140 encePairwiseOnDemand]: 19/26 looper letters, 22 selfloop transitions, 9 changer transitions 5/42 dead transitions. [2025-03-09 06:33:17,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 42 transitions, 224 flow [2025-03-09 06:33:17,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 06:33:17,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 06:33:17,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2025-03-09 06:33:17,825 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44871794871794873 [2025-03-09 06:33:17,826 INFO L175 Difference]: Start difference. First operand has 37 places, 26 transitions, 100 flow. Second operand 6 states and 70 transitions. [2025-03-09 06:33:17,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 42 transitions, 224 flow [2025-03-09 06:33:17,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 42 transitions, 220 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:33:17,827 INFO L231 Difference]: Finished difference. Result has 43 places, 29 transitions, 148 flow [2025-03-09 06:33:17,828 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=148, PETRI_PLACES=43, PETRI_TRANSITIONS=29} [2025-03-09 06:33:17,828 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 18 predicate places. [2025-03-09 06:33:17,828 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 29 transitions, 148 flow [2025-03-09 06:33:17,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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:33:17,828 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:33:17,828 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:33:17,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 06:33:17,829 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-09 06:33:17,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:33:17,829 INFO L85 PathProgramCache]: Analyzing trace with hash 2098508198, now seen corresponding path program 1 times [2025-03-09 06:33:17,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:33:17,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042040797] [2025-03-09 06:33:17,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:33:17,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:33:17,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:33:17,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:33:17,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:33:17,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:33:17,920 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:33:17,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:33:17,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042040797] [2025-03-09 06:33:17,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042040797] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:33:17,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:33:17,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:33:17,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405957436] [2025-03-09 06:33:17,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:33:17,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 06:33:17,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:33:17,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 06:33:17,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 06:33:17,928 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 26 [2025-03-09 06:33:17,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 29 transitions, 148 flow. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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:33:17,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:33:17,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 26 [2025-03-09 06:33:17,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:33:18,010 INFO L124 PetriNetUnfolderBase]: 26/98 cut-off events. [2025-03-09 06:33:18,010 INFO L125 PetriNetUnfolderBase]: For 136/138 co-relation queries the response was YES. [2025-03-09 06:33:18,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 277 conditions, 98 events. 26/98 cut-off events. For 136/138 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 342 event pairs, 11 based on Foata normal form. 9/107 useless extension candidates. Maximal degree in co-relation 253. Up to 41 conditions per place. [2025-03-09 06:33:18,011 INFO L140 encePairwiseOnDemand]: 19/26 looper letters, 21 selfloop transitions, 8 changer transitions 1/36 dead transitions. [2025-03-09 06:33:18,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 36 transitions, 228 flow [2025-03-09 06:33:18,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 06:33:18,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 06:33:18,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2025-03-09 06:33:18,015 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4230769230769231 [2025-03-09 06:33:18,016 INFO L175 Difference]: Start difference. First operand has 43 places, 29 transitions, 148 flow. Second operand 6 states and 66 transitions. [2025-03-09 06:33:18,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 36 transitions, 228 flow [2025-03-09 06:33:18,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 36 transitions, 223 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:33:18,020 INFO L231 Difference]: Finished difference. Result has 46 places, 27 transitions, 145 flow [2025-03-09 06:33:18,020 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=145, PETRI_PLACES=46, PETRI_TRANSITIONS=27} [2025-03-09 06:33:18,021 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 21 predicate places. [2025-03-09 06:33:18,022 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 27 transitions, 145 flow [2025-03-09 06:33:18,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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:33:18,022 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:33:18,022 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:33:18,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 06:33:18,022 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-09 06:33:18,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:33:18,024 INFO L85 PathProgramCache]: Analyzing trace with hash 2104789962, now seen corresponding path program 1 times [2025-03-09 06:33:18,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:33:18,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718836970] [2025-03-09 06:33:18,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:33:18,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:33:18,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:33:18,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:33:18,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:33:18,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:33:18,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:33:18,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:33:18,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718836970] [2025-03-09 06:33:18,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718836970] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:33:18,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:33:18,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 06:33:18,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810485694] [2025-03-09 06:33:18,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:33:18,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 06:33:18,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:33:18,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 06:33:18,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 06:33:18,156 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 26 [2025-03-09 06:33:18,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 27 transitions, 145 flow. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:33:18,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:33:18,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 26 [2025-03-09 06:33:18,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:33:18,277 INFO L124 PetriNetUnfolderBase]: 24/88 cut-off events. [2025-03-09 06:33:18,279 INFO L125 PetriNetUnfolderBase]: For 165/167 co-relation queries the response was YES. [2025-03-09 06:33:18,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 265 conditions, 88 events. 24/88 cut-off events. For 165/167 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 286 event pairs, 4 based on Foata normal form. 8/96 useless extension candidates. Maximal degree in co-relation 240. Up to 37 conditions per place. [2025-03-09 06:33:18,280 INFO L140 encePairwiseOnDemand]: 17/26 looper letters, 20 selfloop transitions, 9 changer transitions 2/36 dead transitions. [2025-03-09 06:33:18,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 36 transitions, 235 flow [2025-03-09 06:33:18,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 06:33:18,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 06:33:18,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2025-03-09 06:33:18,283 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3894230769230769 [2025-03-09 06:33:18,283 INFO L175 Difference]: Start difference. First operand has 46 places, 27 transitions, 145 flow. Second operand 8 states and 81 transitions. [2025-03-09 06:33:18,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 36 transitions, 235 flow [2025-03-09 06:33:18,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 36 transitions, 204 flow, removed 2 selfloop flow, removed 6 redundant places. [2025-03-09 06:33:18,285 INFO L231 Difference]: Finished difference. Result has 47 places, 25 transitions, 125 flow [2025-03-09 06:33:18,285 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=125, PETRI_PLACES=47, PETRI_TRANSITIONS=25} [2025-03-09 06:33:18,286 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 22 predicate places. [2025-03-09 06:33:18,286 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 25 transitions, 125 flow [2025-03-09 06:33:18,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:33:18,286 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:33:18,286 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:33:18,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 06:33:18,286 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-09 06:33:18,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:33:18,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1168353494, now seen corresponding path program 1 times [2025-03-09 06:33:18,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:33:18,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030553708] [2025-03-09 06:33:18,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:33:18,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:33:18,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 06:33:18,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 06:33:18,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:33:18,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:33:18,358 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:33:18,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:33:18,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030553708] [2025-03-09 06:33:18,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030553708] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:33:18,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:33:18,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:33:18,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128951208] [2025-03-09 06:33:18,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:33:18,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:33:18,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:33:18,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:33:18,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:33:18,359 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 26 [2025-03-09 06:33:18,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 25 transitions, 125 flow. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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:33:18,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:33:18,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 26 [2025-03-09 06:33:18,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:33:18,399 INFO L124 PetriNetUnfolderBase]: 12/57 cut-off events. [2025-03-09 06:33:18,400 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2025-03-09 06:33:18,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 57 events. 12/57 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 132 event pairs, 3 based on Foata normal form. 6/63 useless extension candidates. Maximal degree in co-relation 155. Up to 26 conditions per place. [2025-03-09 06:33:18,403 INFO L140 encePairwiseOnDemand]: 22/26 looper letters, 18 selfloop transitions, 4 changer transitions 0/29 dead transitions. [2025-03-09 06:33:18,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 29 transitions, 185 flow [2025-03-09 06:33:18,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:33:18,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:33:18,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2025-03-09 06:33:18,404 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5512820512820513 [2025-03-09 06:33:18,404 INFO L175 Difference]: Start difference. First operand has 47 places, 25 transitions, 125 flow. Second operand 3 states and 43 transitions. [2025-03-09 06:33:18,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 29 transitions, 185 flow [2025-03-09 06:33:18,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 29 transitions, 163 flow, removed 2 selfloop flow, removed 7 redundant places. [2025-03-09 06:33:18,405 INFO L231 Difference]: Finished difference. Result has 42 places, 25 transitions, 113 flow [2025-03-09 06:33:18,405 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=113, PETRI_PLACES=42, PETRI_TRANSITIONS=25} [2025-03-09 06:33:18,406 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 17 predicate places. [2025-03-09 06:33:18,406 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 25 transitions, 113 flow [2025-03-09 06:33:18,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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:33:18,406 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:33:18,406 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:33:18,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 06:33:18,409 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-09 06:33:18,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:33:18,409 INFO L85 PathProgramCache]: Analyzing trace with hash 899307193, now seen corresponding path program 1 times [2025-03-09 06:33:18,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:33:18,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335799696] [2025-03-09 06:33:18,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:33:18,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:33:18,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 06:33:18,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 06:33:18,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:33:18,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:33:18,540 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:33:18,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:33:18,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335799696] [2025-03-09 06:33:18,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335799696] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:33:18,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:33:18,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 06:33:18,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632061618] [2025-03-09 06:33:18,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:33:18,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 06:33:18,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:33:18,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 06:33:18,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-09 06:33:18,558 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-03-09 06:33:18,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 25 transitions, 113 flow. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 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:33:18,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:33:18,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-03-09 06:33:18,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:33:18,689 INFO L124 PetriNetUnfolderBase]: 15/68 cut-off events. [2025-03-09 06:33:18,689 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2025-03-09 06:33:18,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207 conditions, 68 events. 15/68 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 190 event pairs, 3 based on Foata normal form. 1/69 useless extension candidates. Maximal degree in co-relation 187. Up to 39 conditions per place. [2025-03-09 06:33:18,690 INFO L140 encePairwiseOnDemand]: 19/26 looper letters, 27 selfloop transitions, 7 changer transitions 0/36 dead transitions. [2025-03-09 06:33:18,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 36 transitions, 225 flow [2025-03-09 06:33:18,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 06:33:18,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 06:33:18,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2025-03-09 06:33:18,695 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2692307692307692 [2025-03-09 06:33:18,695 INFO L175 Difference]: Start difference. First operand has 42 places, 25 transitions, 113 flow. Second operand 8 states and 56 transitions. [2025-03-09 06:33:18,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 36 transitions, 225 flow [2025-03-09 06:33:18,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 36 transitions, 217 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:33:18,697 INFO L231 Difference]: Finished difference. Result has 52 places, 29 transitions, 161 flow [2025-03-09 06:33:18,697 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=161, PETRI_PLACES=52, PETRI_TRANSITIONS=29} [2025-03-09 06:33:18,697 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 27 predicate places. [2025-03-09 06:33:18,697 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 29 transitions, 161 flow [2025-03-09 06:33:18,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 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:33:18,697 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:33:18,697 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:33:18,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 06:33:18,698 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-09 06:33:18,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:33:18,698 INFO L85 PathProgramCache]: Analyzing trace with hash -676343945, now seen corresponding path program 2 times [2025-03-09 06:33:18,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:33:18,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103658667] [2025-03-09 06:33:18,698 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:33:18,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:33:18,719 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-09 06:33:18,724 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 13 statements. [2025-03-09 06:33:18,724 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:33:18,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:33:18,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 06:33:18,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:33:18,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103658667] [2025-03-09 06:33:18,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103658667] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:33:18,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:33:18,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 06:33:18,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621979147] [2025-03-09 06:33:18,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:33:18,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 06:33:18,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:33:18,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 06:33:18,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-09 06:33:18,861 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-03-09 06:33:18,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 29 transitions, 161 flow. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 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:33:18,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:33:18,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-03-09 06:33:18,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:33:18,976 INFO L124 PetriNetUnfolderBase]: 14/73 cut-off events. [2025-03-09 06:33:18,976 INFO L125 PetriNetUnfolderBase]: For 96/96 co-relation queries the response was YES. [2025-03-09 06:33:18,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 244 conditions, 73 events. 14/73 cut-off events. For 96/96 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 227 event pairs, 12 based on Foata normal form. 1/74 useless extension candidates. Maximal degree in co-relation 218. Up to 47 conditions per place. [2025-03-09 06:33:18,977 INFO L140 encePairwiseOnDemand]: 19/26 looper letters, 23 selfloop transitions, 10 changer transitions 0/35 dead transitions. [2025-03-09 06:33:18,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 35 transitions, 257 flow [2025-03-09 06:33:18,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 06:33:18,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 06:33:18,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 51 transitions. [2025-03-09 06:33:18,978 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.24519230769230768 [2025-03-09 06:33:18,978 INFO L175 Difference]: Start difference. First operand has 52 places, 29 transitions, 161 flow. Second operand 8 states and 51 transitions. [2025-03-09 06:33:18,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 35 transitions, 257 flow [2025-03-09 06:33:18,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 35 transitions, 250 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-09 06:33:18,981 INFO L231 Difference]: Finished difference. Result has 61 places, 32 transitions, 219 flow [2025-03-09 06:33:18,981 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=219, PETRI_PLACES=61, PETRI_TRANSITIONS=32} [2025-03-09 06:33:18,982 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 36 predicate places. [2025-03-09 06:33:18,982 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 32 transitions, 219 flow [2025-03-09 06:33:18,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 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:33:18,982 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:33:18,982 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:33:18,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 06:33:18,982 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-09 06:33:18,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:33:18,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1224728594, now seen corresponding path program 1 times [2025-03-09 06:33:18,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:33:18,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423549672] [2025-03-09 06:33:18,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:33:18,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:33:19,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 06:33:19,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 06:33:19,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:33:19,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:33:19,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:33:19,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:33:19,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423549672] [2025-03-09 06:33:19,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423549672] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:33:19,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330712571] [2025-03-09 06:33:19,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:33:19,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:33:19,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:33:19,252 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:33:19,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 06:33:19,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 06:33:19,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 06:33:19,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:33:19,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:33:19,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-09 06:33:19,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:33:19,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 06:33:19,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-09 06:33:19,481 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 06:33:19,481 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:33:19,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1330712571] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:33:19,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:33:19,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2025-03-09 06:33:19,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642209172] [2025-03-09 06:33:19,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:33:19,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 06:33:19,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:33:19,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 06:33:19,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-09 06:33:19,493 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-03-09 06:33:19,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 32 transitions, 219 flow. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 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:33:19,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:33:19,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-03-09 06:33:19,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:33:19,605 INFO L124 PetriNetUnfolderBase]: 13/69 cut-off events. [2025-03-09 06:33:19,606 INFO L125 PetriNetUnfolderBase]: For 127/127 co-relation queries the response was YES. [2025-03-09 06:33:19,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 69 events. 13/69 cut-off events. For 127/127 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 205 event pairs, 1 based on Foata normal form. 3/72 useless extension candidates. Maximal degree in co-relation 233. Up to 30 conditions per place. [2025-03-09 06:33:19,608 INFO L140 encePairwiseOnDemand]: 17/26 looper letters, 17 selfloop transitions, 17 changer transitions 0/37 dead transitions. [2025-03-09 06:33:19,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 37 transitions, 302 flow [2025-03-09 06:33:19,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 06:33:19,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 06:33:19,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 51 transitions. [2025-03-09 06:33:19,609 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.24519230769230768 [2025-03-09 06:33:19,609 INFO L175 Difference]: Start difference. First operand has 61 places, 32 transitions, 219 flow. Second operand 8 states and 51 transitions. [2025-03-09 06:33:19,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 37 transitions, 302 flow [2025-03-09 06:33:19,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 37 transitions, 281 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-03-09 06:33:19,610 INFO L231 Difference]: Finished difference. Result has 58 places, 32 transitions, 235 flow [2025-03-09 06:33:19,611 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=235, PETRI_PLACES=58, PETRI_TRANSITIONS=32} [2025-03-09 06:33:19,611 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 33 predicate places. [2025-03-09 06:33:19,611 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 32 transitions, 235 flow [2025-03-09 06:33:19,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 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:33:19,611 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:33:19,611 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:33:19,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 06:33:19,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:33:19,812 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-09 06:33:19,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:33:19,812 INFO L85 PathProgramCache]: Analyzing trace with hash -583184215, now seen corresponding path program 1 times [2025-03-09 06:33:19,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:33:19,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528139014] [2025-03-09 06:33:19,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:33:19,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:33:19,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 06:33:19,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 06:33:19,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:33:19,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:33:19,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:33:19,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:33:19,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528139014] [2025-03-09 06:33:19,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528139014] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:33:19,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131469993] [2025-03-09 06:33:19,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:33:19,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:33:19,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:33:19,991 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:33:19,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 06:33:20,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 06:33:20,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 06:33:20,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:33:20,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:33:20,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-09 06:33:20,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:33:20,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-09 06:33:20,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-09 06:33:20,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:33:20,160 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:33:20,276 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:33:20,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1131469993] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-09 06:33:20,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-09 06:33:20,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 13 [2025-03-09 06:33:20,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364395951] [2025-03-09 06:33:20,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:33:20,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 06:33:20,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:33:20,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 06:33:20,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2025-03-09 06:33:20,303 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 26 [2025-03-09 06:33:20,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 32 transitions, 235 flow. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 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:33:20,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:33:20,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 26 [2025-03-09 06:33:20,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:33:20,527 INFO L124 PetriNetUnfolderBase]: 11/75 cut-off events. [2025-03-09 06:33:20,527 INFO L125 PetriNetUnfolderBase]: For 185/185 co-relation queries the response was YES. [2025-03-09 06:33:20,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 285 conditions, 75 events. 11/75 cut-off events. For 185/185 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 263 event pairs, 4 based on Foata normal form. 1/76 useless extension candidates. Maximal degree in co-relation 258. Up to 37 conditions per place. [2025-03-09 06:33:20,529 INFO L140 encePairwiseOnDemand]: 17/26 looper letters, 21 selfloop transitions, 11 changer transitions 6/42 dead transitions. [2025-03-09 06:33:20,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 42 transitions, 355 flow [2025-03-09 06:33:20,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 06:33:20,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-09 06:33:20,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 72 transitions. [2025-03-09 06:33:20,530 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.27692307692307694 [2025-03-09 06:33:20,530 INFO L175 Difference]: Start difference. First operand has 58 places, 32 transitions, 235 flow. Second operand 10 states and 72 transitions. [2025-03-09 06:33:20,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 42 transitions, 355 flow [2025-03-09 06:33:20,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 42 transitions, 332 flow, removed 1 selfloop flow, removed 5 redundant places. [2025-03-09 06:33:20,532 INFO L231 Difference]: Finished difference. Result has 64 places, 31 transitions, 234 flow [2025-03-09 06:33:20,532 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=234, PETRI_PLACES=64, PETRI_TRANSITIONS=31} [2025-03-09 06:33:20,533 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 39 predicate places. [2025-03-09 06:33:20,533 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 31 transitions, 234 flow [2025-03-09 06:33:20,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 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:33:20,534 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:33:20,534 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:33:20,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 06:33:20,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-09 06:33:20,735 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-09 06:33:20,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:33:20,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1700812009, now seen corresponding path program 1 times [2025-03-09 06:33:20,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:33:20,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903049130] [2025-03-09 06:33:20,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:33:20,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:33:20,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 06:33:20,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 06:33:20,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:33:20,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:33:20,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:33:20,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:33:20,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903049130] [2025-03-09 06:33:20,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903049130] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:33:20,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124806868] [2025-03-09 06:33:20,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:33:20,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:33:20,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:33:20,920 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:33:20,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 06:33:20,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 06:33:21,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 06:33:21,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:33:21,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:33:21,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-09 06:33:21,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:33:21,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-09 06:33:21,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-09 06:33:21,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:33:21,112 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:33:21,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:33:21,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124806868] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-09 06:33:21,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-09 06:33:21,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 13 [2025-03-09 06:33:21,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782540849] [2025-03-09 06:33:21,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:33:21,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 06:33:21,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:33:21,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 06:33:21,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2025-03-09 06:33:21,256 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 26 [2025-03-09 06:33:21,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 31 transitions, 234 flow. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 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:33:21,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:33:21,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 26 [2025-03-09 06:33:21,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:33:21,350 INFO L124 PetriNetUnfolderBase]: 10/64 cut-off events. [2025-03-09 06:33:21,351 INFO L125 PetriNetUnfolderBase]: For 156/156 co-relation queries the response was YES. [2025-03-09 06:33:21,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 252 conditions, 64 events. 10/64 cut-off events. For 156/156 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 189 event pairs, 5 based on Foata normal form. 2/66 useless extension candidates. Maximal degree in co-relation 229. Up to 19 conditions per place. [2025-03-09 06:33:21,352 INFO L140 encePairwiseOnDemand]: 19/26 looper letters, 14 selfloop transitions, 6 changer transitions 11/35 dead transitions. [2025-03-09 06:33:21,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 35 transitions, 304 flow [2025-03-09 06:33:21,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 06:33:21,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 06:33:21,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 57 transitions. [2025-03-09 06:33:21,353 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.27403846153846156 [2025-03-09 06:33:21,353 INFO L175 Difference]: Start difference. First operand has 64 places, 31 transitions, 234 flow. Second operand 8 states and 57 transitions. [2025-03-09 06:33:21,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 35 transitions, 304 flow [2025-03-09 06:33:21,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 35 transitions, 271 flow, removed 2 selfloop flow, removed 10 redundant places. [2025-03-09 06:33:21,354 INFO L231 Difference]: Finished difference. Result has 56 places, 24 transitions, 177 flow [2025-03-09 06:33:21,354 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=177, PETRI_PLACES=56, PETRI_TRANSITIONS=24} [2025-03-09 06:33:21,355 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 31 predicate places. [2025-03-09 06:33:21,355 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 24 transitions, 177 flow [2025-03-09 06:33:21,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 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:33:21,355 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:33:21,355 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:33:21,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-09 06:33:21,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:33:21,556 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-09 06:33:21,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:33:21,556 INFO L85 PathProgramCache]: Analyzing trace with hash 508174429, now seen corresponding path program 2 times [2025-03-09 06:33:21,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:33:21,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997229161] [2025-03-09 06:33:21,556 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:33:21,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:33:21,569 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-09 06:33:21,581 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 06:33:21,581 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:33:21,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:33:21,724 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:33:21,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:33:21,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997229161] [2025-03-09 06:33:21,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997229161] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:33:21,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662883562] [2025-03-09 06:33:21,725 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:33:21,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:33:21,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:33:21,727 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:33:21,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 06:33:21,798 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-09 06:33:21,818 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 06:33:21,818 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:33:21,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:33:21,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-09 06:33:21,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:33:21,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-09 06:33:21,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-09 06:33:21,898 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:33:21,898 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:33:21,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:33:21,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662883562] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-09 06:33:21,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-09 06:33:21,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 14 [2025-03-09 06:33:21,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255981361] [2025-03-09 06:33:21,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:33:21,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 06:33:21,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:33:21,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 06:33:21,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2025-03-09 06:33:22,039 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 26 [2025-03-09 06:33:22,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 24 transitions, 177 flow. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 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:33:22,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:33:22,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 26 [2025-03-09 06:33:22,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:33:22,181 INFO L124 PetriNetUnfolderBase]: 1/32 cut-off events. [2025-03-09 06:33:22,181 INFO L125 PetriNetUnfolderBase]: For 85/85 co-relation queries the response was YES. [2025-03-09 06:33:22,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 32 events. 1/32 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 60 event pairs, 1 based on Foata normal form. 2/34 useless extension candidates. Maximal degree in co-relation 108. Up to 9 conditions per place. [2025-03-09 06:33:22,182 INFO L140 encePairwiseOnDemand]: 18/26 looper letters, 7 selfloop transitions, 5 changer transitions 9/24 dead transitions. [2025-03-09 06:33:22,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 24 transitions, 205 flow [2025-03-09 06:33:22,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 06:33:22,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 06:33:22,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 54 transitions. [2025-03-09 06:33:22,185 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.23076923076923078 [2025-03-09 06:33:22,185 INFO L175 Difference]: Start difference. First operand has 56 places, 24 transitions, 177 flow. Second operand 9 states and 54 transitions. [2025-03-09 06:33:22,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 24 transitions, 205 flow [2025-03-09 06:33:22,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 24 transitions, 151 flow, removed 1 selfloop flow, removed 13 redundant places. [2025-03-09 06:33:22,186 INFO L231 Difference]: Finished difference. Result has 44 places, 15 transitions, 72 flow [2025-03-09 06:33:22,186 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=72, PETRI_PLACES=44, PETRI_TRANSITIONS=15} [2025-03-09 06:33:22,187 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 19 predicate places. [2025-03-09 06:33:22,187 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 15 transitions, 72 flow [2025-03-09 06:33:22,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 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:33:22,187 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:33:22,187 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:33:22,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-09 06:33:22,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:33:22,387 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-09 06:33:22,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:33:22,388 INFO L85 PathProgramCache]: Analyzing trace with hash -432627699, now seen corresponding path program 3 times [2025-03-09 06:33:22,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:33:22,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692977703] [2025-03-09 06:33:22,388 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:33:22,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:33:22,400 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 2 equivalence classes. [2025-03-09 06:33:22,409 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 06:33:22,409 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 06:33:22,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:33:22,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:33:22,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:33:22,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692977703] [2025-03-09 06:33:22,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692977703] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:33:22,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154798345] [2025-03-09 06:33:22,533 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:33:22,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:33:22,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:33:22,535 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:33:22,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 06:33:22,612 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 2 equivalence classes. [2025-03-09 06:33:22,632 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 06:33:22,632 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 06:33:22,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:33:22,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-09 06:33:22,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:33:22,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-09 06:33:22,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-09 06:33:22,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:33:22,701 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:33:22,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:33:22,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154798345] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-09 06:33:22,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-09 06:33:22,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 12 [2025-03-09 06:33:22,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018242976] [2025-03-09 06:33:22,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:33:22,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 06:33:22,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:33:22,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 06:33:22,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-03-09 06:33:22,820 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 26 [2025-03-09 06:33:22,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 15 transitions, 72 flow. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 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:33:22,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:33:22,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 26 [2025-03-09 06:33:22,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:33:22,913 INFO L124 PetriNetUnfolderBase]: 1/16 cut-off events. [2025-03-09 06:33:22,913 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-09 06:33:22,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 16 events. 1/16 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 6 event pairs, 0 based on Foata normal form. 1/17 useless extension candidates. Maximal degree in co-relation 46. Up to 4 conditions per place. [2025-03-09 06:33:22,914 INFO L140 encePairwiseOnDemand]: 18/26 looper letters, 0 selfloop transitions, 0 changer transitions 15/15 dead transitions. [2025-03-09 06:33:22,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 15 transitions, 91 flow [2025-03-09 06:33:22,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 06:33:22,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 06:33:22,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 49 transitions. [2025-03-09 06:33:22,914 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2094017094017094 [2025-03-09 06:33:22,914 INFO L175 Difference]: Start difference. First operand has 44 places, 15 transitions, 72 flow. Second operand 9 states and 49 transitions. [2025-03-09 06:33:22,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 15 transitions, 91 flow [2025-03-09 06:33:22,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 15 transitions, 67 flow, removed 3 selfloop flow, removed 11 redundant places. [2025-03-09 06:33:22,915 INFO L231 Difference]: Finished difference. Result has 28 places, 0 transitions, 0 flow [2025-03-09 06:33:22,915 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=0, PETRI_PLACES=28, PETRI_TRANSITIONS=0} [2025-03-09 06:33:22,916 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 3 predicate places. [2025-03-09 06:33:22,916 INFO L471 AbstractCegarLoop]: Abstraction has has 28 places, 0 transitions, 0 flow [2025-03-09 06:33:22,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 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:33:22,918 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 7 remaining) [2025-03-09 06:33:22,918 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 7 remaining) [2025-03-09 06:33:22,918 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-03-09 06:33:22,918 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 7 remaining) [2025-03-09 06:33:22,918 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 7 remaining) [2025-03-09 06:33:22,918 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 7 remaining) [2025-03-09 06:33:22,918 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 7 remaining) [2025-03-09 06:33:22,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-09 06:33:23,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-09 06:33:23,119 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:33:23,123 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-09 06:33:23,123 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 06:33:23,126 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 06:33:23 BasicIcfg [2025-03-09 06:33:23,126 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 06:33:23,127 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 06:33:23,127 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 06:33:23,127 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 06:33:23,127 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:33:16" (3/4) ... [2025-03-09 06:33:23,128 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-09 06:33:23,130 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t_fun [2025-03-09 06:33:23,133 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 54 nodes and edges [2025-03-09 06:33:23,133 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2025-03-09 06:33:23,133 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-03-09 06:33:23,133 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-09 06:33:23,136 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-09 06:33:23,137 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-09 06:33:23,212 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 06:33:23,212 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 06:33:23,212 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 06:33:23,214 INFO L158 Benchmark]: Toolchain (without parser) took 7620.90ms. Allocated memory is still 167.8MB. Free memory was 121.9MB in the beginning and 45.4MB in the end (delta: 76.5MB). Peak memory consumption was 75.0MB. Max. memory is 16.1GB. [2025-03-09 06:33:23,214 INFO L158 Benchmark]: CDTParser took 1.13ms. Allocated memory is still 201.3MB. Free memory is still 117.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:33:23,214 INFO L158 Benchmark]: CACSL2BoogieTranslator took 488.93ms. Allocated memory is still 167.8MB. Free memory was 121.9MB in the beginning and 94.2MB in the end (delta: 27.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-09 06:33:23,214 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.60ms. Allocated memory is still 167.8MB. Free memory was 94.2MB in the beginning and 92.2MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 06:33:23,214 INFO L158 Benchmark]: Boogie Preprocessor took 37.61ms. Allocated memory is still 167.8MB. Free memory was 92.2MB in the beginning and 90.3MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:33:23,215 INFO L158 Benchmark]: IcfgBuilder took 467.62ms. Allocated memory is still 167.8MB. Free memory was 90.3MB in the beginning and 51.3MB in the end (delta: 39.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-09 06:33:23,215 INFO L158 Benchmark]: TraceAbstraction took 6499.92ms. Allocated memory is still 167.8MB. Free memory was 51.3MB in the beginning and 52.5MB in the end (delta: -1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:33:23,216 INFO L158 Benchmark]: Witness Printer took 85.94ms. Allocated memory is still 167.8MB. Free memory was 52.5MB in the beginning and 45.4MB in the end (delta: 7.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:33:23,217 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.13ms. Allocated memory is still 201.3MB. Free memory is still 117.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 488.93ms. Allocated memory is still 167.8MB. Free memory was 121.9MB in the beginning and 94.2MB in the end (delta: 27.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.60ms. Allocated memory is still 167.8MB. Free memory was 94.2MB in the beginning and 92.2MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.61ms. Allocated memory is still 167.8MB. Free memory was 92.2MB in the beginning and 90.3MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 467.62ms. Allocated memory is still 167.8MB. Free memory was 90.3MB in the beginning and 51.3MB in the end (delta: 39.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 6499.92ms. Allocated memory is still 167.8MB. Free memory was 51.3MB in the beginning and 52.5MB in the end (delta: -1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 85.94ms. Allocated memory is still 167.8MB. Free memory was 52.5MB in the beginning and 45.4MB in the end (delta: 7.1MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 936]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 936]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 924]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 924]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 37 locations, 37 edges, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.4s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 446 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 386 mSDsluCounter, 505 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 436 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1240 IncrementalHoareTripleChecker+Invalid, 1282 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 69 mSDtfsCounter, 1240 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 220 GetRequests, 83 SyntacticMatches, 10 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=235occurred in iteration=8, InterpolantAutomatonStates: 92, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 206 NumberOfCodeBlocks, 205 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 241 ConstructedInterpolants, 16 QuantifiedInterpolants, 2403 SizeOfPredicates, 54 NumberOfNonLiveVariables, 799 ConjunctsInSsa, 104 ConjunctsInUnsatCore, 21 InterpolantComputations, 12 PerfectInterpolantSequences, 6/15 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-09 06:33:23,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE