./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/goblint-regression/36-apron_21-traces-cluster-based_true.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/36-apron_21-traces-cluster-based_true.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cec155e54548239c459fec40910e358deb5fad2ceffa658bfdeefddd1bc9e166 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 01:11:04,058 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 01:11:04,131 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-08 01:11:04,136 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 01:11:04,140 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 01:11:04,161 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 01:11:04,162 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 01:11:04,162 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 01:11:04,162 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 01:11:04,163 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 01:11:04,163 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 01:11:04,163 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 01:11:04,164 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 01:11:04,164 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 01:11:04,164 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 01:11:04,164 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 01:11:04,164 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 01:11:04,165 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 01:11:04,165 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 01:11:04,165 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 01:11:04,165 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 01:11:04,165 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 01:11:04,165 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 01:11:04,166 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 01:11:04,166 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 01:11:04,166 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 01:11:04,166 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 01:11:04,166 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 01:11:04,166 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 01:11:04,166 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 01:11:04,166 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 01:11:04,166 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 01:11:04,166 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:11:04,167 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 01:11:04,167 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 01:11:04,167 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 01:11:04,167 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 01:11:04,167 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 01:11:04,167 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 01:11:04,167 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 01:11:04,167 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 01:11:04,167 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 01:11:04,167 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 01:11:04,167 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) 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 -> cec155e54548239c459fec40910e358deb5fad2ceffa658bfdeefddd1bc9e166 [2025-02-08 01:11:04,400 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 01:11:04,409 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 01:11:04,411 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 01:11:04,411 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 01:11:04,411 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 01:11:04,412 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/36-apron_21-traces-cluster-based_true.i [2025-02-08 01:11:05,549 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fec8be536/d679915e852246f0a2272b9028f8710e/FLAGdd4fd157d [2025-02-08 01:11:05,869 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 01:11:05,870 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/36-apron_21-traces-cluster-based_true.i [2025-02-08 01:11:05,879 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fec8be536/d679915e852246f0a2272b9028f8710e/FLAGdd4fd157d [2025-02-08 01:11:05,890 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fec8be536/d679915e852246f0a2272b9028f8710e [2025-02-08 01:11:05,892 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 01:11:05,893 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 01:11:05,894 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 01:11:05,894 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 01:11:05,897 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 01:11:05,898 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:11:05" (1/1) ... [2025-02-08 01:11:05,898 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52796820 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:11:05, skipping insertion in model container [2025-02-08 01:11:05,899 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:11:05" (1/1) ... [2025-02-08 01:11:05,918 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 01:11:06,047 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/36-apron_21-traces-cluster-based_true.i[1092,1105] [2025-02-08 01:11:06,145 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:11:06,160 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 01:11:06,167 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/36-apron_21-traces-cluster-based_true.i[1092,1105] [2025-02-08 01:11:06,198 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:11:06,235 INFO L204 MainTranslator]: Completed translation [2025-02-08 01:11:06,236 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:11:06 WrapperNode [2025-02-08 01:11:06,236 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 01:11:06,237 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 01:11:06,237 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 01:11:06,237 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 01:11:06,242 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:11:06" (1/1) ... [2025-02-08 01:11:06,251 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:11:06" (1/1) ... [2025-02-08 01:11:06,268 INFO L138 Inliner]: procedures = 165, calls = 41, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 137 [2025-02-08 01:11:06,269 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 01:11:06,269 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 01:11:06,269 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 01:11:06,269 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 01:11:06,275 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:11:06" (1/1) ... [2025-02-08 01:11:06,275 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:11:06" (1/1) ... [2025-02-08 01:11:06,277 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:11:06" (1/1) ... [2025-02-08 01:11:06,294 INFO L175 MemorySlicer]: Split 12 memory accesses to 3 slices as follows [2, 5, 5]. 42 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 5, 5]. The 0 writes are split as follows [0, 0, 0]. [2025-02-08 01:11:06,294 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:11:06" (1/1) ... [2025-02-08 01:11:06,294 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:11:06" (1/1) ... [2025-02-08 01:11:06,298 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:11:06" (1/1) ... [2025-02-08 01:11:06,299 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:11:06" (1/1) ... [2025-02-08 01:11:06,299 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:11:06" (1/1) ... [2025-02-08 01:11:06,300 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:11:06" (1/1) ... [2025-02-08 01:11:06,306 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 01:11:06,306 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 01:11:06,306 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 01:11:06,307 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 01:11:06,307 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:11:06" (1/1) ... [2025-02-08 01:11:06,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:11:06,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:11:06,332 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 01:11:06,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 01:11:06,352 INFO L130 BoogieDeclarations]: Found specification of procedure t2_fun [2025-02-08 01:11:06,352 INFO L138 BoogieDeclarations]: Found implementation of procedure t2_fun [2025-02-08 01:11:06,352 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 01:11:06,352 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 01:11:06,352 INFO L130 BoogieDeclarations]: Found specification of procedure t3_fun [2025-02-08 01:11:06,352 INFO L138 BoogieDeclarations]: Found implementation of procedure t3_fun [2025-02-08 01:11:06,352 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-08 01:11:06,353 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-08 01:11:06,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 01:11:06,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 01:11:06,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 01:11:06,353 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 01:11:06,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 01:11:06,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 01:11:06,354 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 01:11:06,442 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 01:11:06,443 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 01:11:06,821 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 01:11:06,821 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 01:11:06,955 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 01:11:06,955 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 01:11:06,955 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:11:06 BoogieIcfgContainer [2025-02-08 01:11:06,955 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 01:11:06,957 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 01:11:06,957 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 01:11:06,960 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 01:11:06,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:11:05" (1/3) ... [2025-02-08 01:11:06,961 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eaf688d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:11:06, skipping insertion in model container [2025-02-08 01:11:06,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:11:06" (2/3) ... [2025-02-08 01:11:06,961 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eaf688d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:11:06, skipping insertion in model container [2025-02-08 01:11:06,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:11:06" (3/3) ... [2025-02-08 01:11:06,962 INFO L128 eAbstractionObserver]: Analyzing ICFG 36-apron_21-traces-cluster-based_true.i [2025-02-08 01:11:06,974 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 01:11:06,976 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 36-apron_21-traces-cluster-based_true.i that has 4 procedures, 64 locations, 1 initial locations, 0 loop locations, and 4 error locations. [2025-02-08 01:11:06,976 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 01:11:07,023 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 01:11:07,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 68 transitions, 148 flow [2025-02-08 01:11:07,152 INFO L124 PetriNetUnfolderBase]: 5/65 cut-off events. [2025-02-08 01:11:07,156 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 01:11:07,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 65 events. 5/65 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 155 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2025-02-08 01:11:07,164 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 68 transitions, 148 flow [2025-02-08 01:11:07,171 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 70 places, 65 transitions, 139 flow [2025-02-08 01:11:07,192 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 01:11:07,213 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;@1e9ff454, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 01:11:07,219 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-02-08 01:11:07,240 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 01:11:07,241 INFO L124 PetriNetUnfolderBase]: 1/32 cut-off events. [2025-02-08 01:11:07,241 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 01:11:07,241 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:11:07,242 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:11:07,246 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2025-02-08 01:11:07,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:11:07,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1405505236, now seen corresponding path program 1 times [2025-02-08 01:11:07,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:11:07,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021044993] [2025-02-08 01:11:07,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:11:07,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:11:07,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 01:11:07,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 01:11:07,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:11:07,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:11:07,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:11:07,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:11:07,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021044993] [2025-02-08 01:11:07,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021044993] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:11:07,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:11:07,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 01:11:07,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399481149] [2025-02-08 01:11:07,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:11:07,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:11:07,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:11:07,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:11:07,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:11:07,768 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 68 [2025-02-08 01:11:07,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 65 transitions, 139 flow. Second operand has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 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-02-08 01:11:07,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:11:07,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 68 [2025-02-08 01:11:07,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:11:11,262 INFO L124 PetriNetUnfolderBase]: 30713/46966 cut-off events. [2025-02-08 01:11:11,263 INFO L125 PetriNetUnfolderBase]: For 126/126 co-relation queries the response was YES. [2025-02-08 01:11:11,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90095 conditions, 46966 events. 30713/46966 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 1224. Compared 351185 event pairs, 7163 based on Foata normal form. 3860/49784 useless extension candidates. Maximal degree in co-relation 90084. Up to 11332 conditions per place. [2025-02-08 01:11:11,531 INFO L140 encePairwiseOnDemand]: 57/68 looper letters, 190 selfloop transitions, 11 changer transitions 0/220 dead transitions. [2025-02-08 01:11:11,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 220 transitions, 872 flow [2025-02-08 01:11:11,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:11:11,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:11:11,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 401 transitions. [2025-02-08 01:11:11,548 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7371323529411765 [2025-02-08 01:11:11,549 INFO L175 Difference]: Start difference. First operand has 70 places, 65 transitions, 139 flow. Second operand 8 states and 401 transitions. [2025-02-08 01:11:11,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 220 transitions, 872 flow [2025-02-08 01:11:11,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 220 transitions, 862 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 01:11:11,560 INFO L231 Difference]: Finished difference. Result has 78 places, 69 transitions, 189 flow [2025-02-08 01:11:11,562 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=189, PETRI_PLACES=78, PETRI_TRANSITIONS=69} [2025-02-08 01:11:11,565 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 8 predicate places. [2025-02-08 01:11:11,565 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 69 transitions, 189 flow [2025-02-08 01:11:11,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 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-02-08 01:11:11,566 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:11:11,566 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:11:11,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 01:11:11,567 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2025-02-08 01:11:11,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:11:11,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1150174283, now seen corresponding path program 1 times [2025-02-08 01:11:11,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:11:11,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263907955] [2025-02-08 01:11:11,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:11:11,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:11:11,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 01:11:11,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 01:11:11,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:11:11,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:11:11,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:11:11,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:11:11,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263907955] [2025-02-08 01:11:11,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263907955] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:11:11,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:11:11,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 01:11:11,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606026676] [2025-02-08 01:11:11,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:11:11,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:11:11,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:11:11,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:11:11,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:11:11,728 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 68 [2025-02-08 01:11:11,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 69 transitions, 189 flow. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 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-02-08 01:11:11,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:11:11,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 68 [2025-02-08 01:11:11,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:11:15,613 INFO L124 PetriNetUnfolderBase]: 46522/71671 cut-off events. [2025-02-08 01:11:15,614 INFO L125 PetriNetUnfolderBase]: For 13700/13700 co-relation queries the response was YES. [2025-02-08 01:11:15,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153092 conditions, 71671 events. 46522/71671 cut-off events. For 13700/13700 co-relation queries the response was YES. Maximal size of possible extension queue 2019. Compared 570087 event pairs, 9900 based on Foata normal form. 0/70263 useless extension candidates. Maximal degree in co-relation 153078. Up to 27642 conditions per place. [2025-02-08 01:11:16,170 INFO L140 encePairwiseOnDemand]: 57/68 looper letters, 193 selfloop transitions, 17 changer transitions 0/228 dead transitions. [2025-02-08 01:11:16,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 228 transitions, 1054 flow [2025-02-08 01:11:16,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:11:16,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:11:16,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 346 transitions. [2025-02-08 01:11:16,174 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6360294117647058 [2025-02-08 01:11:16,174 INFO L175 Difference]: Start difference. First operand has 78 places, 69 transitions, 189 flow. Second operand 8 states and 346 transitions. [2025-02-08 01:11:16,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 228 transitions, 1054 flow [2025-02-08 01:11:16,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 228 transitions, 1054 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 01:11:16,537 INFO L231 Difference]: Finished difference. Result has 89 places, 82 transitions, 288 flow [2025-02-08 01:11:16,538 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=288, PETRI_PLACES=89, PETRI_TRANSITIONS=82} [2025-02-08 01:11:16,538 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 19 predicate places. [2025-02-08 01:11:16,538 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 82 transitions, 288 flow [2025-02-08 01:11:16,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 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-02-08 01:11:16,539 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:11:16,539 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:11:16,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 01:11:16,540 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2025-02-08 01:11:16,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:11:16,540 INFO L85 PathProgramCache]: Analyzing trace with hash 542189724, now seen corresponding path program 1 times [2025-02-08 01:11:16,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:11:16,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492446448] [2025-02-08 01:11:16,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:11:16,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:11:16,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 01:11:16,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 01:11:16,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:11:16,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:11:16,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:11:16,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:11:16,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492446448] [2025-02-08 01:11:16,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492446448] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:11:16,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:11:16,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 01:11:16,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642270657] [2025-02-08 01:11:16,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:11:16,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:11:16,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:11:16,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:11:16,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:11:16,682 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 68 [2025-02-08 01:11:16,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 82 transitions, 288 flow. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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-02-08 01:11:16,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:11:16,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 68 [2025-02-08 01:11:16,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:11:22,743 INFO L124 PetriNetUnfolderBase]: 60127/97639 cut-off events. [2025-02-08 01:11:22,744 INFO L125 PetriNetUnfolderBase]: For 38504/38959 co-relation queries the response was YES. [2025-02-08 01:11:23,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 226000 conditions, 97639 events. 60127/97639 cut-off events. For 38504/38959 co-relation queries the response was YES. Maximal size of possible extension queue 2969. Compared 870801 event pairs, 20848 based on Foata normal form. 0/96306 useless extension candidates. Maximal degree in co-relation 225980. Up to 41717 conditions per place. [2025-02-08 01:11:23,587 INFO L140 encePairwiseOnDemand]: 61/68 looper letters, 215 selfloop transitions, 17 changer transitions 3/257 dead transitions. [2025-02-08 01:11:23,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 257 transitions, 1362 flow [2025-02-08 01:11:23,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:11:23,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:11:23,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 363 transitions. [2025-02-08 01:11:23,589 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6672794117647058 [2025-02-08 01:11:23,589 INFO L175 Difference]: Start difference. First operand has 89 places, 82 transitions, 288 flow. Second operand 8 states and 363 transitions. [2025-02-08 01:11:23,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 257 transitions, 1362 flow [2025-02-08 01:11:26,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 257 transitions, 1362 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 01:11:26,325 INFO L231 Difference]: Finished difference. Result has 100 places, 94 transitions, 397 flow [2025-02-08 01:11:26,325 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=397, PETRI_PLACES=100, PETRI_TRANSITIONS=94} [2025-02-08 01:11:26,326 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 30 predicate places. [2025-02-08 01:11:26,326 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 94 transitions, 397 flow [2025-02-08 01:11:26,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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-02-08 01:11:26,326 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:11:26,326 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:11:26,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 01:11:26,327 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2025-02-08 01:11:26,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:11:26,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1954088489, now seen corresponding path program 1 times [2025-02-08 01:11:26,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:11:26,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673318955] [2025-02-08 01:11:26,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:11:26,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:11:26,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 01:11:26,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 01:11:26,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:11:26,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:11:26,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:11:26,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:11:26,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673318955] [2025-02-08 01:11:26,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673318955] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:11:26,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:11:26,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 01:11:26,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658683282] [2025-02-08 01:11:26,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:11:26,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 01:11:26,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:11:26,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 01:11:26,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 01:11:26,439 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 68 [2025-02-08 01:11:26,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 94 transitions, 397 flow. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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-02-08 01:11:26,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:11:26,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 68 [2025-02-08 01:11:26,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:11:30,913 INFO L124 PetriNetUnfolderBase]: 38911/67038 cut-off events. [2025-02-08 01:11:30,913 INFO L125 PetriNetUnfolderBase]: For 41276/42478 co-relation queries the response was YES. [2025-02-08 01:11:31,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169995 conditions, 67038 events. 38911/67038 cut-off events. For 41276/42478 co-relation queries the response was YES. Maximal size of possible extension queue 2475. Compared 634266 event pairs, 13965 based on Foata normal form. 3031/69927 useless extension candidates. Maximal degree in co-relation 169969. Up to 34535 conditions per place. [2025-02-08 01:11:31,328 INFO L140 encePairwiseOnDemand]: 55/68 looper letters, 118 selfloop transitions, 13 changer transitions 0/156 dead transitions. [2025-02-08 01:11:31,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 156 transitions, 942 flow [2025-02-08 01:11:31,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 01:11:31,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 01:11:31,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2025-02-08 01:11:31,329 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7352941176470589 [2025-02-08 01:11:31,330 INFO L175 Difference]: Start difference. First operand has 100 places, 94 transitions, 397 flow. Second operand 3 states and 150 transitions. [2025-02-08 01:11:31,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 156 transitions, 942 flow [2025-02-08 01:11:33,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 156 transitions, 942 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 01:11:33,341 INFO L231 Difference]: Finished difference. Result has 103 places, 102 transitions, 468 flow [2025-02-08 01:11:33,342 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=397, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=468, PETRI_PLACES=103, PETRI_TRANSITIONS=102} [2025-02-08 01:11:33,342 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 33 predicate places. [2025-02-08 01:11:33,343 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 102 transitions, 468 flow [2025-02-08 01:11:33,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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-02-08 01:11:33,343 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:11:33,343 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:11:33,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 01:11:33,343 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2025-02-08 01:11:33,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:11:33,344 INFO L85 PathProgramCache]: Analyzing trace with hash 729981587, now seen corresponding path program 1 times [2025-02-08 01:11:33,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:11:33,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178873146] [2025-02-08 01:11:33,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:11:33,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:11:33,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 01:11:33,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 01:11:33,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:11:33,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:11:33,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:11:33,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:11:33,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178873146] [2025-02-08 01:11:33,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178873146] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:11:33,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:11:33,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 01:11:33,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51434249] [2025-02-08 01:11:33,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:11:33,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:11:33,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:11:33,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:11:33,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:11:33,537 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 68 [2025-02-08 01:11:33,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 102 transitions, 468 flow. Second operand has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 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-02-08 01:11:33,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:11:33,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 68 [2025-02-08 01:11:33,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:11:35,982 INFO L124 PetriNetUnfolderBase]: 20387/36627 cut-off events. [2025-02-08 01:11:35,982 INFO L125 PetriNetUnfolderBase]: For 30812/31812 co-relation queries the response was YES. [2025-02-08 01:11:36,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103013 conditions, 36627 events. 20387/36627 cut-off events. For 30812/31812 co-relation queries the response was YES. Maximal size of possible extension queue 1167. Compared 327687 event pairs, 5653 based on Foata normal form. 1395/37913 useless extension candidates. Maximal degree in co-relation 102985. Up to 18926 conditions per place. [2025-02-08 01:11:36,166 INFO L140 encePairwiseOnDemand]: 61/68 looper letters, 104 selfloop transitions, 10 changer transitions 0/139 dead transitions. [2025-02-08 01:11:36,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 139 transitions, 853 flow [2025-02-08 01:11:36,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 01:11:36,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 01:11:36,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 160 transitions. [2025-02-08 01:11:36,168 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5882352941176471 [2025-02-08 01:11:36,168 INFO L175 Difference]: Start difference. First operand has 103 places, 102 transitions, 468 flow. Second operand 4 states and 160 transitions. [2025-02-08 01:11:36,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 139 transitions, 853 flow [2025-02-08 01:11:36,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 139 transitions, 836 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 01:11:36,826 INFO L231 Difference]: Finished difference. Result has 105 places, 102 transitions, 475 flow [2025-02-08 01:11:36,827 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=455, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=475, PETRI_PLACES=105, PETRI_TRANSITIONS=102} [2025-02-08 01:11:36,828 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 35 predicate places. [2025-02-08 01:11:36,828 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 102 transitions, 475 flow [2025-02-08 01:11:36,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 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-02-08 01:11:36,828 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:11:36,828 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:11:36,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 01:11:36,828 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2025-02-08 01:11:36,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:11:36,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1543023114, now seen corresponding path program 1 times [2025-02-08 01:11:36,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:11:36,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885955838] [2025-02-08 01:11:36,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:11:36,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:11:36,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 01:11:36,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 01:11:36,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:11:36,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:11:36,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:11:36,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:11:36,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885955838] [2025-02-08 01:11:36,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885955838] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:11:36,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:11:36,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 01:11:36,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041944153] [2025-02-08 01:11:36,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:11:36,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:11:36,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:11:36,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:11:36,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:11:36,922 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 68 [2025-02-08 01:11:36,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 102 transitions, 475 flow. Second operand has 6 states, 6 states have (on average 25.0) internal successors, (150), 6 states have internal predecessors, (150), 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-02-08 01:11:36,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:11:36,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 68 [2025-02-08 01:11:36,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:11:39,373 INFO L124 PetriNetUnfolderBase]: 24250/40158 cut-off events. [2025-02-08 01:11:39,374 INFO L125 PetriNetUnfolderBase]: For 35796/36716 co-relation queries the response was YES. [2025-02-08 01:11:39,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116793 conditions, 40158 events. 24250/40158 cut-off events. For 35796/36716 co-relation queries the response was YES. Maximal size of possible extension queue 1204. Compared 331458 event pairs, 4853 based on Foata normal form. 545/40624 useless extension candidates. Maximal degree in co-relation 116764. Up to 11342 conditions per place. [2025-02-08 01:11:39,566 INFO L140 encePairwiseOnDemand]: 62/68 looper letters, 202 selfloop transitions, 27 changer transitions 27/277 dead transitions. [2025-02-08 01:11:39,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 277 transitions, 1812 flow [2025-02-08 01:11:39,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:11:39,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:11:39,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 350 transitions. [2025-02-08 01:11:39,568 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6433823529411765 [2025-02-08 01:11:39,568 INFO L175 Difference]: Start difference. First operand has 105 places, 102 transitions, 475 flow. Second operand 8 states and 350 transitions. [2025-02-08 01:11:39,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 277 transitions, 1812 flow [2025-02-08 01:11:40,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 277 transitions, 1758 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 01:11:40,234 INFO L231 Difference]: Finished difference. Result has 106 places, 107 transitions, 568 flow [2025-02-08 01:11:40,234 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=451, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=568, PETRI_PLACES=106, PETRI_TRANSITIONS=107} [2025-02-08 01:11:40,234 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 36 predicate places. [2025-02-08 01:11:40,235 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 107 transitions, 568 flow [2025-02-08 01:11:40,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.0) internal successors, (150), 6 states have internal predecessors, (150), 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-02-08 01:11:40,235 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:11:40,235 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:11:40,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 01:11:40,235 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2025-02-08 01:11:40,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:11:40,236 INFO L85 PathProgramCache]: Analyzing trace with hash -2079069770, now seen corresponding path program 1 times [2025-02-08 01:11:40,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:11:40,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466791409] [2025-02-08 01:11:40,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:11:40,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:11:40,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 01:11:40,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 01:11:40,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:11:40,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:11:40,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:11:40,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:11:40,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466791409] [2025-02-08 01:11:40,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466791409] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:11:40,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:11:40,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 01:11:40,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888856104] [2025-02-08 01:11:40,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:11:40,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:11:40,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:11:40,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:11:40,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:11:40,343 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 68 [2025-02-08 01:11:40,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 107 transitions, 568 flow. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 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-02-08 01:11:40,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:11:40,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 68 [2025-02-08 01:11:40,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:11:43,188 INFO L124 PetriNetUnfolderBase]: 22611/36771 cut-off events. [2025-02-08 01:11:43,188 INFO L125 PetriNetUnfolderBase]: For 36079/36150 co-relation queries the response was YES. [2025-02-08 01:11:43,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108624 conditions, 36771 events. 22611/36771 cut-off events. For 36079/36150 co-relation queries the response was YES. Maximal size of possible extension queue 996. Compared 290007 event pairs, 4720 based on Foata normal form. 650/37390 useless extension candidates. Maximal degree in co-relation 108596. Up to 7735 conditions per place. [2025-02-08 01:11:43,372 INFO L140 encePairwiseOnDemand]: 56/68 looper letters, 204 selfloop transitions, 41 changer transitions 33/295 dead transitions. [2025-02-08 01:11:43,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 295 transitions, 1911 flow [2025-02-08 01:11:43,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 01:11:43,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-08 01:11:43,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 447 transitions. [2025-02-08 01:11:43,374 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5477941176470589 [2025-02-08 01:11:43,374 INFO L175 Difference]: Start difference. First operand has 106 places, 107 transitions, 568 flow. Second operand 12 states and 447 transitions. [2025-02-08 01:11:43,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 295 transitions, 1911 flow [2025-02-08 01:11:43,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 295 transitions, 1908 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-08 01:11:43,612 INFO L231 Difference]: Finished difference. Result has 119 places, 119 transitions, 742 flow [2025-02-08 01:11:43,613 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=565, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=742, PETRI_PLACES=119, PETRI_TRANSITIONS=119} [2025-02-08 01:11:43,613 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 49 predicate places. [2025-02-08 01:11:43,613 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 119 transitions, 742 flow [2025-02-08 01:11:43,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 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-02-08 01:11:43,613 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:11:43,615 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:11:43,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 01:11:43,616 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2025-02-08 01:11:43,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:11:43,616 INFO L85 PathProgramCache]: Analyzing trace with hash -2116309113, now seen corresponding path program 1 times [2025-02-08 01:11:43,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:11:43,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472448790] [2025-02-08 01:11:43,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:11:43,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:11:43,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 01:11:43,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:11:43,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:11:43,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:11:43,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:11:43,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:11:43,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472448790] [2025-02-08 01:11:43,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472448790] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:11:43,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:11:43,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 01:11:43,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150013031] [2025-02-08 01:11:43,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:11:43,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:11:43,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:11:43,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:11:43,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:11:43,758 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 68 [2025-02-08 01:11:43,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 119 transitions, 742 flow. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 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-02-08 01:11:43,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:11:43,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 68 [2025-02-08 01:11:43,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand