./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/test-easy6.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/test-easy6.wvr.c -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 ce46a456eb9ebd463906f73dade5d1c1c222b26a063863b37340a2842c9ee284 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:49:10,416 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:49:10,468 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 16:49:10,475 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:49:10,475 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:49:10,504 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:49:10,504 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:49:10,504 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:49:10,504 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:49:10,504 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:49:10,504 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:49:10,504 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:49:10,505 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:49:10,505 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:49:10,505 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:49:10,505 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:49:10,508 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:49:10,508 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:49:10,509 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:49:10,509 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:49:10,509 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:49:10,509 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:49:10,509 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:49:10,509 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:49:10,509 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:49:10,509 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:49:10,509 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:49:10,509 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:49:10,509 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:49:10,509 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:49:10,509 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:49:10,509 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:49:10,509 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:49:10,509 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:49:10,509 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:49:10,509 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:49:10,509 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:49:10,509 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:49:10,509 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:49:10,509 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:49:10,509 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:49:10,510 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:49:10,510 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:49:10,510 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:49:10,510 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:49:10,510 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:49:10,510 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:49:10,510 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:49:10,510 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 -> ce46a456eb9ebd463906f73dade5d1c1c222b26a063863b37340a2842c9ee284 [2025-01-09 16:49:10,753 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:49:10,762 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:49:10,763 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:49:10,767 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:49:10,767 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:49:10,768 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/test-easy6.wvr.c [2025-01-09 16:49:12,041 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d02186a8f/79d69c6d917c4e5396d085f367b6fe61/FLAGa8e2053c2 [2025-01-09 16:49:12,275 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:49:12,277 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/test-easy6.wvr.c [2025-01-09 16:49:12,283 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d02186a8f/79d69c6d917c4e5396d085f367b6fe61/FLAGa8e2053c2 [2025-01-09 16:49:12,293 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d02186a8f/79d69c6d917c4e5396d085f367b6fe61 [2025-01-09 16:49:12,294 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:49:12,296 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:49:12,297 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:49:12,297 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:49:12,300 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:49:12,300 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:49:12" (1/1) ... [2025-01-09 16:49:12,301 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4aae16df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:49:12, skipping insertion in model container [2025-01-09 16:49:12,301 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:49:12" (1/1) ... [2025-01-09 16:49:12,313 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:49:12,427 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/weaver/test-easy6.wvr.c[2032,2045] [2025-01-09 16:49:12,431 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:49:12,439 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:49:12,454 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/weaver/test-easy6.wvr.c[2032,2045] [2025-01-09 16:49:12,456 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:49:12,468 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:49:12,470 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:49:12 WrapperNode [2025-01-09 16:49:12,470 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:49:12,471 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:49:12,471 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:49:12,471 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:49:12,476 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:49:12" (1/1) ... [2025-01-09 16:49:12,481 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:49:12" (1/1) ... [2025-01-09 16:49:12,495 INFO L138 Inliner]: procedures = 18, calls = 13, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 92 [2025-01-09 16:49:12,496 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:49:12,496 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:49:12,496 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:49:12,497 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:49:12,502 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:49:12" (1/1) ... [2025-01-09 16:49:12,502 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:49:12" (1/1) ... [2025-01-09 16:49:12,503 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:49:12" (1/1) ... [2025-01-09 16:49:12,510 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 16:49:12,510 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:49:12" (1/1) ... [2025-01-09 16:49:12,511 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:49:12" (1/1) ... [2025-01-09 16:49:12,513 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:49:12" (1/1) ... [2025-01-09 16:49:12,514 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:49:12" (1/1) ... [2025-01-09 16:49:12,515 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:49:12" (1/1) ... [2025-01-09 16:49:12,516 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:49:12" (1/1) ... [2025-01-09 16:49:12,516 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:49:12" (1/1) ... [2025-01-09 16:49:12,517 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:49:12,518 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:49:12,518 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:49:12,518 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:49:12,518 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:49:12" (1/1) ... [2025-01-09 16:49:12,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:49:12,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:49:12,541 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 16:49:12,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 16:49:12,564 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:49:12,564 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 16:49:12,565 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 16:49:12,565 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 16:49:12,565 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 16:49:12,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:49:12,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:49:12,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:49:12,566 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 16:49:12,631 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:49:12,632 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:49:12,756 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:49:12,756 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:49:12,842 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:49:12,843 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 16:49:12,843 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:49:12 BoogieIcfgContainer [2025-01-09 16:49:12,843 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:49:12,845 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:49:12,845 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:49:12,848 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:49:12,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:49:12" (1/3) ... [2025-01-09 16:49:12,849 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16e9fe50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:49:12, skipping insertion in model container [2025-01-09 16:49:12,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:49:12" (2/3) ... [2025-01-09 16:49:12,849 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16e9fe50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:49:12, skipping insertion in model container [2025-01-09 16:49:12,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:49:12" (3/3) ... [2025-01-09 16:49:12,850 INFO L128 eAbstractionObserver]: Analyzing ICFG test-easy6.wvr.c [2025-01-09 16:49:12,860 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:49:12,862 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-easy6.wvr.c that has 3 procedures, 33 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-01-09 16:49:12,862 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:49:12,890 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-09 16:49:12,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 32 transitions, 78 flow [2025-01-09 16:49:12,933 INFO L124 PetriNetUnfolderBase]: 0/30 cut-off events. [2025-01-09 16:49:12,935 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 16:49:12,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 30 events. 0/30 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 26 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2025-01-09 16:49:12,938 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 32 transitions, 78 flow [2025-01-09 16:49:12,942 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 29 transitions, 70 flow [2025-01-09 16:49:12,948 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:49:12,961 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;@1db7eea5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:49:12,961 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-01-09 16:49:12,974 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:49:12,974 INFO L124 PetriNetUnfolderBase]: 0/28 cut-off events. [2025-01-09 16:49:12,974 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 16:49:12,974 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:49:12,975 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] [2025-01-09 16:49:12,975 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:49:12,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:49:12,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1238947515, now seen corresponding path program 1 times [2025-01-09 16:49:12,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:49:12,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7307045] [2025-01-09 16:49:12,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:49:12,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:49:13,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 16:49:13,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 16:49:13,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:49:13,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:49:13,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:49:13,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:49:13,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7307045] [2025-01-09 16:49:13,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7307045] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:49:13,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:49:13,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:49:13,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912228450] [2025-01-09 16:49:13,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:49:13,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:49:13,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:49:13,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:49:13,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:49:13,357 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 32 [2025-01-09 16:49:13,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 29 transitions, 70 flow. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 7 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:49:13,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:49:13,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 32 [2025-01-09 16:49:13,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:49:13,533 INFO L124 PetriNetUnfolderBase]: 92/254 cut-off events. [2025-01-09 16:49:13,534 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2025-01-09 16:49:13,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 490 conditions, 254 events. 92/254 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1172 event pairs, 20 based on Foata normal form. 1/246 useless extension candidates. Maximal degree in co-relation 405. Up to 55 conditions per place. [2025-01-09 16:49:13,537 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 28 selfloop transitions, 6 changer transitions 13/60 dead transitions. [2025-01-09 16:49:13,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 60 transitions, 250 flow [2025-01-09 16:49:13,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:49:13,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:49:13,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 153 transitions. [2025-01-09 16:49:13,546 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6830357142857143 [2025-01-09 16:49:13,547 INFO L175 Difference]: Start difference. First operand has 36 places, 29 transitions, 70 flow. Second operand 7 states and 153 transitions. [2025-01-09 16:49:13,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 60 transitions, 250 flow [2025-01-09 16:49:13,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 60 transitions, 226 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-09 16:49:13,552 INFO L231 Difference]: Finished difference. Result has 41 places, 33 transitions, 97 flow [2025-01-09 16:49:13,553 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=97, PETRI_PLACES=41, PETRI_TRANSITIONS=33} [2025-01-09 16:49:13,555 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 5 predicate places. [2025-01-09 16:49:13,555 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 97 flow [2025-01-09 16:49:13,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 7 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:49:13,556 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:49:13,556 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] [2025-01-09 16:49:13,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:49:13,556 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:49:13,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:49:13,557 INFO L85 PathProgramCache]: Analyzing trace with hash 293975081, now seen corresponding path program 2 times [2025-01-09 16:49:13,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:49:13,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612740977] [2025-01-09 16:49:13,557 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:49:13,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:49:13,567 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 1 equivalence classes. [2025-01-09 16:49:13,574 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 16:49:13,574 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:49:13,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:49:13,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:49:13,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:49:13,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612740977] [2025-01-09 16:49:13,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612740977] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:49:13,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:49:13,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:49:13,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186904346] [2025-01-09 16:49:13,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:49:13,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:49:13,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:49:13,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:49:13,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:49:13,691 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 32 [2025-01-09 16:49:13,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 33 transitions, 97 flow. Second operand has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:49:13,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:49:13,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 32 [2025-01-09 16:49:13,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:49:13,841 INFO L124 PetriNetUnfolderBase]: 229/581 cut-off events. [2025-01-09 16:49:13,842 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2025-01-09 16:49:13,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1155 conditions, 581 events. 229/581 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3166 event pairs, 51 based on Foata normal form. 4/573 useless extension candidates. Maximal degree in co-relation 1125. Up to 143 conditions per place. [2025-01-09 16:49:13,864 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 37 selfloop transitions, 11 changer transitions 10/73 dead transitions. [2025-01-09 16:49:13,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 73 transitions, 300 flow [2025-01-09 16:49:13,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 16:49:13,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-09 16:49:13,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 176 transitions. [2025-01-09 16:49:13,866 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2025-01-09 16:49:13,866 INFO L175 Difference]: Start difference. First operand has 41 places, 33 transitions, 97 flow. Second operand 9 states and 176 transitions. [2025-01-09 16:49:13,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 73 transitions, 300 flow [2025-01-09 16:49:13,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 73 transitions, 296 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-01-09 16:49:13,869 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 169 flow [2025-01-09 16:49:13,869 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=169, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2025-01-09 16:49:13,869 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 16 predicate places. [2025-01-09 16:49:13,869 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 169 flow [2025-01-09 16:49:13,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:49:13,870 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:49:13,870 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] [2025-01-09 16:49:13,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:49:13,870 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:49:13,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:49:13,871 INFO L85 PathProgramCache]: Analyzing trace with hash -329664591, now seen corresponding path program 3 times [2025-01-09 16:49:13,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:49:13,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982366077] [2025-01-09 16:49:13,871 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:49:13,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:49:13,877 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 1 equivalence classes. [2025-01-09 16:49:13,889 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 16:49:13,889 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 16:49:13,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:49:13,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:49:13,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:49:13,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982366077] [2025-01-09 16:49:13,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982366077] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:49:13,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:49:13,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:49:13,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705451801] [2025-01-09 16:49:13,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:49:13,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:49:13,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:49:13,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:49:13,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:49:13,967 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 32 [2025-01-09 16:49:13,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 169 flow. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:49:13,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:49:13,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 32 [2025-01-09 16:49:13,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:49:14,031 INFO L124 PetriNetUnfolderBase]: 111/400 cut-off events. [2025-01-09 16:49:14,031 INFO L125 PetriNetUnfolderBase]: For 187/191 co-relation queries the response was YES. [2025-01-09 16:49:14,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 931 conditions, 400 events. 111/400 cut-off events. For 187/191 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2354 event pairs, 88 based on Foata normal form. 9/381 useless extension candidates. Maximal degree in co-relation 757. Up to 215 conditions per place. [2025-01-09 16:49:14,033 INFO L140 encePairwiseOnDemand]: 29/32 looper letters, 16 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2025-01-09 16:49:14,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 45 transitions, 214 flow [2025-01-09 16:49:14,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:49:14,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:49:14,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2025-01-09 16:49:14,034 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7291666666666666 [2025-01-09 16:49:14,034 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 169 flow. Second operand 3 states and 70 transitions. [2025-01-09 16:49:14,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 45 transitions, 214 flow [2025-01-09 16:49:14,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 45 transitions, 212 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-09 16:49:14,037 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 175 flow [2025-01-09 16:49:14,037 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=175, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2025-01-09 16:49:14,038 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 16 predicate places. [2025-01-09 16:49:14,038 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 175 flow [2025-01-09 16:49:14,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:49:14,038 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:49:14,038 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] [2025-01-09 16:49:14,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:49:14,039 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:49:14,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:49:14,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1727786543, now seen corresponding path program 4 times [2025-01-09 16:49:14,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:49:14,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990480719] [2025-01-09 16:49:14,040 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:49:14,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:49:14,045 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-01-09 16:49:14,049 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 16:49:14,050 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:49:14,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:49:14,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:49:14,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:49:14,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990480719] [2025-01-09 16:49:14,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990480719] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:49:14,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:49:14,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:49:14,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103638013] [2025-01-09 16:49:14,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:49:14,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:49:14,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:49:14,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:49:14,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:49:14,126 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 32 [2025-01-09 16:49:14,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 175 flow. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 7 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:49:14,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:49:14,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 32 [2025-01-09 16:49:14,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:49:14,251 INFO L124 PetriNetUnfolderBase]: 183/480 cut-off events. [2025-01-09 16:49:14,251 INFO L125 PetriNetUnfolderBase]: For 282/286 co-relation queries the response was YES. [2025-01-09 16:49:14,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1240 conditions, 480 events. 183/480 cut-off events. For 282/286 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2610 event pairs, 51 based on Foata normal form. 6/467 useless extension candidates. Maximal degree in co-relation 637. Up to 114 conditions per place. [2025-01-09 16:49:14,253 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 20 selfloop transitions, 5 changer transitions 13/59 dead transitions. [2025-01-09 16:49:14,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 59 transitions, 296 flow [2025-01-09 16:49:14,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:49:14,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:49:14,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 144 transitions. [2025-01-09 16:49:14,259 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2025-01-09 16:49:14,259 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 175 flow. Second operand 7 states and 144 transitions. [2025-01-09 16:49:14,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 59 transitions, 296 flow [2025-01-09 16:49:14,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 59 transitions, 292 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 16:49:14,261 INFO L231 Difference]: Finished difference. Result has 57 places, 39 transitions, 174 flow [2025-01-09 16:49:14,261 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=174, PETRI_PLACES=57, PETRI_TRANSITIONS=39} [2025-01-09 16:49:14,262 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 21 predicate places. [2025-01-09 16:49:14,262 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 39 transitions, 174 flow [2025-01-09 16:49:14,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 7 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:49:14,262 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:49:14,262 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] [2025-01-09 16:49:14,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:49:14,263 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:49:14,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:49:14,263 INFO L85 PathProgramCache]: Analyzing trace with hash 2134267619, now seen corresponding path program 5 times [2025-01-09 16:49:14,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:49:14,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363770075] [2025-01-09 16:49:14,263 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:49:14,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:49:14,269 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 1 equivalence classes. [2025-01-09 16:49:14,273 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 16:49:14,273 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:49:14,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:49:14,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:49:14,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:49:14,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363770075] [2025-01-09 16:49:14,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363770075] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:49:14,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:49:14,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:49:14,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347673186] [2025-01-09 16:49:14,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:49:14,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:49:14,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:49:14,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:49:14,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:49:14,391 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 32 [2025-01-09 16:49:14,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 39 transitions, 174 flow. Second operand has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:49:14,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:49:14,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 32 [2025-01-09 16:49:14,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:49:14,533 INFO L124 PetriNetUnfolderBase]: 194/514 cut-off events. [2025-01-09 16:49:14,534 INFO L125 PetriNetUnfolderBase]: For 490/511 co-relation queries the response was YES. [2025-01-09 16:49:14,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1362 conditions, 514 events. 194/514 cut-off events. For 490/511 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2706 event pairs, 62 based on Foata normal form. 25/525 useless extension candidates. Maximal degree in co-relation 1324. Up to 146 conditions per place. [2025-01-09 16:49:14,536 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 37 selfloop transitions, 8 changer transitions 10/68 dead transitions. [2025-01-09 16:49:14,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 68 transitions, 370 flow [2025-01-09 16:49:14,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:49:14,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-09 16:49:14,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 160 transitions. [2025-01-09 16:49:14,538 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.625 [2025-01-09 16:49:14,538 INFO L175 Difference]: Start difference. First operand has 57 places, 39 transitions, 174 flow. Second operand 8 states and 160 transitions. [2025-01-09 16:49:14,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 68 transitions, 370 flow [2025-01-09 16:49:14,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 68 transitions, 353 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-01-09 16:49:14,541 INFO L231 Difference]: Finished difference. Result has 57 places, 37 transitions, 167 flow [2025-01-09 16:49:14,541 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=167, PETRI_PLACES=57, PETRI_TRANSITIONS=37} [2025-01-09 16:49:14,543 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 21 predicate places. [2025-01-09 16:49:14,544 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 37 transitions, 167 flow [2025-01-09 16:49:14,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:49:14,544 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:49:14,544 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] [2025-01-09 16:49:14,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:49:14,544 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:49:14,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:49:14,545 INFO L85 PathProgramCache]: Analyzing trace with hash -777597203, now seen corresponding path program 6 times [2025-01-09 16:49:14,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:49:14,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011503802] [2025-01-09 16:49:14,546 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 16:49:14,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:49:14,550 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 1 equivalence classes. [2025-01-09 16:49:14,556 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 16:49:14,557 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-09 16:49:14,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:49:14,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:49:14,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:49:14,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011503802] [2025-01-09 16:49:14,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011503802] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:49:14,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:49:14,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:49:14,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813171638] [2025-01-09 16:49:14,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:49:14,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:49:14,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:49:14,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:49:14,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:49:14,600 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 32 [2025-01-09 16:49:14,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 37 transitions, 167 flow. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:49:14,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:49:14,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 32 [2025-01-09 16:49:14,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:49:14,632 INFO L124 PetriNetUnfolderBase]: 72/282 cut-off events. [2025-01-09 16:49:14,632 INFO L125 PetriNetUnfolderBase]: For 236/240 co-relation queries the response was YES. [2025-01-09 16:49:14,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 715 conditions, 282 events. 72/282 cut-off events. For 236/240 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1508 event pairs, 71 based on Foata normal form. 8/266 useless extension candidates. Maximal degree in co-relation 410. Up to 175 conditions per place. [2025-01-09 16:49:14,634 INFO L140 encePairwiseOnDemand]: 29/32 looper letters, 13 selfloop transitions, 2 changer transitions 0/38 dead transitions. [2025-01-09 16:49:14,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 38 transitions, 199 flow [2025-01-09 16:49:14,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:49:14,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:49:14,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2025-01-09 16:49:14,635 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6979166666666666 [2025-01-09 16:49:14,635 INFO L175 Difference]: Start difference. First operand has 57 places, 37 transitions, 167 flow. Second operand 3 states and 67 transitions. [2025-01-09 16:49:14,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 38 transitions, 199 flow [2025-01-09 16:49:14,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 38 transitions, 176 flow, removed 2 selfloop flow, removed 7 redundant places. [2025-01-09 16:49:14,662 INFO L231 Difference]: Finished difference. Result has 52 places, 37 transitions, 152 flow [2025-01-09 16:49:14,662 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=52, PETRI_TRANSITIONS=37} [2025-01-09 16:49:14,662 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 16 predicate places. [2025-01-09 16:49:14,662 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 37 transitions, 152 flow [2025-01-09 16:49:14,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:49:14,662 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:49:14,663 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] [2025-01-09 16:49:14,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 16:49:14,663 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:49:14,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:49:14,663 INFO L85 PathProgramCache]: Analyzing trace with hash 136316791, now seen corresponding path program 7 times [2025-01-09 16:49:14,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:49:14,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534645256] [2025-01-09 16:49:14,663 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 16:49:14,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:49:14,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 16:49:14,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 16:49:14,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:49:14,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:49:14,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:49:14,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:49:14,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534645256] [2025-01-09 16:49:14,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534645256] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:49:14,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:49:14,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:49:14,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245089914] [2025-01-09 16:49:14,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:49:14,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:49:14,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:49:14,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:49:14,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:49:14,808 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 32 [2025-01-09 16:49:14,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 37 transitions, 152 flow. Second operand has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:49:14,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:49:14,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 32 [2025-01-09 16:49:14,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:49:14,923 INFO L124 PetriNetUnfolderBase]: 94/255 cut-off events. [2025-01-09 16:49:14,923 INFO L125 PetriNetUnfolderBase]: For 236/236 co-relation queries the response was YES. [2025-01-09 16:49:14,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 691 conditions, 255 events. 94/255 cut-off events. For 236/236 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1030 event pairs, 44 based on Foata normal form. 4/249 useless extension candidates. Maximal degree in co-relation 438. Up to 146 conditions per place. [2025-01-09 16:49:14,924 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 18 selfloop transitions, 3 changer transitions 9/43 dead transitions. [2025-01-09 16:49:14,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 43 transitions, 224 flow [2025-01-09 16:49:14,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:49:14,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:49:14,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2025-01-09 16:49:14,929 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-01-09 16:49:14,929 INFO L175 Difference]: Start difference. First operand has 52 places, 37 transitions, 152 flow. Second operand 5 states and 96 transitions. [2025-01-09 16:49:14,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 43 transitions, 224 flow [2025-01-09 16:49:14,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 43 transitions, 218 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-01-09 16:49:14,931 INFO L231 Difference]: Finished difference. Result has 53 places, 31 transitions, 121 flow [2025-01-09 16:49:14,931 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=121, PETRI_PLACES=53, PETRI_TRANSITIONS=31} [2025-01-09 16:49:14,933 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 17 predicate places. [2025-01-09 16:49:14,933 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 31 transitions, 121 flow [2025-01-09 16:49:14,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:49:14,933 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:49:14,934 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] [2025-01-09 16:49:14,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 16:49:14,934 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:49:14,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:49:14,935 INFO L85 PathProgramCache]: Analyzing trace with hash 647429889, now seen corresponding path program 8 times [2025-01-09 16:49:14,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:49:14,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649356500] [2025-01-09 16:49:14,935 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:49:14,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:49:14,940 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 1 equivalence classes. [2025-01-09 16:49:14,944 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 16:49:14,945 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:49:14,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:49:15,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:49:15,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:49:15,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649356500] [2025-01-09 16:49:15,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649356500] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:49:15,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:49:15,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:49:15,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135993409] [2025-01-09 16:49:15,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:49:15,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:49:15,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:49:15,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:49:15,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:49:15,037 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 32 [2025-01-09 16:49:15,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 31 transitions, 121 flow. Second operand has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:49:15,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:49:15,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 32 [2025-01-09 16:49:15,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:49:15,097 INFO L124 PetriNetUnfolderBase]: 21/68 cut-off events. [2025-01-09 16:49:15,098 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2025-01-09 16:49:15,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 68 events. 21/68 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 163 event pairs, 5 based on Foata normal form. 4/71 useless extension candidates. Maximal degree in co-relation 188. Up to 18 conditions per place. [2025-01-09 16:49:15,098 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 0 selfloop transitions, 0 changer transitions 29/29 dead transitions. [2025-01-09 16:49:15,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 29 transitions, 152 flow [2025-01-09 16:49:15,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:49:15,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:49:15,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions. [2025-01-09 16:49:15,099 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5044642857142857 [2025-01-09 16:49:15,099 INFO L175 Difference]: Start difference. First operand has 53 places, 31 transitions, 121 flow. Second operand 7 states and 113 transitions. [2025-01-09 16:49:15,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 29 transitions, 152 flow [2025-01-09 16:49:15,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 29 transitions, 121 flow, removed 9 selfloop flow, removed 10 redundant places. [2025-01-09 16:49:15,101 INFO L231 Difference]: Finished difference. Result has 37 places, 0 transitions, 0 flow [2025-01-09 16:49:15,101 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=59, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=0, PETRI_PLACES=37, PETRI_TRANSITIONS=0} [2025-01-09 16:49:15,102 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 1 predicate places. [2025-01-09 16:49:15,102 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 0 transitions, 0 flow [2025-01-09 16:49:15,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:49:15,105 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-01-09 16:49:15,105 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-01-09 16:49:15,105 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-01-09 16:49:15,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 16:49:15,105 INFO L422 BasicCegarLoop]: Path program histogram: [8] [2025-01-09 16:49:15,107 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 16:49:15,107 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 16:49:15,113 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 04:49:15 BasicIcfg [2025-01-09 16:49:15,115 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 16:49:15,115 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 16:49:15,115 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 16:49:15,115 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 16:49:15,116 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:49:12" (3/4) ... [2025-01-09 16:49:15,117 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 16:49:15,119 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-01-09 16:49:15,119 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-01-09 16:49:15,122 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 38 nodes and edges [2025-01-09 16:49:15,123 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-01-09 16:49:15,123 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-09 16:49:15,123 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 16:49:15,172 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 16:49:15,172 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 16:49:15,172 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 16:49:15,172 INFO L158 Benchmark]: Toolchain (without parser) took 2876.50ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 109.9MB in the beginning and 243.9MB in the end (delta: -133.9MB). Peak memory consumption was 69.4MB. Max. memory is 16.1GB. [2025-01-09 16:49:15,173 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:49:15,173 INFO L158 Benchmark]: CACSL2BoogieTranslator took 173.50ms. Allocated memory is still 142.6MB. Free memory was 109.9MB in the beginning and 99.2MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 16:49:15,173 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.19ms. Allocated memory is still 142.6MB. Free memory was 99.2MB in the beginning and 97.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:49:15,175 INFO L158 Benchmark]: Boogie Preprocessor took 20.84ms. Allocated memory is still 142.6MB. Free memory was 97.7MB in the beginning and 95.7MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 16:49:15,175 INFO L158 Benchmark]: RCFGBuilder took 325.49ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 74.1MB in the end (delta: 21.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 16:49:15,175 INFO L158 Benchmark]: TraceAbstraction took 2270.47ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 74.1MB in the beginning and 248.3MB in the end (delta: -174.1MB). Peak memory consumption was 27.4MB. Max. memory is 16.1GB. [2025-01-09 16:49:15,176 INFO L158 Benchmark]: Witness Printer took 56.66ms. Allocated memory is still 343.9MB. Free memory was 248.3MB in the beginning and 243.9MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 16:49:15,177 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 173.50ms. Allocated memory is still 142.6MB. Free memory was 109.9MB in the beginning and 99.2MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.19ms. Allocated memory is still 142.6MB. Free memory was 99.2MB in the beginning and 97.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 20.84ms. Allocated memory is still 142.6MB. Free memory was 97.7MB in the beginning and 95.7MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 325.49ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 74.1MB in the end (delta: 21.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2270.47ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 74.1MB in the beginning and 248.3MB in the end (delta: -174.1MB). Peak memory consumption was 27.4MB. Max. memory is 16.1GB. * Witness Printer took 56.66ms. Allocated memory is still 343.9MB. Free memory was 248.3MB in the beginning and 243.9MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 80]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 57 locations, 3 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: 2.2s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 318 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 291 mSDsluCounter, 81 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 44 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 778 IncrementalHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 37 mSDtfsCounter, 778 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=175occurred in iteration=3, InterpolantAutomatonStates: 49, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 232 NumberOfCodeBlocks, 232 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 224 ConstructedInterpolants, 0 QuantifiedInterpolants, 626 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 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 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 16:49:15,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE