./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/chl-node-subst.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-node-subst.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3b43103ca9a91605874c4d895f03c4116805b9b245b91cffe9bd63255503e5a0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 10:27:57,779 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 10:27:57,851 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 10:27:57,857 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 10:27:57,858 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 10:27:57,886 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 10:27:57,886 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 10:27:57,887 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 10:27:57,888 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 10:27:57,891 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 10:27:57,891 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 10:27:57,892 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 10:27:57,892 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 10:27:57,892 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 10:27:57,893 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 10:27:57,893 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 10:27:57,893 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 10:27:57,893 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 10:27:57,894 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 10:27:57,894 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 10:27:57,894 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 10:27:57,896 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 10:27:57,896 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 10:27:57,897 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 10:27:57,897 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 10:27:57,897 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 10:27:57,897 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 10:27:57,898 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 10:27:57,898 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 10:27:57,898 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 10:27:57,898 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 10:27:57,899 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 10:27:57,899 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:27:57,899 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 10:27:57,899 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 10:27:57,900 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 10:27:57,900 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 10:27:57,901 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 10:27:57,901 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 10:27:57,901 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 10:27:57,902 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 10:27:57,902 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 10:27:57,902 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> 3b43103ca9a91605874c4d895f03c4116805b9b245b91cffe9bd63255503e5a0 [2024-11-10 10:27:58,125 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 10:27:58,148 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 10:27:58,151 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 10:27:58,152 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 10:27:58,153 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 10:27:58,154 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-node-subst.wvr.c [2024-11-10 10:27:59,584 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 10:27:59,762 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 10:27:59,763 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-node-subst.wvr.c [2024-11-10 10:27:59,772 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cd21b5f1/13d4bedc07354413b2d755abc7d64b41/FLAG9fae6cafc [2024-11-10 10:27:59,784 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cd21b5f1/13d4bedc07354413b2d755abc7d64b41 [2024-11-10 10:27:59,787 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 10:27:59,788 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 10:27:59,790 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 10:27:59,790 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 10:27:59,794 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 10:27:59,794 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:27:59" (1/1) ... [2024-11-10 10:27:59,795 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32a4b419 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:27:59, skipping insertion in model container [2024-11-10 10:27:59,795 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:27:59" (1/1) ... [2024-11-10 10:27:59,817 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 10:28:00,036 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-node-subst.wvr.c[4035,4048] [2024-11-10 10:28:00,064 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:28:00,075 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 10:28:00,100 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-node-subst.wvr.c[4035,4048] [2024-11-10 10:28:00,108 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:28:00,124 INFO L204 MainTranslator]: Completed translation [2024-11-10 10:28:00,124 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:28:00 WrapperNode [2024-11-10 10:28:00,125 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 10:28:00,126 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 10:28:00,126 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 10:28:00,126 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 10:28:00,132 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:28:00" (1/1) ... [2024-11-10 10:28:00,140 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:28:00" (1/1) ... [2024-11-10 10:28:00,177 INFO L138 Inliner]: procedures = 26, calls = 51, calls flagged for inlining = 22, calls inlined = 34, statements flattened = 418 [2024-11-10 10:28:00,177 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 10:28:00,178 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 10:28:00,178 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 10:28:00,178 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 10:28:00,197 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:28:00" (1/1) ... [2024-11-10 10:28:00,197 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:28:00" (1/1) ... [2024-11-10 10:28:00,208 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:28:00" (1/1) ... [2024-11-10 10:28:00,243 INFO L175 MemorySlicer]: Split 26 memory accesses to 3 slices as follows [2, 9, 15]. 58 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 6 writes are split as follows [0, 3, 3]. [2024-11-10 10:28:00,243 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:28:00" (1/1) ... [2024-11-10 10:28:00,244 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:28:00" (1/1) ... [2024-11-10 10:28:00,256 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:28:00" (1/1) ... [2024-11-10 10:28:00,257 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:28:00" (1/1) ... [2024-11-10 10:28:00,259 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:28:00" (1/1) ... [2024-11-10 10:28:00,261 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:28:00" (1/1) ... [2024-11-10 10:28:00,265 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 10:28:00,266 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 10:28:00,266 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 10:28:00,266 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 10:28:00,271 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:28:00" (1/1) ... [2024-11-10 10:28:00,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:28:00,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:28:00,306 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 10:28:00,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 10:28:00,348 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 10:28:00,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 10:28:00,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 10:28:00,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-10 10:28:00,349 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 10:28:00,349 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 10:28:00,349 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-10 10:28:00,349 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-10 10:28:00,349 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-10 10:28:00,350 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-10 10:28:00,350 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-10 10:28:00,350 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-10 10:28:00,350 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-10 10:28:00,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 10:28:00,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 10:28:00,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-10 10:28:00,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 10:28:00,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 10:28:00,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 10:28:00,353 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 10:28:00,468 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 10:28:00,471 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 10:28:01,131 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 10:28:01,132 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 10:28:01,590 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 10:28:01,591 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 10:28:01,591 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:28:01 BoogieIcfgContainer [2024-11-10 10:28:01,591 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 10:28:01,593 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 10:28:01,593 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 10:28:01,598 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 10:28:01,598 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 10:27:59" (1/3) ... [2024-11-10 10:28:01,599 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47655620 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:28:01, skipping insertion in model container [2024-11-10 10:28:01,599 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:28:00" (2/3) ... [2024-11-10 10:28:01,599 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47655620 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:28:01, skipping insertion in model container [2024-11-10 10:28:01,600 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:28:01" (3/3) ... [2024-11-10 10:28:01,602 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-node-subst.wvr.c [2024-11-10 10:28:01,621 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 10:28:01,621 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 10:28:01,621 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 10:28:01,693 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-10 10:28:01,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 49 transitions, 119 flow [2024-11-10 10:28:01,767 INFO L124 PetriNetUnfolderBase]: 12/46 cut-off events. [2024-11-10 10:28:01,767 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-10 10:28:01,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 46 events. 12/46 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 23 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 41. Up to 2 conditions per place. [2024-11-10 10:28:01,770 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 49 transitions, 119 flow [2024-11-10 10:28:01,774 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 45 transitions, 108 flow [2024-11-10 10:28:01,785 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 10:28:01,793 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;@6e398883, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 10:28:01,794 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-10 10:28:01,816 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 10:28:01,817 INFO L124 PetriNetUnfolderBase]: 12/44 cut-off events. [2024-11-10 10:28:01,817 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-10 10:28:01,817 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:28:01,818 INFO L204 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] [2024-11-10 10:28:01,818 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-10 10:28:01,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:28:01,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1880650075, now seen corresponding path program 1 times [2024-11-10 10:28:01,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:28:01,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142972552] [2024-11-10 10:28:01,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:28:01,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:28:01,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:28:02,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:28:02,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:28:02,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142972552] [2024-11-10 10:28:02,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142972552] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:28:02,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:28:02,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 10:28:02,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599441575] [2024-11-10 10:28:02,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:28:02,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 10:28:02,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:28:02,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 10:28:02,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 10:28:02,194 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 49 [2024-11-10 10:28:02,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 45 transitions, 108 flow. Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 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) [2024-11-10 10:28:02,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:28:02,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 49 [2024-11-10 10:28:02,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:28:02,300 INFO L124 PetriNetUnfolderBase]: 38/94 cut-off events. [2024-11-10 10:28:02,301 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-11-10 10:28:02,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 94 events. 38/94 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 32 based on Foata normal form. 6/100 useless extension candidates. Maximal degree in co-relation 120. Up to 82 conditions per place. [2024-11-10 10:28:02,304 INFO L140 encePairwiseOnDemand]: 43/49 looper letters, 26 selfloop transitions, 0 changer transitions 0/39 dead transitions. [2024-11-10 10:28:02,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 39 transitions, 148 flow [2024-11-10 10:28:02,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 10:28:02,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-10 10:28:02,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 64 transitions. [2024-11-10 10:28:02,318 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6530612244897959 [2024-11-10 10:28:02,319 INFO L175 Difference]: Start difference. First operand has 43 places, 45 transitions, 108 flow. Second operand 2 states and 64 transitions. [2024-11-10 10:28:02,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 39 transitions, 148 flow [2024-11-10 10:28:02,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 39 transitions, 136 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-10 10:28:02,324 INFO L231 Difference]: Finished difference. Result has 38 places, 39 transitions, 84 flow [2024-11-10 10:28:02,327 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=84, PETRI_PLACES=38, PETRI_TRANSITIONS=39} [2024-11-10 10:28:02,332 INFO L277 CegarLoopForPetriNet]: 43 programPoint places, -5 predicate places. [2024-11-10 10:28:02,332 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 39 transitions, 84 flow [2024-11-10 10:28:02,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 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) [2024-11-10 10:28:02,333 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:28:02,333 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:28:02,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 10:28:02,334 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-10 10:28:02,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:28:02,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1256887183, now seen corresponding path program 1 times [2024-11-10 10:28:02,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:28:02,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360577017] [2024-11-10 10:28:02,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:28:02,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:28:02,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:28:02,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:28:02,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:28:02,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360577017] [2024-11-10 10:28:02,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360577017] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:28:02,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:28:02,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 10:28:02,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611412780] [2024-11-10 10:28:02,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:28:02,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 10:28:02,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:28:02,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 10:28:02,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 10:28:02,765 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-11-10 10:28:02,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 39 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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) [2024-11-10 10:28:02,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:28:02,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-11-10 10:28:02,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:28:02,909 INFO L124 PetriNetUnfolderBase]: 38/96 cut-off events. [2024-11-10 10:28:02,909 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-10 10:28:02,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 191 conditions, 96 events. 38/96 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 32 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 188. Up to 85 conditions per place. [2024-11-10 10:28:02,912 INFO L140 encePairwiseOnDemand]: 46/49 looper letters, 28 selfloop transitions, 2 changer transitions 0/40 dead transitions. [2024-11-10 10:28:02,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 40 transitions, 146 flow [2024-11-10 10:28:02,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 10:28:02,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 10:28:02,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2024-11-10 10:28:02,914 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2024-11-10 10:28:02,914 INFO L175 Difference]: Start difference. First operand has 38 places, 39 transitions, 84 flow. Second operand 3 states and 70 transitions. [2024-11-10 10:28:02,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 40 transitions, 146 flow [2024-11-10 10:28:02,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 40 transitions, 146 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 10:28:02,917 INFO L231 Difference]: Finished difference. Result has 41 places, 40 transitions, 96 flow [2024-11-10 10:28:02,919 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=41, PETRI_TRANSITIONS=40} [2024-11-10 10:28:02,919 INFO L277 CegarLoopForPetriNet]: 43 programPoint places, -2 predicate places. [2024-11-10 10:28:02,920 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 40 transitions, 96 flow [2024-11-10 10:28:02,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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) [2024-11-10 10:28:02,921 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:28:02,921 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:28:02,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 10:28:02,922 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-10 10:28:02,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:28:02,923 INFO L85 PathProgramCache]: Analyzing trace with hash -651465930, now seen corresponding path program 1 times [2024-11-10 10:28:02,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:28:02,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036616695] [2024-11-10 10:28:02,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:28:02,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:28:02,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:28:03,134 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 10:28:03,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:28:03,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036616695] [2024-11-10 10:28:03,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036616695] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:28:03,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:28:03,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 10:28:03,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539866895] [2024-11-10 10:28:03,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:28:03,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 10:28:03,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:28:03,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 10:28:03,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:28:03,142 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-11-10 10:28:03,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 40 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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) [2024-11-10 10:28:03,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:28:03,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-11-10 10:28:03,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:28:03,294 INFO L124 PetriNetUnfolderBase]: 38/98 cut-off events. [2024-11-10 10:28:03,294 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-10 10:28:03,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 98 events. 38/98 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 32 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 196. Up to 84 conditions per place. [2024-11-10 10:28:03,296 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 27 selfloop transitions, 4 changer transitions 0/41 dead transitions. [2024-11-10 10:28:03,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 41 transitions, 160 flow [2024-11-10 10:28:03,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 10:28:03,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 10:28:03,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2024-11-10 10:28:03,299 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-11-10 10:28:03,300 INFO L175 Difference]: Start difference. First operand has 41 places, 40 transitions, 96 flow. Second operand 4 states and 84 transitions. [2024-11-10 10:28:03,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 41 transitions, 160 flow [2024-11-10 10:28:03,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 41 transitions, 158 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 10:28:03,301 INFO L231 Difference]: Finished difference. Result has 44 places, 41 transitions, 112 flow [2024-11-10 10:28:03,302 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=112, PETRI_PLACES=44, PETRI_TRANSITIONS=41} [2024-11-10 10:28:03,302 INFO L277 CegarLoopForPetriNet]: 43 programPoint places, 1 predicate places. [2024-11-10 10:28:03,303 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 41 transitions, 112 flow [2024-11-10 10:28:03,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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) [2024-11-10 10:28:03,303 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:28:03,303 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:28:03,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 10:28:03,304 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-10 10:28:03,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:28:03,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1579676864, now seen corresponding path program 1 times [2024-11-10 10:28:03,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:28:03,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677210577] [2024-11-10 10:28:03,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:28:03,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:28:03,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:28:03,462 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 10:28:03,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:28:03,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677210577] [2024-11-10 10:28:03,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677210577] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:28:03,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:28:03,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 10:28:03,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561296399] [2024-11-10 10:28:03,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:28:03,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 10:28:03,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:28:03,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 10:28:03,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:28:03,470 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-11-10 10:28:03,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 41 transitions, 112 flow. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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) [2024-11-10 10:28:03,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:28:03,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-11-10 10:28:03,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:28:03,573 INFO L124 PetriNetUnfolderBase]: 38/100 cut-off events. [2024-11-10 10:28:03,574 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-11-10 10:28:03,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 212 conditions, 100 events. 38/100 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 32 based on Foata normal form. 0/97 useless extension candidates. Maximal degree in co-relation 206. Up to 85 conditions per place. [2024-11-10 10:28:03,576 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 28 selfloop transitions, 4 changer transitions 0/42 dead transitions. [2024-11-10 10:28:03,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 42 transitions, 178 flow [2024-11-10 10:28:03,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 10:28:03,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 10:28:03,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2024-11-10 10:28:03,578 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-11-10 10:28:03,579 INFO L175 Difference]: Start difference. First operand has 44 places, 41 transitions, 112 flow. Second operand 4 states and 84 transitions. [2024-11-10 10:28:03,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 42 transitions, 178 flow [2024-11-10 10:28:03,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 42 transitions, 174 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 10:28:03,581 INFO L231 Difference]: Finished difference. Result has 46 places, 42 transitions, 126 flow [2024-11-10 10:28:03,582 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=126, PETRI_PLACES=46, PETRI_TRANSITIONS=42} [2024-11-10 10:28:03,582 INFO L277 CegarLoopForPetriNet]: 43 programPoint places, 3 predicate places. [2024-11-10 10:28:03,583 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 42 transitions, 126 flow [2024-11-10 10:28:03,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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) [2024-11-10 10:28:03,583 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:28:03,584 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:28:03,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 10:28:03,584 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-10 10:28:03,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:28:03,586 INFO L85 PathProgramCache]: Analyzing trace with hash -537045137, now seen corresponding path program 1 times [2024-11-10 10:28:03,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:28:03,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679130315] [2024-11-10 10:28:03,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:28:03,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:28:03,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:28:03,788 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-10 10:28:03,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:28:03,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679130315] [2024-11-10 10:28:03,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679130315] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:28:03,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:28:03,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 10:28:03,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844936411] [2024-11-10 10:28:03,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:28:03,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 10:28:03,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:28:03,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 10:28:03,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:28:03,797 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-11-10 10:28:03,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 42 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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) [2024-11-10 10:28:03,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:28:03,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-11-10 10:28:03,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:28:03,908 INFO L124 PetriNetUnfolderBase]: 38/102 cut-off events. [2024-11-10 10:28:03,908 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2024-11-10 10:28:03,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 102 events. 38/102 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 32 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 215. Up to 87 conditions per place. [2024-11-10 10:28:03,909 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 30 selfloop transitions, 3 changer transitions 0/43 dead transitions. [2024-11-10 10:28:03,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 43 transitions, 194 flow [2024-11-10 10:28:03,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 10:28:03,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 10:28:03,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2024-11-10 10:28:03,911 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.42346938775510207 [2024-11-10 10:28:03,911 INFO L175 Difference]: Start difference. First operand has 46 places, 42 transitions, 126 flow. Second operand 4 states and 83 transitions. [2024-11-10 10:28:03,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 43 transitions, 194 flow [2024-11-10 10:28:03,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 43 transitions, 190 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 10:28:03,912 INFO L231 Difference]: Finished difference. Result has 48 places, 43 transitions, 136 flow [2024-11-10 10:28:03,913 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=136, PETRI_PLACES=48, PETRI_TRANSITIONS=43} [2024-11-10 10:28:03,913 INFO L277 CegarLoopForPetriNet]: 43 programPoint places, 5 predicate places. [2024-11-10 10:28:03,914 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 43 transitions, 136 flow [2024-11-10 10:28:03,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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) [2024-11-10 10:28:03,914 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:28:03,914 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:28:03,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 10:28:03,915 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-10 10:28:03,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:28:03,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1405959389, now seen corresponding path program 1 times [2024-11-10 10:28:03,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:28:03,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914640181] [2024-11-10 10:28:03,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:28:03,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:28:03,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:28:04,076 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-10 10:28:04,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:28:04,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914640181] [2024-11-10 10:28:04,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914640181] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:28:04,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:28:04,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 10:28:04,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674209048] [2024-11-10 10:28:04,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:28:04,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 10:28:04,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:28:04,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 10:28:04,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:28:04,089 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-11-10 10:28:04,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 43 transitions, 136 flow. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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) [2024-11-10 10:28:04,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:28:04,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-11-10 10:28:04,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:28:04,212 INFO L124 PetriNetUnfolderBase]: 38/104 cut-off events. [2024-11-10 10:28:04,213 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-11-10 10:28:04,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 230 conditions, 104 events. 38/104 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 137 event pairs, 32 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 222. Up to 88 conditions per place. [2024-11-10 10:28:04,214 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 31 selfloop transitions, 3 changer transitions 0/44 dead transitions. [2024-11-10 10:28:04,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 44 transitions, 206 flow [2024-11-10 10:28:04,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 10:28:04,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 10:28:04,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2024-11-10 10:28:04,217 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.42346938775510207 [2024-11-10 10:28:04,217 INFO L175 Difference]: Start difference. First operand has 48 places, 43 transitions, 136 flow. Second operand 4 states and 83 transitions. [2024-11-10 10:28:04,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 44 transitions, 206 flow [2024-11-10 10:28:04,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 44 transitions, 202 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 10:28:04,219 INFO L231 Difference]: Finished difference. Result has 50 places, 44 transitions, 146 flow [2024-11-10 10:28:04,220 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=146, PETRI_PLACES=50, PETRI_TRANSITIONS=44} [2024-11-10 10:28:04,221 INFO L277 CegarLoopForPetriNet]: 43 programPoint places, 7 predicate places. [2024-11-10 10:28:04,222 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 44 transitions, 146 flow [2024-11-10 10:28:04,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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) [2024-11-10 10:28:04,222 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:28:04,223 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:28:04,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 10:28:04,223 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-10 10:28:04,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:28:04,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1953388657, now seen corresponding path program 1 times [2024-11-10 10:28:04,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:28:04,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176948559] [2024-11-10 10:28:04,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:28:04,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:28:04,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:28:04,434 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-10 10:28:04,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:28:04,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176948559] [2024-11-10 10:28:04,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176948559] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:28:04,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:28:04,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 10:28:04,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114092148] [2024-11-10 10:28:04,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:28:04,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 10:28:04,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:28:04,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 10:28:04,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:28:04,442 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-11-10 10:28:04,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 44 transitions, 146 flow. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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) [2024-11-10 10:28:04,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:28:04,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-11-10 10:28:04,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:28:04,530 INFO L124 PetriNetUnfolderBase]: 38/106 cut-off events. [2024-11-10 10:28:04,531 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2024-11-10 10:28:04,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 238 conditions, 106 events. 38/106 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 32 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 229. Up to 89 conditions per place. [2024-11-10 10:28:04,532 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 32 selfloop transitions, 3 changer transitions 0/45 dead transitions. [2024-11-10 10:28:04,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 45 transitions, 218 flow [2024-11-10 10:28:04,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 10:28:04,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 10:28:04,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2024-11-10 10:28:04,534 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.42346938775510207 [2024-11-10 10:28:04,534 INFO L175 Difference]: Start difference. First operand has 50 places, 44 transitions, 146 flow. Second operand 4 states and 83 transitions. [2024-11-10 10:28:04,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 45 transitions, 218 flow [2024-11-10 10:28:04,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 45 transitions, 214 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 10:28:04,536 INFO L231 Difference]: Finished difference. Result has 52 places, 45 transitions, 156 flow [2024-11-10 10:28:04,536 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=156, PETRI_PLACES=52, PETRI_TRANSITIONS=45} [2024-11-10 10:28:04,537 INFO L277 CegarLoopForPetriNet]: 43 programPoint places, 9 predicate places. [2024-11-10 10:28:04,537 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 45 transitions, 156 flow [2024-11-10 10:28:04,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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) [2024-11-10 10:28:04,539 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:28:04,539 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:28:04,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 10:28:04,540 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-10 10:28:04,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:28:04,541 INFO L85 PathProgramCache]: Analyzing trace with hash -541805758, now seen corresponding path program 1 times [2024-11-10 10:28:04,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:28:04,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457460306] [2024-11-10 10:28:04,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:28:04,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:28:04,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:28:07,331 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 10:28:07,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:28:07,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457460306] [2024-11-10 10:28:07,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457460306] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:28:07,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:28:07,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 10:28:07,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55181473] [2024-11-10 10:28:07,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:28:07,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 10:28:07,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:28:07,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 10:28:07,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 10:28:07,334 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 49 [2024-11-10 10:28:07,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 45 transitions, 156 flow. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 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) [2024-11-10 10:28:07,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:28:07,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 49 [2024-11-10 10:28:07,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:28:07,599 INFO L124 PetriNetUnfolderBase]: 39/125 cut-off events. [2024-11-10 10:28:07,599 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2024-11-10 10:28:07,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 278 conditions, 125 events. 39/125 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 282 event pairs, 7 based on Foata normal form. 1/126 useless extension candidates. Maximal degree in co-relation 268. Up to 41 conditions per place. [2024-11-10 10:28:07,601 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 42 selfloop transitions, 2 changer transitions 7/64 dead transitions. [2024-11-10 10:28:07,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 64 transitions, 305 flow [2024-11-10 10:28:07,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 10:28:07,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 10:28:07,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 126 transitions. [2024-11-10 10:28:07,604 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2024-11-10 10:28:07,604 INFO L175 Difference]: Start difference. First operand has 52 places, 45 transitions, 156 flow. Second operand 5 states and 126 transitions. [2024-11-10 10:28:07,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 64 transitions, 305 flow [2024-11-10 10:28:07,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 64 transitions, 301 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 10:28:07,608 INFO L231 Difference]: Finished difference. Result has 57 places, 46 transitions, 167 flow [2024-11-10 10:28:07,609 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=167, PETRI_PLACES=57, PETRI_TRANSITIONS=46} [2024-11-10 10:28:07,610 INFO L277 CegarLoopForPetriNet]: 43 programPoint places, 14 predicate places. [2024-11-10 10:28:07,611 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 46 transitions, 167 flow [2024-11-10 10:28:07,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 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) [2024-11-10 10:28:07,611 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:28:07,613 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:28:07,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 10:28:07,614 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-10 10:28:07,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:28:07,614 INFO L85 PathProgramCache]: Analyzing trace with hash 494580512, now seen corresponding path program 2 times [2024-11-10 10:28:07,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:28:07,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989106768] [2024-11-10 10:28:07,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:28:07,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:28:07,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:28:10,065 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 10:28:10,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:28:10,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989106768] [2024-11-10 10:28:10,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989106768] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:28:10,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:28:10,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 10:28:10,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37313184] [2024-11-10 10:28:10,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:28:10,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 10:28:10,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:28:10,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 10:28:10,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 10:28:10,068 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 49 [2024-11-10 10:28:10,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 46 transitions, 167 flow. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 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) [2024-11-10 10:28:10,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:28:10,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 49 [2024-11-10 10:28:10,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:28:10,322 INFO L124 PetriNetUnfolderBase]: 35/130 cut-off events. [2024-11-10 10:28:10,322 INFO L125 PetriNetUnfolderBase]: For 93/93 co-relation queries the response was YES. [2024-11-10 10:28:10,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 340 conditions, 130 events. 35/130 cut-off events. For 93/93 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 309 event pairs, 10 based on Foata normal form. 1/131 useless extension candidates. Maximal degree in co-relation 327. Up to 48 conditions per place. [2024-11-10 10:28:10,323 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 41 selfloop transitions, 3 changer transitions 5/62 dead transitions. [2024-11-10 10:28:10,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 62 transitions, 315 flow [2024-11-10 10:28:10,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 10:28:10,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 10:28:10,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 123 transitions. [2024-11-10 10:28:10,325 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5020408163265306 [2024-11-10 10:28:10,325 INFO L175 Difference]: Start difference. First operand has 57 places, 46 transitions, 167 flow. Second operand 5 states and 123 transitions. [2024-11-10 10:28:10,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 62 transitions, 315 flow [2024-11-10 10:28:10,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 62 transitions, 308 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-11-10 10:28:10,327 INFO L231 Difference]: Finished difference. Result has 61 places, 47 transitions, 184 flow [2024-11-10 10:28:10,328 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=184, PETRI_PLACES=61, PETRI_TRANSITIONS=47} [2024-11-10 10:28:10,328 INFO L277 CegarLoopForPetriNet]: 43 programPoint places, 18 predicate places. [2024-11-10 10:28:10,328 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 47 transitions, 184 flow [2024-11-10 10:28:10,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 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) [2024-11-10 10:28:10,329 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:28:10,329 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:28:10,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 10:28:10,329 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-10 10:28:10,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:28:10,330 INFO L85 PathProgramCache]: Analyzing trace with hash 173239830, now seen corresponding path program 3 times [2024-11-10 10:28:10,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:28:10,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460890628] [2024-11-10 10:28:10,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:28:10,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:28:10,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:28:12,828 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 10:28:12,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:28:12,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460890628] [2024-11-10 10:28:12,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460890628] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:28:12,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:28:12,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 10:28:12,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367622028] [2024-11-10 10:28:12,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:28:12,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 10:28:12,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:28:12,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 10:28:12,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 10:28:12,830 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 49 [2024-11-10 10:28:12,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 47 transitions, 184 flow. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 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) [2024-11-10 10:28:12,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:28:12,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 49 [2024-11-10 10:28:12,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:28:13,075 INFO L124 PetriNetUnfolderBase]: 35/133 cut-off events. [2024-11-10 10:28:13,076 INFO L125 PetriNetUnfolderBase]: For 199/199 co-relation queries the response was YES. [2024-11-10 10:28:13,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 400 conditions, 133 events. 35/133 cut-off events. For 199/199 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 358 event pairs, 8 based on Foata normal form. 1/134 useless extension candidates. Maximal degree in co-relation 385. Up to 50 conditions per place. [2024-11-10 10:28:13,078 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 40 selfloop transitions, 2 changer transitions 9/64 dead transitions. [2024-11-10 10:28:13,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 64 transitions, 347 flow [2024-11-10 10:28:13,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 10:28:13,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 10:28:13,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 124 transitions. [2024-11-10 10:28:13,079 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5061224489795918 [2024-11-10 10:28:13,080 INFO L175 Difference]: Start difference. First operand has 61 places, 47 transitions, 184 flow. Second operand 5 states and 124 transitions. [2024-11-10 10:28:13,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 64 transitions, 347 flow [2024-11-10 10:28:13,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 64 transitions, 336 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-11-10 10:28:13,084 INFO L231 Difference]: Finished difference. Result has 65 places, 47 transitions, 191 flow [2024-11-10 10:28:13,086 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=191, PETRI_PLACES=65, PETRI_TRANSITIONS=47} [2024-11-10 10:28:13,086 INFO L277 CegarLoopForPetriNet]: 43 programPoint places, 22 predicate places. [2024-11-10 10:28:13,087 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 47 transitions, 191 flow [2024-11-10 10:28:13,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 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) [2024-11-10 10:28:13,087 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:28:13,087 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:28:13,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 10:28:13,087 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-10 10:28:13,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:28:13,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1663218626, now seen corresponding path program 4 times [2024-11-10 10:28:13,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:28:13,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701000946] [2024-11-10 10:28:13,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:28:13,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:28:13,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:28:14,580 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 10:28:14,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:28:14,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701000946] [2024-11-10 10:28:14,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701000946] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:28:14,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:28:14,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 10:28:14,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405652139] [2024-11-10 10:28:14,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:28:14,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 10:28:14,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:28:14,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 10:28:14,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 10:28:14,585 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 49 [2024-11-10 10:28:14,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 47 transitions, 191 flow. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 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) [2024-11-10 10:28:14,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:28:14,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 49 [2024-11-10 10:28:14,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:28:14,856 INFO L124 PetriNetUnfolderBase]: 30/116 cut-off events. [2024-11-10 10:28:14,856 INFO L125 PetriNetUnfolderBase]: For 280/280 co-relation queries the response was YES. [2024-11-10 10:28:14,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 377 conditions, 116 events. 30/116 cut-off events. For 280/280 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 223 event pairs, 15 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 360. Up to 64 conditions per place. [2024-11-10 10:28:14,861 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 40 selfloop transitions, 3 changer transitions 7/63 dead transitions. [2024-11-10 10:28:14,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 63 transitions, 359 flow [2024-11-10 10:28:14,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 10:28:14,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 10:28:14,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 122 transitions. [2024-11-10 10:28:14,863 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.49795918367346936 [2024-11-10 10:28:14,863 INFO L175 Difference]: Start difference. First operand has 65 places, 47 transitions, 191 flow. Second operand 5 states and 122 transitions. [2024-11-10 10:28:14,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 63 transitions, 359 flow [2024-11-10 10:28:14,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 63 transitions, 340 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-11-10 10:28:14,866 INFO L231 Difference]: Finished difference. Result has 67 places, 47 transitions, 198 flow [2024-11-10 10:28:14,867 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=198, PETRI_PLACES=67, PETRI_TRANSITIONS=47} [2024-11-10 10:28:14,869 INFO L277 CegarLoopForPetriNet]: 43 programPoint places, 24 predicate places. [2024-11-10 10:28:14,869 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 47 transitions, 198 flow [2024-11-10 10:28:14,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 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) [2024-11-10 10:28:14,870 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:28:14,870 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:28:14,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 10:28:14,870 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-10 10:28:14,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:28:14,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1523425914, now seen corresponding path program 5 times [2024-11-10 10:28:14,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:28:14,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413653440] [2024-11-10 10:28:14,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:28:14,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:28:15,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:28:16,928 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 10:28:16,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:28:16,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413653440] [2024-11-10 10:28:16,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413653440] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:28:16,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:28:16,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 10:28:16,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781246070] [2024-11-10 10:28:16,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:28:16,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 10:28:16,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:28:16,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 10:28:16,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 10:28:16,932 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 49 [2024-11-10 10:28:16,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 47 transitions, 198 flow. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 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) [2024-11-10 10:28:16,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:28:16,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 49 [2024-11-10 10:28:16,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:28:17,207 INFO L124 PetriNetUnfolderBase]: 24/95 cut-off events. [2024-11-10 10:28:17,208 INFO L125 PetriNetUnfolderBase]: For 190/190 co-relation queries the response was YES. [2024-11-10 10:28:17,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 317 conditions, 95 events. 24/95 cut-off events. For 190/190 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 141 event pairs, 7 based on Foata normal form. 1/96 useless extension candidates. Maximal degree in co-relation 300. Up to 45 conditions per place. [2024-11-10 10:28:17,209 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 33 selfloop transitions, 1 changer transitions 14/61 dead transitions. [2024-11-10 10:28:17,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 61 transitions, 336 flow [2024-11-10 10:28:17,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 10:28:17,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 10:28:17,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 122 transitions. [2024-11-10 10:28:17,212 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.49795918367346936 [2024-11-10 10:28:17,212 INFO L175 Difference]: Start difference. First operand has 67 places, 47 transitions, 198 flow. Second operand 5 states and 122 transitions. [2024-11-10 10:28:17,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 61 transitions, 336 flow [2024-11-10 10:28:17,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 61 transitions, 324 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-11-10 10:28:17,215 INFO L231 Difference]: Finished difference. Result has 68 places, 45 transitions, 177 flow [2024-11-10 10:28:17,215 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=177, PETRI_PLACES=68, PETRI_TRANSITIONS=45} [2024-11-10 10:28:17,218 INFO L277 CegarLoopForPetriNet]: 43 programPoint places, 25 predicate places. [2024-11-10 10:28:17,218 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 45 transitions, 177 flow [2024-11-10 10:28:17,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 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) [2024-11-10 10:28:17,219 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:28:17,219 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:28:17,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 10:28:17,220 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-10 10:28:17,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:28:17,220 INFO L85 PathProgramCache]: Analyzing trace with hash 129362150, now seen corresponding path program 6 times [2024-11-10 10:28:17,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:28:17,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064450862] [2024-11-10 10:28:17,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:28:17,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:28:17,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:28:19,328 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 10:28:19,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:28:19,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064450862] [2024-11-10 10:28:19,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064450862] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:28:19,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:28:19,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 10:28:19,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876291324] [2024-11-10 10:28:19,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:28:19,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 10:28:19,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:28:19,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 10:28:19,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 10:28:19,331 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 49 [2024-11-10 10:28:19,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 45 transitions, 177 flow. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 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) [2024-11-10 10:28:19,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:28:19,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 49 [2024-11-10 10:28:19,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:28:19,530 INFO L124 PetriNetUnfolderBase]: 15/69 cut-off events. [2024-11-10 10:28:19,530 INFO L125 PetriNetUnfolderBase]: For 98/98 co-relation queries the response was YES. [2024-11-10 10:28:19,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 69 events. 15/69 cut-off events. For 98/98 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 45 event pairs, 5 based on Foata normal form. 1/70 useless extension candidates. Maximal degree in co-relation 201. Up to 38 conditions per place. [2024-11-10 10:28:19,530 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 0 selfloop transitions, 0 changer transitions 49/49 dead transitions. [2024-11-10 10:28:19,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 49 transitions, 265 flow [2024-11-10 10:28:19,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 10:28:19,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 10:28:19,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 112 transitions. [2024-11-10 10:28:19,532 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.45714285714285713 [2024-11-10 10:28:19,532 INFO L175 Difference]: Start difference. First operand has 68 places, 45 transitions, 177 flow. Second operand 5 states and 112 transitions. [2024-11-10 10:28:19,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 49 transitions, 265 flow [2024-11-10 10:28:19,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 49 transitions, 247 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-11-10 10:28:19,534 INFO L231 Difference]: Finished difference. Result has 59 places, 0 transitions, 0 flow [2024-11-10 10:28:19,534 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=59, PETRI_TRANSITIONS=0} [2024-11-10 10:28:19,534 INFO L277 CegarLoopForPetriNet]: 43 programPoint places, 16 predicate places. [2024-11-10 10:28:19,535 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 0 transitions, 0 flow [2024-11-10 10:28:19,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 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) [2024-11-10 10:28:19,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2024-11-10 10:28:19,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2024-11-10 10:28:19,539 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-11-10 10:28:19,539 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-11-10 10:28:19,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 10:28:19,539 INFO L407 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:28:19,543 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-10 10:28:19,543 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 10:28:19,548 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 10:28:19 BasicIcfg [2024-11-10 10:28:19,548 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 10:28:19,549 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 10:28:19,549 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 10:28:19,549 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 10:28:19,550 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:28:01" (3/4) ... [2024-11-10 10:28:19,552 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-10 10:28:19,555 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-10 10:28:19,556 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-10 10:28:19,556 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-11-10 10:28:19,571 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 237 nodes and edges [2024-11-10 10:28:19,573 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 117 nodes and edges [2024-11-10 10:28:19,573 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 44 nodes and edges [2024-11-10 10:28:19,574 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-11-10 10:28:19,712 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 10:28:19,713 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-10 10:28:19,713 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 10:28:19,713 INFO L158 Benchmark]: Toolchain (without parser) took 19925.18ms. Allocated memory was 161.5MB in the beginning and 1.0GB in the end (delta: 845.2MB). Free memory was 91.9MB in the beginning and 658.6MB in the end (delta: -566.7MB). Peak memory consumption was 279.8MB. Max. memory is 16.1GB. [2024-11-10 10:28:19,714 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 113.2MB. Free memory is still 73.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 10:28:19,714 INFO L158 Benchmark]: CACSL2BoogieTranslator took 335.40ms. Allocated memory is still 161.5MB. Free memory was 91.9MB in the beginning and 76.6MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 10:28:19,714 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.52ms. Allocated memory is still 161.5MB. Free memory was 76.6MB in the beginning and 73.3MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 10:28:19,714 INFO L158 Benchmark]: Boogie Preprocessor took 87.31ms. Allocated memory is still 161.5MB. Free memory was 73.3MB in the beginning and 69.6MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 10:28:19,714 INFO L158 Benchmark]: IcfgBuilder took 1325.54ms. Allocated memory is still 161.5MB. Free memory was 69.4MB in the beginning and 79.4MB in the end (delta: -10.1MB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. [2024-11-10 10:28:19,715 INFO L158 Benchmark]: TraceAbstraction took 17955.69ms. Allocated memory was 161.5MB in the beginning and 1.0GB in the end (delta: 845.2MB). Free memory was 78.4MB in the beginning and 667.0MB in the end (delta: -588.6MB). Peak memory consumption was 255.5MB. Max. memory is 16.1GB. [2024-11-10 10:28:19,715 INFO L158 Benchmark]: Witness Printer took 163.98ms. Allocated memory is still 1.0GB. Free memory was 667.0MB in the beginning and 658.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-10 10:28:19,716 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.21ms. Allocated memory is still 113.2MB. Free memory is still 73.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 335.40ms. Allocated memory is still 161.5MB. Free memory was 91.9MB in the beginning and 76.6MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.52ms. Allocated memory is still 161.5MB. Free memory was 76.6MB in the beginning and 73.3MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 87.31ms. Allocated memory is still 161.5MB. Free memory was 73.3MB in the beginning and 69.6MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 1325.54ms. Allocated memory is still 161.5MB. Free memory was 69.4MB in the beginning and 79.4MB in the end (delta: -10.1MB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. * TraceAbstraction took 17955.69ms. Allocated memory was 161.5MB in the beginning and 1.0GB in the end (delta: 845.2MB). Free memory was 78.4MB in the beginning and 667.0MB in the end (delta: -588.6MB). Peak memory consumption was 255.5MB. Max. memory is 16.1GB. * Witness Printer took 163.98ms. Allocated memory is still 1.0GB. Free memory was 667.0MB in the beginning and 658.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 109]: 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 7 procedures, 47 locations, 4 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: 17.8s, OverallIterations: 13, TraceHistogramMax: 2, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 228 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 212 mSDsluCounter, 24 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1108 IncrementalHoareTripleChecker+Invalid, 1122 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 15 mSDtfsCounter, 1108 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=198occurred in iteration=11, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 13.2s InterpolantComputationTime, 525 NumberOfCodeBlocks, 525 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 512 ConstructedInterpolants, 0 QuantifiedInterpolants, 3980 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 102/102 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-10 10:28:19,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE