./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/weaver/popl20-counter-determinism.wvr.c --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b8dbc81d Calling Ultimate with: /usr/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/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/weaver/popl20-counter-determinism.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 65bf47faf943da19c0d2d15e35f35ceed9dd68ed50ac4355a0589bd57bf3d155 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 06:16:39,833 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 06:16:39,836 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 06:16:39,875 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 06:16:39,876 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 06:16:39,879 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 06:16:39,881 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 06:16:39,884 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 06:16:39,886 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 06:16:39,890 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 06:16:39,891 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 06:16:39,894 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 06:16:39,894 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 06:16:39,896 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 06:16:39,897 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 06:16:39,901 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 06:16:39,901 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 06:16:39,903 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 06:16:39,906 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 06:16:39,916 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 06:16:39,918 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 06:16:39,919 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 06:16:39,920 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 06:16:39,921 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 06:16:39,929 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 06:16:39,930 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 06:16:39,930 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 06:16:39,931 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 06:16:39,932 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 06:16:39,933 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 06:16:39,933 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 06:16:39,935 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 06:16:39,937 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 06:16:39,937 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 06:16:39,938 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 06:16:39,938 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 06:16:39,939 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 06:16:39,939 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 06:16:39,939 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 06:16:39,940 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 06:16:39,941 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 06:16:39,942 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-30 06:16:39,978 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 06:16:39,978 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 06:16:39,979 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 06:16:39,979 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 06:16:39,980 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 06:16:39,980 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 06:16:39,981 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 06:16:39,981 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 06:16:39,982 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 06:16:39,982 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 06:16:39,983 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 06:16:39,983 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 06:16:39,983 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 06:16:39,983 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 06:16:39,983 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 06:16:39,984 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 06:16:39,984 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 06:16:39,984 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 06:16:39,984 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 06:16:39,984 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 06:16:39,984 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 06:16:39,985 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 06:16:39,985 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 06:16:39,985 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 06:16:39,985 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 06:16:39,986 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 06:16:39,986 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 06:16:39,986 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 06:16:39,986 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 06:16:39,986 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 06:16:39,987 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 06:16:39,987 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 06:16:39,987 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 06:16:39,987 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 06:16:39,987 INFO L138 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.graphml 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 65bf47faf943da19c0d2d15e35f35ceed9dd68ed50ac4355a0589bd57bf3d155 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> TOGETHER [2023-08-30 06:16:40,296 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 06:16:40,317 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 06:16:40,319 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 06:16:40,320 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 06:16:40,324 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 06:16:40,326 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-counter-determinism.wvr.c [2023-08-30 06:16:41,626 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 06:16:41,851 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 06:16:41,851 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-counter-determinism.wvr.c [2023-08-30 06:16:41,857 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05aa10d23/8dcfa8dfdb75408c95ffa446ef3e4d2f/FLAGc49f9964a [2023-08-30 06:16:41,871 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05aa10d23/8dcfa8dfdb75408c95ffa446ef3e4d2f [2023-08-30 06:16:41,874 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 06:16:41,875 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 06:16:41,876 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 06:16:41,876 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 06:16:41,887 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 06:16:41,888 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 06:16:41" (1/1) ... [2023-08-30 06:16:41,889 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c55145f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 06:16:41, skipping insertion in model container [2023-08-30 06:16:41,889 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 06:16:41" (1/1) ... [2023-08-30 06:16:41,895 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 06:16:41,919 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 06:16:42,077 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-counter-determinism.wvr.c[2476,2489] [2023-08-30 06:16:42,086 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 06:16:42,095 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 06:16:42,113 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-counter-determinism.wvr.c[2476,2489] [2023-08-30 06:16:42,115 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 06:16:42,123 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 06:16:42,123 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 06:16:42,129 INFO L208 MainTranslator]: Completed translation [2023-08-30 06:16:42,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 06:16:42 WrapperNode [2023-08-30 06:16:42,130 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 06:16:42,131 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 06:16:42,131 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 06:16:42,131 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 06:16:42,137 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 06:16:42" (1/1) ... [2023-08-30 06:16:42,153 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 06:16:42" (1/1) ... [2023-08-30 06:16:42,186 INFO L138 Inliner]: procedures = 23, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 117 [2023-08-30 06:16:42,187 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 06:16:42,188 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 06:16:42,188 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 06:16:42,189 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 06:16:42,197 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 06:16:42" (1/1) ... [2023-08-30 06:16:42,198 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 06:16:42" (1/1) ... [2023-08-30 06:16:42,211 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 06:16:42" (1/1) ... [2023-08-30 06:16:42,211 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 06:16:42" (1/1) ... [2023-08-30 06:16:42,219 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 06:16:42" (1/1) ... [2023-08-30 06:16:42,229 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 06:16:42" (1/1) ... [2023-08-30 06:16:42,233 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 06:16:42" (1/1) ... [2023-08-30 06:16:42,238 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 06:16:42" (1/1) ... [2023-08-30 06:16:42,241 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 06:16:42,243 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 06:16:42,244 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 06:16:42,245 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 06:16:42,245 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 06:16:42" (1/1) ... [2023-08-30 06:16:42,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 06:16:42,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 06:16:42,279 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-30 06:16:42,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-30 06:16:42,332 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 06:16:42,333 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-30 06:16:42,333 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-30 06:16:42,333 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-30 06:16:42,333 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-30 06:16:42,333 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-30 06:16:42,333 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-30 06:16:42,334 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-08-30 06:16:42,334 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-08-30 06:16:42,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 06:16:42,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 06:16:42,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 06:16:42,334 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 06:16:42,335 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 06:16:42,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 06:16:42,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 06:16:42,335 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-30 06:16:42,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 06:16:42,337 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 06:16:42,462 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 06:16:42,464 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 06:16:42,778 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 06:16:42,833 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 06:16:42,833 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-08-30 06:16:42,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 06:16:42 BoogieIcfgContainer [2023-08-30 06:16:42,836 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 06:16:42,837 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 06:16:42,838 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 06:16:42,841 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 06:16:42,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 06:16:41" (1/3) ... [2023-08-30 06:16:42,842 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15118286 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 06:16:42, skipping insertion in model container [2023-08-30 06:16:42,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 06:16:42" (2/3) ... [2023-08-30 06:16:42,842 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15118286 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 06:16:42, skipping insertion in model container [2023-08-30 06:16:42,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 06:16:42" (3/3) ... [2023-08-30 06:16:42,844 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-counter-determinism.wvr.c [2023-08-30 06:16:42,861 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 06:16:42,861 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2023-08-30 06:16:42,861 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 06:16:42,990 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-08-30 06:16:43,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 140 transitions, 312 flow [2023-08-30 06:16:43,125 INFO L130 PetriNetUnfolder]: 9/136 cut-off events. [2023-08-30 06:16:43,125 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-08-30 06:16:43,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 136 events. 9/136 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 154 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2023-08-30 06:16:43,132 INFO L82 GeneralOperation]: Start removeDead. Operand has 144 places, 140 transitions, 312 flow [2023-08-30 06:16:43,141 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 132 transitions, 288 flow [2023-08-30 06:16:43,145 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 06:16:43,159 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 132 transitions, 288 flow [2023-08-30 06:16:43,166 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 132 transitions, 288 flow [2023-08-30 06:16:43,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 132 transitions, 288 flow [2023-08-30 06:16:43,216 INFO L130 PetriNetUnfolder]: 9/132 cut-off events. [2023-08-30 06:16:43,217 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-08-30 06:16:43,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 132 events. 9/132 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 151 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2023-08-30 06:16:43,223 INFO L119 LiptonReduction]: Number of co-enabled transitions 3160 [2023-08-30 06:16:47,083 INFO L134 LiptonReduction]: Checked pairs total: 3353 [2023-08-30 06:16:47,083 INFO L136 LiptonReduction]: Total number of compositions: 127 [2023-08-30 06:16:47,095 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 06:16:47,100 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@6708abce, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 06:16:47,100 INFO L358 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2023-08-30 06:16:47,102 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-30 06:16:47,103 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 06:16:47,103 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 06:16:47,103 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-30 06:16:47,104 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-30 06:16:47,108 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 06:16:47,108 INFO L85 PathProgramCache]: Analyzing trace with hash 570, now seen corresponding path program 1 times [2023-08-30 06:16:47,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 06:16:47,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590295395] [2023-08-30 06:16:47,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 06:16:47,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 06:16:47,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 06:16:47,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 06:16:47,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 06:16:47,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590295395] [2023-08-30 06:16:47,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590295395] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 06:16:47,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 06:16:47,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-30 06:16:47,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726049213] [2023-08-30 06:16:47,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 06:16:47,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 06:16:47,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 06:16:47,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 06:16:47,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 06:16:47,231 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 267 [2023-08-30 06:16:47,233 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 116 flow. Second operand has 2 states, 2 states have (on average 122.5) internal successors, (245), 2 states have internal predecessors, (245), 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) [2023-08-30 06:16:47,233 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 06:16:47,233 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 267 [2023-08-30 06:16:47,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 06:16:47,540 INFO L130 PetriNetUnfolder]: 2546/3185 cut-off events. [2023-08-30 06:16:47,541 INFO L131 PetriNetUnfolder]: For 71/71 co-relation queries the response was YES. [2023-08-30 06:16:47,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6469 conditions, 3185 events. 2546/3185 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 11469 event pairs, 1193 based on Foata normal form. 0/1500 useless extension candidates. Maximal degree in co-relation 5013. Up to 3159 conditions per place. [2023-08-30 06:16:47,561 INFO L137 encePairwiseOnDemand]: 264/267 looper letters, 39 selfloop transitions, 0 changer transitions 0/43 dead transitions. [2023-08-30 06:16:47,562 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 43 transitions, 188 flow [2023-08-30 06:16:47,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 06:16:47,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 06:16:47,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 286 transitions. [2023-08-30 06:16:47,573 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5355805243445693 [2023-08-30 06:16:47,574 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 286 transitions. [2023-08-30 06:16:47,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 286 transitions. [2023-08-30 06:16:47,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 06:16:47,577 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 286 transitions. [2023-08-30 06:16:47,579 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 143.0) internal successors, (286), 2 states have internal predecessors, (286), 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) [2023-08-30 06:16:47,583 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 267.0) internal successors, (801), 3 states have internal predecessors, (801), 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) [2023-08-30 06:16:47,584 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 267.0) internal successors, (801), 3 states have internal predecessors, (801), 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) [2023-08-30 06:16:47,586 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 116 flow. Second operand 2 states and 286 transitions. [2023-08-30 06:16:47,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 43 transitions, 188 flow [2023-08-30 06:16:47,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 43 transitions, 172 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-08-30 06:16:47,591 INFO L231 Difference]: Finished difference. Result has 45 places, 43 transitions, 94 flow [2023-08-30 06:16:47,593 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=44, 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=2, PETRI_FLOW=94, PETRI_PLACES=45, PETRI_TRANSITIONS=43} [2023-08-30 06:16:47,596 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -10 predicate places. [2023-08-30 06:16:47,597 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 43 transitions, 94 flow [2023-08-30 06:16:47,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 122.5) internal successors, (245), 2 states have internal predecessors, (245), 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) [2023-08-30 06:16:47,597 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 06:16:47,597 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 06:16:47,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 06:16:47,598 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-30 06:16:47,598 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 06:16:47,599 INFO L85 PathProgramCache]: Analyzing trace with hash 561747, now seen corresponding path program 1 times [2023-08-30 06:16:47,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 06:16:47,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141956328] [2023-08-30 06:16:47,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 06:16:47,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 06:16:47,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 06:16:47,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 06:16:47,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 06:16:47,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141956328] [2023-08-30 06:16:47,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141956328] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 06:16:47,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 06:16:47,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 06:16:47,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86022793] [2023-08-30 06:16:47,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 06:16:47,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 06:16:47,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 06:16:47,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 06:16:47,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 06:16:47,926 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 267 [2023-08-30 06:16:47,926 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 43 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 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) [2023-08-30 06:16:47,927 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 06:16:47,927 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 267 [2023-08-30 06:16:47,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 06:16:48,184 INFO L130 PetriNetUnfolder]: 2435/3044 cut-off events. [2023-08-30 06:16:48,184 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2023-08-30 06:16:48,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6104 conditions, 3044 events. 2435/3044 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 10831 event pairs, 1138 based on Foata normal form. 0/1445 useless extension candidates. Maximal degree in co-relation 6101. Up to 3017 conditions per place. [2023-08-30 06:16:48,199 INFO L137 encePairwiseOnDemand]: 264/267 looper letters, 36 selfloop transitions, 1 changer transitions 0/41 dead transitions. [2023-08-30 06:16:48,200 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 41 transitions, 164 flow [2023-08-30 06:16:48,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 06:16:48,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 06:16:48,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 375 transitions. [2023-08-30 06:16:48,202 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4681647940074906 [2023-08-30 06:16:48,203 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 375 transitions. [2023-08-30 06:16:48,203 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 375 transitions. [2023-08-30 06:16:48,203 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 06:16:48,203 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 375 transitions. [2023-08-30 06:16:48,205 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 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) [2023-08-30 06:16:48,207 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 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) [2023-08-30 06:16:48,207 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 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) [2023-08-30 06:16:48,207 INFO L175 Difference]: Start difference. First operand has 45 places, 43 transitions, 94 flow. Second operand 3 states and 375 transitions. [2023-08-30 06:16:48,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 41 transitions, 164 flow [2023-08-30 06:16:48,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 41 transitions, 164 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 06:16:48,209 INFO L231 Difference]: Finished difference. Result has 45 places, 41 transitions, 92 flow [2023-08-30 06:16:48,209 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=45, PETRI_TRANSITIONS=41} [2023-08-30 06:16:48,210 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -10 predicate places. [2023-08-30 06:16:48,210 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 41 transitions, 92 flow [2023-08-30 06:16:48,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 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) [2023-08-30 06:16:48,211 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 06:16:48,211 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 06:16:48,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 06:16:48,211 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-30 06:16:48,212 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 06:16:48,212 INFO L85 PathProgramCache]: Analyzing trace with hash 561748, now seen corresponding path program 1 times [2023-08-30 06:16:48,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 06:16:48,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534773700] [2023-08-30 06:16:48,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 06:16:48,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 06:16:48,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 06:16:48,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 06:16:48,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 06:16:48,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534773700] [2023-08-30 06:16:48,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534773700] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 06:16:48,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 06:16:48,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 06:16:48,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956353951] [2023-08-30 06:16:48,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 06:16:48,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 06:16:48,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 06:16:48,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 06:16:48,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 06:16:48,451 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 267 [2023-08-30 06:16:48,452 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 41 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 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) [2023-08-30 06:16:48,452 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 06:16:48,453 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 267 [2023-08-30 06:16:48,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 06:16:48,676 INFO L130 PetriNetUnfolder]: 2324/2903 cut-off events. [2023-08-30 06:16:48,677 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2023-08-30 06:16:48,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5824 conditions, 2903 events. 2324/2903 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 10214 event pairs, 1083 based on Foata normal form. 0/1390 useless extension candidates. Maximal degree in co-relation 5820. Up to 2876 conditions per place. [2023-08-30 06:16:48,706 INFO L137 encePairwiseOnDemand]: 264/267 looper letters, 34 selfloop transitions, 1 changer transitions 0/39 dead transitions. [2023-08-30 06:16:48,706 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 39 transitions, 158 flow [2023-08-30 06:16:48,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 06:16:48,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 06:16:48,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 370 transitions. [2023-08-30 06:16:48,708 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46192259675405745 [2023-08-30 06:16:48,708 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 370 transitions. [2023-08-30 06:16:48,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 370 transitions. [2023-08-30 06:16:48,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 06:16:48,709 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 370 transitions. [2023-08-30 06:16:48,710 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 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) [2023-08-30 06:16:48,713 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 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) [2023-08-30 06:16:48,714 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 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) [2023-08-30 06:16:48,714 INFO L175 Difference]: Start difference. First operand has 45 places, 41 transitions, 92 flow. Second operand 3 states and 370 transitions. [2023-08-30 06:16:48,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 39 transitions, 158 flow [2023-08-30 06:16:48,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 39 transitions, 157 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 06:16:48,716 INFO L231 Difference]: Finished difference. Result has 44 places, 39 transitions, 89 flow [2023-08-30 06:16:48,717 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=89, PETRI_PLACES=44, PETRI_TRANSITIONS=39} [2023-08-30 06:16:48,718 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -11 predicate places. [2023-08-30 06:16:48,720 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 39 transitions, 89 flow [2023-08-30 06:16:48,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 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) [2023-08-30 06:16:48,721 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 06:16:48,721 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-30 06:16:48,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 06:16:48,722 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-30 06:16:48,722 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 06:16:48,722 INFO L85 PathProgramCache]: Analyzing trace with hash 539853918, now seen corresponding path program 1 times [2023-08-30 06:16:48,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 06:16:48,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985687749] [2023-08-30 06:16:48,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 06:16:48,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 06:16:48,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 06:16:48,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 06:16:48,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 06:16:48,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985687749] [2023-08-30 06:16:48,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985687749] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 06:16:48,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 06:16:48,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 06:16:48,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256020838] [2023-08-30 06:16:48,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 06:16:48,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 06:16:48,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 06:16:48,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 06:16:48,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 06:16:48,848 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 267 [2023-08-30 06:16:48,849 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 39 transitions, 89 flow. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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) [2023-08-30 06:16:48,851 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 06:16:48,852 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 267 [2023-08-30 06:16:48,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 06:16:49,053 INFO L130 PetriNetUnfolder]: 2278/2839 cut-off events. [2023-08-30 06:16:49,053 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2023-08-30 06:16:49,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5697 conditions, 2839 events. 2278/2839 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 9902 event pairs, 1061 based on Foata normal form. 0/1368 useless extension candidates. Maximal degree in co-relation 5693. Up to 2812 conditions per place. [2023-08-30 06:16:49,069 INFO L137 encePairwiseOnDemand]: 264/267 looper letters, 32 selfloop transitions, 1 changer transitions 0/37 dead transitions. [2023-08-30 06:16:49,069 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 37 transitions, 151 flow [2023-08-30 06:16:49,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 06:16:49,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 06:16:49,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 368 transitions. [2023-08-30 06:16:49,071 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45942571785268416 [2023-08-30 06:16:49,071 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 368 transitions. [2023-08-30 06:16:49,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 368 transitions. [2023-08-30 06:16:49,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 06:16:49,072 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 368 transitions. [2023-08-30 06:16:49,073 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 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) [2023-08-30 06:16:49,074 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 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) [2023-08-30 06:16:49,075 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 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) [2023-08-30 06:16:49,075 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 89 flow. Second operand 3 states and 368 transitions. [2023-08-30 06:16:49,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 37 transitions, 151 flow [2023-08-30 06:16:49,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 37 transitions, 150 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 06:16:49,077 INFO L231 Difference]: Finished difference. Result has 43 places, 37 transitions, 86 flow [2023-08-30 06:16:49,077 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=43, PETRI_TRANSITIONS=37} [2023-08-30 06:16:49,078 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -12 predicate places. [2023-08-30 06:16:49,078 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 37 transitions, 86 flow [2023-08-30 06:16:49,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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) [2023-08-30 06:16:49,078 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 06:16:49,078 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-30 06:16:49,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 06:16:49,079 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-30 06:16:49,079 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 06:16:49,079 INFO L85 PathProgramCache]: Analyzing trace with hash 539853917, now seen corresponding path program 1 times [2023-08-30 06:16:49,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 06:16:49,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283847878] [2023-08-30 06:16:49,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 06:16:49,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 06:16:49,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 06:16:49,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 06:16:49,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 06:16:49,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283847878] [2023-08-30 06:16:49,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283847878] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 06:16:49,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 06:16:49,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 06:16:49,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42981800] [2023-08-30 06:16:49,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 06:16:49,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 06:16:49,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 06:16:49,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 06:16:49,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 06:16:49,207 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 267 [2023-08-30 06:16:49,208 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 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) [2023-08-30 06:16:49,208 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 06:16:49,209 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 267 [2023-08-30 06:16:49,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 06:16:49,373 INFO L130 PetriNetUnfolder]: 2232/2775 cut-off events. [2023-08-30 06:16:49,373 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2023-08-30 06:16:49,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5570 conditions, 2775 events. 2232/2775 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 9649 event pairs, 1039 based on Foata normal form. 0/1346 useless extension candidates. Maximal degree in co-relation 5566. Up to 2748 conditions per place. [2023-08-30 06:16:49,389 INFO L137 encePairwiseOnDemand]: 264/267 looper letters, 30 selfloop transitions, 1 changer transitions 0/35 dead transitions. [2023-08-30 06:16:49,390 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 35 transitions, 144 flow [2023-08-30 06:16:49,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 06:16:49,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 06:16:49,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 384 transitions. [2023-08-30 06:16:49,391 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4794007490636704 [2023-08-30 06:16:49,392 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 384 transitions. [2023-08-30 06:16:49,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 384 transitions. [2023-08-30 06:16:49,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 06:16:49,392 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 384 transitions. [2023-08-30 06:16:49,393 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 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) [2023-08-30 06:16:49,394 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 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) [2023-08-30 06:16:49,395 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 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) [2023-08-30 06:16:49,395 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 86 flow. Second operand 3 states and 384 transitions. [2023-08-30 06:16:49,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 35 transitions, 144 flow [2023-08-30 06:16:49,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 35 transitions, 143 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 06:16:49,397 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 83 flow [2023-08-30 06:16:49,397 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=83, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2023-08-30 06:16:49,397 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -13 predicate places. [2023-08-30 06:16:49,398 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 83 flow [2023-08-30 06:16:49,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 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) [2023-08-30 06:16:49,398 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 06:16:49,398 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-30 06:16:49,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 06:16:49,399 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-30 06:16:49,399 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 06:16:49,399 INFO L85 PathProgramCache]: Analyzing trace with hash -891413588, now seen corresponding path program 1 times [2023-08-30 06:16:49,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 06:16:49,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287075279] [2023-08-30 06:16:49,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 06:16:49,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 06:16:49,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 06:16:49,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 06:16:49,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 06:16:49,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287075279] [2023-08-30 06:16:49,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287075279] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 06:16:49,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 06:16:49,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 06:16:49,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205444730] [2023-08-30 06:16:49,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 06:16:49,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 06:16:49,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 06:16:49,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 06:16:49,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 06:16:49,497 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 267 [2023-08-30 06:16:49,498 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 83 flow. Second operand has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 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) [2023-08-30 06:16:49,498 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 06:16:49,498 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 267 [2023-08-30 06:16:49,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 06:16:49,647 INFO L130 PetriNetUnfolder]: 2126/2639 cut-off events. [2023-08-30 06:16:49,648 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2023-08-30 06:16:49,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5299 conditions, 2639 events. 2126/2639 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 9049 event pairs, 989 based on Foata normal form. 0/1296 useless extension candidates. Maximal degree in co-relation 5295. Up to 2612 conditions per place. [2023-08-30 06:16:49,675 INFO L137 encePairwiseOnDemand]: 264/267 looper letters, 28 selfloop transitions, 1 changer transitions 0/33 dead transitions. [2023-08-30 06:16:49,675 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 33 transitions, 137 flow [2023-08-30 06:16:49,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 06:16:49,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 06:16:49,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2023-08-30 06:16:49,677 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4769038701622971 [2023-08-30 06:16:49,677 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 382 transitions. [2023-08-30 06:16:49,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 382 transitions. [2023-08-30 06:16:49,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 06:16:49,678 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 382 transitions. [2023-08-30 06:16:49,679 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 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) [2023-08-30 06:16:49,681 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 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) [2023-08-30 06:16:49,681 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 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) [2023-08-30 06:16:49,681 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 83 flow. Second operand 3 states and 382 transitions. [2023-08-30 06:16:49,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 33 transitions, 137 flow [2023-08-30 06:16:49,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 33 transitions, 136 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 06:16:49,683 INFO L231 Difference]: Finished difference. Result has 41 places, 33 transitions, 80 flow [2023-08-30 06:16:49,683 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=41, PETRI_TRANSITIONS=33} [2023-08-30 06:16:49,684 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -14 predicate places. [2023-08-30 06:16:49,684 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 80 flow [2023-08-30 06:16:49,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 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) [2023-08-30 06:16:49,685 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 06:16:49,685 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-30 06:16:49,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 06:16:49,685 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-30 06:16:49,686 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 06:16:49,686 INFO L85 PathProgramCache]: Analyzing trace with hash -891413586, now seen corresponding path program 1 times [2023-08-30 06:16:49,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 06:16:49,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372768785] [2023-08-30 06:16:49,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 06:16:49,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 06:16:49,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 06:16:49,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 06:16:49,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 06:16:49,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372768785] [2023-08-30 06:16:49,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372768785] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 06:16:49,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 06:16:49,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 06:16:49,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240053564] [2023-08-30 06:16:49,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 06:16:49,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 06:16:49,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 06:16:49,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 06:16:49,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 06:16:49,770 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 267 [2023-08-30 06:16:49,771 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 33 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 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) [2023-08-30 06:16:49,771 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 06:16:49,771 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 267 [2023-08-30 06:16:49,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 06:16:49,949 INFO L130 PetriNetUnfolder]: 2020/2503 cut-off events. [2023-08-30 06:16:49,950 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2023-08-30 06:16:49,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5028 conditions, 2503 events. 2020/2503 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 8506 event pairs, 939 based on Foata normal form. 0/1246 useless extension candidates. Maximal degree in co-relation 5024. Up to 2476 conditions per place. [2023-08-30 06:16:49,964 INFO L137 encePairwiseOnDemand]: 264/267 looper letters, 26 selfloop transitions, 1 changer transitions 0/31 dead transitions. [2023-08-30 06:16:49,964 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 31 transitions, 130 flow [2023-08-30 06:16:49,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 06:16:49,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 06:16:49,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 362 transitions. [2023-08-30 06:16:49,966 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4519350811485643 [2023-08-30 06:16:49,966 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 362 transitions. [2023-08-30 06:16:49,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 362 transitions. [2023-08-30 06:16:49,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 06:16:49,967 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 362 transitions. [2023-08-30 06:16:49,968 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 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) [2023-08-30 06:16:49,969 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 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) [2023-08-30 06:16:49,970 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 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) [2023-08-30 06:16:49,970 INFO L175 Difference]: Start difference. First operand has 41 places, 33 transitions, 80 flow. Second operand 3 states and 362 transitions. [2023-08-30 06:16:49,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 31 transitions, 130 flow [2023-08-30 06:16:49,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 31 transitions, 129 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 06:16:49,971 INFO L231 Difference]: Finished difference. Result has 40 places, 31 transitions, 77 flow [2023-08-30 06:16:49,971 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=77, PETRI_PLACES=40, PETRI_TRANSITIONS=31} [2023-08-30 06:16:49,972 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -15 predicate places. [2023-08-30 06:16:49,972 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 31 transitions, 77 flow [2023-08-30 06:16:49,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 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) [2023-08-30 06:16:49,973 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 06:16:49,973 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 06:16:49,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 06:16:49,973 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-30 06:16:49,974 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 06:16:49,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1949952045, now seen corresponding path program 1 times [2023-08-30 06:16:49,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 06:16:49,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562143880] [2023-08-30 06:16:49,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 06:16:49,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 06:16:49,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 06:16:50,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 06:16:50,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 06:16:50,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562143880] [2023-08-30 06:16:50,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562143880] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 06:16:50,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 06:16:50,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 06:16:50,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430844681] [2023-08-30 06:16:50,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 06:16:50,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 06:16:50,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 06:16:50,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 06:16:50,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-30 06:16:50,264 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 267 [2023-08-30 06:16:50,265 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 77 flow. Second operand has 6 states, 6 states have (on average 100.5) internal successors, (603), 6 states have internal predecessors, (603), 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) [2023-08-30 06:16:50,265 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 06:16:50,265 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 267 [2023-08-30 06:16:50,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 06:16:50,406 INFO L130 PetriNetUnfolder]: 1606/2008 cut-off events. [2023-08-30 06:16:50,406 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2023-08-30 06:16:50,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4039 conditions, 2008 events. 1606/2008 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 6641 event pairs, 741 based on Foata normal form. 0/1048 useless extension candidates. Maximal degree in co-relation 4035. Up to 1981 conditions per place. [2023-08-30 06:16:50,421 INFO L137 encePairwiseOnDemand]: 265/267 looper letters, 25 selfloop transitions, 1 changer transitions 0/30 dead transitions. [2023-08-30 06:16:50,421 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 30 transitions, 127 flow [2023-08-30 06:16:50,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 06:16:50,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 06:16:50,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 324 transitions. [2023-08-30 06:16:50,422 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4044943820224719 [2023-08-30 06:16:50,423 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 324 transitions. [2023-08-30 06:16:50,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 324 transitions. [2023-08-30 06:16:50,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 06:16:50,423 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 324 transitions. [2023-08-30 06:16:50,424 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 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) [2023-08-30 06:16:50,425 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 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) [2023-08-30 06:16:50,426 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 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) [2023-08-30 06:16:50,426 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 77 flow. Second operand 3 states and 324 transitions. [2023-08-30 06:16:50,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 30 transitions, 127 flow [2023-08-30 06:16:50,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 30 transitions, 126 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 06:16:50,427 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 76 flow [2023-08-30 06:16:50,427 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2023-08-30 06:16:50,431 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -15 predicate places. [2023-08-30 06:16:50,431 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 76 flow [2023-08-30 06:16:50,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 100.5) internal successors, (603), 6 states have internal predecessors, (603), 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) [2023-08-30 06:16:50,431 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 06:16:50,432 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 06:16:50,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 06:16:50,432 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-30 06:16:50,439 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 06:16:50,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1949952046, now seen corresponding path program 1 times [2023-08-30 06:16:50,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 06:16:50,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910512017] [2023-08-30 06:16:50,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 06:16:50,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 06:16:50,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 06:16:50,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 06:16:50,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 06:16:50,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910512017] [2023-08-30 06:16:50,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910512017] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 06:16:50,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 06:16:50,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 06:16:50,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231061465] [2023-08-30 06:16:50,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 06:16:50,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 06:16:50,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 06:16:50,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 06:16:50,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 06:16:50,527 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 267 [2023-08-30 06:16:50,528 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 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) [2023-08-30 06:16:50,528 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 06:16:50,528 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 267 [2023-08-30 06:16:50,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 06:16:50,628 INFO L130 PetriNetUnfolder]: 1192/1513 cut-off events. [2023-08-30 06:16:50,629 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2023-08-30 06:16:50,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3050 conditions, 1513 events. 1192/1513 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 4895 event pairs, 543 based on Foata normal form. 0/850 useless extension candidates. Maximal degree in co-relation 3046. Up to 1486 conditions per place. [2023-08-30 06:16:50,637 INFO L137 encePairwiseOnDemand]: 265/267 looper letters, 24 selfloop transitions, 1 changer transitions 0/29 dead transitions. [2023-08-30 06:16:50,637 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 29 transitions, 124 flow [2023-08-30 06:16:50,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 06:16:50,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 06:16:50,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 362 transitions. [2023-08-30 06:16:50,639 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4519350811485643 [2023-08-30 06:16:50,639 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 362 transitions. [2023-08-30 06:16:50,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 362 transitions. [2023-08-30 06:16:50,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 06:16:50,640 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 362 transitions. [2023-08-30 06:16:50,640 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 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) [2023-08-30 06:16:50,642 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 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) [2023-08-30 06:16:50,642 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 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) [2023-08-30 06:16:50,642 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 76 flow. Second operand 3 states and 362 transitions. [2023-08-30 06:16:50,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 29 transitions, 124 flow [2023-08-30 06:16:50,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 29 transitions, 123 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 06:16:50,644 INFO L231 Difference]: Finished difference. Result has 40 places, 29 transitions, 75 flow [2023-08-30 06:16:50,644 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=75, PETRI_PLACES=40, PETRI_TRANSITIONS=29} [2023-08-30 06:16:50,644 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -15 predicate places. [2023-08-30 06:16:50,645 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 75 flow [2023-08-30 06:16:50,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 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) [2023-08-30 06:16:50,645 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 06:16:50,645 INFO L208 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] [2023-08-30 06:16:50,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 06:16:50,646 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-30 06:16:50,646 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 06:16:50,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1815424840, now seen corresponding path program 1 times [2023-08-30 06:16:50,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 06:16:50,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586809387] [2023-08-30 06:16:50,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 06:16:50,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 06:16:50,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 06:16:50,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 06:16:50,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 06:16:50,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586809387] [2023-08-30 06:16:50,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586809387] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 06:16:50,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 06:16:50,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 06:16:50,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873158538] [2023-08-30 06:16:50,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 06:16:50,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 06:16:50,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 06:16:50,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 06:16:50,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 06:16:50,793 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 267 [2023-08-30 06:16:50,793 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 75 flow. Second operand has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 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) [2023-08-30 06:16:50,794 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 06:16:50,794 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 267 [2023-08-30 06:16:50,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 06:16:50,931 INFO L130 PetriNetUnfolder]: 1537/1954 cut-off events. [2023-08-30 06:16:50,931 INFO L131 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2023-08-30 06:16:50,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3956 conditions, 1954 events. 1537/1954 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 6385 event pairs, 141 based on Foata normal form. 1/1124 useless extension candidates. Maximal degree in co-relation 3952. Up to 1733 conditions per place. [2023-08-30 06:16:50,941 INFO L137 encePairwiseOnDemand]: 261/267 looper letters, 41 selfloop transitions, 5 changer transitions 1/51 dead transitions. [2023-08-30 06:16:50,941 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 51 transitions, 220 flow [2023-08-30 06:16:50,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 06:16:50,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 06:16:50,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 408 transitions. [2023-08-30 06:16:50,943 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5093632958801498 [2023-08-30 06:16:50,943 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 408 transitions. [2023-08-30 06:16:50,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 408 transitions. [2023-08-30 06:16:50,944 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 06:16:50,944 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 408 transitions. [2023-08-30 06:16:50,945 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 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) [2023-08-30 06:16:50,946 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 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) [2023-08-30 06:16:50,946 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 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) [2023-08-30 06:16:50,946 INFO L175 Difference]: Start difference. First operand has 40 places, 29 transitions, 75 flow. Second operand 3 states and 408 transitions. [2023-08-30 06:16:50,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 51 transitions, 220 flow [2023-08-30 06:16:50,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 51 transitions, 219 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 06:16:50,948 INFO L231 Difference]: Finished difference. Result has 42 places, 33 transitions, 107 flow [2023-08-30 06:16:50,948 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=107, PETRI_PLACES=42, PETRI_TRANSITIONS=33} [2023-08-30 06:16:50,949 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -13 predicate places. [2023-08-30 06:16:50,949 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 33 transitions, 107 flow [2023-08-30 06:16:50,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 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) [2023-08-30 06:16:50,949 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 06:16:50,950 INFO L208 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] [2023-08-30 06:16:50,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 06:16:50,950 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-30 06:16:50,950 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 06:16:50,951 INFO L85 PathProgramCache]: Analyzing trace with hash 207547760, now seen corresponding path program 1 times [2023-08-30 06:16:50,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 06:16:50,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841316871] [2023-08-30 06:16:50,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 06:16:50,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 06:16:50,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 06:16:51,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 06:16:51,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 06:16:51,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841316871] [2023-08-30 06:16:51,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841316871] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 06:16:51,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 06:16:51,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 06:16:51,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161316615] [2023-08-30 06:16:51,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 06:16:51,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 06:16:51,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 06:16:51,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 06:16:51,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 06:16:51,043 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 267 [2023-08-30 06:16:51,044 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 107 flow. Second operand has 5 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 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) [2023-08-30 06:16:51,044 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 06:16:51,044 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 267 [2023-08-30 06:16:51,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 06:16:51,347 INFO L130 PetriNetUnfolder]: 2510/3336 cut-off events. [2023-08-30 06:16:51,347 INFO L131 PetriNetUnfolder]: For 897/897 co-relation queries the response was YES. [2023-08-30 06:16:51,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8203 conditions, 3336 events. 2510/3336 cut-off events. For 897/897 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 14071 event pairs, 567 based on Foata normal form. 34/3306 useless extension candidates. Maximal degree in co-relation 8198. Up to 1535 conditions per place. [2023-08-30 06:16:51,364 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 88 selfloop transitions, 5 changer transitions 0/95 dead transitions. [2023-08-30 06:16:51,365 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 95 transitions, 478 flow [2023-08-30 06:16:51,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 06:16:51,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 06:16:51,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 652 transitions. [2023-08-30 06:16:51,367 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4883895131086142 [2023-08-30 06:16:51,367 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 652 transitions. [2023-08-30 06:16:51,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 652 transitions. [2023-08-30 06:16:51,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 06:16:51,368 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 652 transitions. [2023-08-30 06:16:51,369 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.4) internal successors, (652), 5 states have internal predecessors, (652), 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) [2023-08-30 06:16:51,371 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 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) [2023-08-30 06:16:51,371 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 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) [2023-08-30 06:16:51,372 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 107 flow. Second operand 5 states and 652 transitions. [2023-08-30 06:16:51,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 95 transitions, 478 flow [2023-08-30 06:16:51,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 95 transitions, 465 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 06:16:51,376 INFO L231 Difference]: Finished difference. Result has 48 places, 36 transitions, 137 flow [2023-08-30 06:16:51,376 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=137, PETRI_PLACES=48, PETRI_TRANSITIONS=36} [2023-08-30 06:16:51,376 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -7 predicate places. [2023-08-30 06:16:51,377 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 36 transitions, 137 flow [2023-08-30 06:16:51,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 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) [2023-08-30 06:16:51,377 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 06:16:51,377 INFO L208 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] [2023-08-30 06:16:51,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 06:16:51,378 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-30 06:16:51,378 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 06:16:51,378 INFO L85 PathProgramCache]: Analyzing trace with hash 767799170, now seen corresponding path program 2 times [2023-08-30 06:16:51,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 06:16:51,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341168979] [2023-08-30 06:16:51,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 06:16:51,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 06:16:51,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 06:16:51,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 06:16:51,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 06:16:51,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341168979] [2023-08-30 06:16:51,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341168979] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 06:16:51,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005524660] [2023-08-30 06:16:51,441 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 06:16:51,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 06:16:51,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 06:16:51,449 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 06:16:51,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-30 06:16:51,574 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 06:16:51,574 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 06:16:51,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-30 06:16:51,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 06:16:51,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 06:16:51,679 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 06:16:51,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 06:16:51,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005524660] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 06:16:51,728 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 06:16:51,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-08-30 06:16:51,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870917624] [2023-08-30 06:16:51,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 06:16:51,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 06:16:51,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 06:16:51,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 06:16:51,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-08-30 06:16:51,804 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 267 [2023-08-30 06:16:51,805 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 36 transitions, 137 flow. Second operand has 8 states, 8 states have (on average 115.875) internal successors, (927), 8 states have internal predecessors, (927), 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) [2023-08-30 06:16:51,806 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 06:16:51,806 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 267 [2023-08-30 06:16:51,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 06:16:52,246 INFO L130 PetriNetUnfolder]: 3461/4613 cut-off events. [2023-08-30 06:16:52,246 INFO L131 PetriNetUnfolder]: For 3342/3760 co-relation queries the response was YES. [2023-08-30 06:16:52,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12816 conditions, 4613 events. 3461/4613 cut-off events. For 3342/3760 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 20093 event pairs, 743 based on Foata normal form. 507/5092 useless extension candidates. Maximal degree in co-relation 12808. Up to 2186 conditions per place. [2023-08-30 06:16:52,269 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 89 selfloop transitions, 6 changer transitions 0/97 dead transitions. [2023-08-30 06:16:52,270 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 97 transitions, 538 flow [2023-08-30 06:16:52,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 06:16:52,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 06:16:52,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 640 transitions. [2023-08-30 06:16:52,272 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4794007490636704 [2023-08-30 06:16:52,272 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 640 transitions. [2023-08-30 06:16:52,273 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 640 transitions. [2023-08-30 06:16:52,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 06:16:52,273 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 640 transitions. [2023-08-30 06:16:52,275 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.0) internal successors, (640), 5 states have internal predecessors, (640), 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) [2023-08-30 06:16:52,276 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 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) [2023-08-30 06:16:52,277 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 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) [2023-08-30 06:16:52,277 INFO L175 Difference]: Start difference. First operand has 48 places, 36 transitions, 137 flow. Second operand 5 states and 640 transitions. [2023-08-30 06:16:52,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 97 transitions, 538 flow [2023-08-30 06:16:52,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 97 transitions, 519 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-30 06:16:52,281 INFO L231 Difference]: Finished difference. Result has 54 places, 39 transitions, 172 flow [2023-08-30 06:16:52,281 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=172, PETRI_PLACES=54, PETRI_TRANSITIONS=39} [2023-08-30 06:16:52,282 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -1 predicate places. [2023-08-30 06:16:52,282 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 39 transitions, 172 flow [2023-08-30 06:16:52,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 115.875) internal successors, (927), 8 states have internal predecessors, (927), 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) [2023-08-30 06:16:52,283 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 06:16:52,283 INFO L208 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] [2023-08-30 06:16:52,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-30 06:16:52,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-08-30 06:16:52,489 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-30 06:16:52,489 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 06:16:52,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1486827478, now seen corresponding path program 3 times [2023-08-30 06:16:52,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 06:16:52,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916731847] [2023-08-30 06:16:52,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 06:16:52,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 06:16:52,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 06:16:52,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 06:16:52,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 06:16:52,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916731847] [2023-08-30 06:16:52,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916731847] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 06:16:52,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 06:16:52,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 06:16:52,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950645911] [2023-08-30 06:16:52,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 06:16:52,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 06:16:52,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 06:16:52,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 06:16:52,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 06:16:52,629 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 267 [2023-08-30 06:16:52,630 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 39 transitions, 172 flow. Second operand has 5 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 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) [2023-08-30 06:16:52,630 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 06:16:52,630 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 267 [2023-08-30 06:16:52,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 06:16:53,253 INFO L130 PetriNetUnfolder]: 5074/6883 cut-off events. [2023-08-30 06:16:53,253 INFO L131 PetriNetUnfolder]: For 9066/9653 co-relation queries the response was YES. [2023-08-30 06:16:53,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20615 conditions, 6883 events. 5074/6883 cut-off events. For 9066/9653 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 34237 event pairs, 1521 based on Foata normal form. 619/7423 useless extension candidates. Maximal degree in co-relation 20604. Up to 3592 conditions per place. [2023-08-30 06:16:53,289 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 97 selfloop transitions, 8 changer transitions 0/107 dead transitions. [2023-08-30 06:16:53,289 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 107 transitions, 663 flow [2023-08-30 06:16:53,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 06:16:53,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 06:16:53,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 648 transitions. [2023-08-30 06:16:53,291 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4853932584269663 [2023-08-30 06:16:53,292 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 648 transitions. [2023-08-30 06:16:53,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 648 transitions. [2023-08-30 06:16:53,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 06:16:53,292 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 648 transitions. [2023-08-30 06:16:53,294 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.6) internal successors, (648), 5 states have internal predecessors, (648), 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) [2023-08-30 06:16:53,296 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 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) [2023-08-30 06:16:53,296 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 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) [2023-08-30 06:16:53,296 INFO L175 Difference]: Start difference. First operand has 54 places, 39 transitions, 172 flow. Second operand 5 states and 648 transitions. [2023-08-30 06:16:53,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 107 transitions, 663 flow [2023-08-30 06:16:53,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 107 transitions, 649 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-08-30 06:16:53,305 INFO L231 Difference]: Finished difference. Result has 60 places, 43 transitions, 229 flow [2023-08-30 06:16:53,306 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=229, PETRI_PLACES=60, PETRI_TRANSITIONS=43} [2023-08-30 06:16:53,306 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 5 predicate places. [2023-08-30 06:16:53,306 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 43 transitions, 229 flow [2023-08-30 06:16:53,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 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) [2023-08-30 06:16:53,307 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 06:16:53,307 INFO L208 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] [2023-08-30 06:16:53,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 06:16:53,307 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-30 06:16:53,308 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 06:16:53,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1385284445, now seen corresponding path program 1 times [2023-08-30 06:16:53,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 06:16:53,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025759028] [2023-08-30 06:16:53,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 06:16:53,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 06:16:53,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 06:16:53,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 06:16:53,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 06:16:53,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025759028] [2023-08-30 06:16:53,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025759028] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 06:16:53,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 06:16:53,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 06:16:53,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437364772] [2023-08-30 06:16:53,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 06:16:53,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 06:16:53,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 06:16:53,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 06:16:53,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-30 06:16:53,411 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 267 [2023-08-30 06:16:53,412 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 43 transitions, 229 flow. Second operand has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 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) [2023-08-30 06:16:53,412 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 06:16:53,412 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 267 [2023-08-30 06:16:53,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 06:16:54,316 INFO L130 PetriNetUnfolder]: 6819/9240 cut-off events. [2023-08-30 06:16:54,316 INFO L131 PetriNetUnfolder]: For 19138/20147 co-relation queries the response was YES. [2023-08-30 06:16:54,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31070 conditions, 9240 events. 6819/9240 cut-off events. For 19138/20147 co-relation queries the response was YES. Maximal size of possible extension queue 523. Compared 47660 event pairs, 1800 based on Foata normal form. 1026/10065 useless extension candidates. Maximal degree in co-relation 31056. Up to 3709 conditions per place. [2023-08-30 06:16:54,376 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 107 selfloop transitions, 12 changer transitions 0/122 dead transitions. [2023-08-30 06:16:54,377 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 122 transitions, 799 flow [2023-08-30 06:16:54,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 06:16:54,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 06:16:54,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 658 transitions. [2023-08-30 06:16:54,380 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49288389513108616 [2023-08-30 06:16:54,380 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 658 transitions. [2023-08-30 06:16:54,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 658 transitions. [2023-08-30 06:16:54,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 06:16:54,380 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 658 transitions. [2023-08-30 06:16:54,382 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 131.6) internal successors, (658), 5 states have internal predecessors, (658), 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) [2023-08-30 06:16:54,385 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 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) [2023-08-30 06:16:54,385 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 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) [2023-08-30 06:16:54,385 INFO L175 Difference]: Start difference. First operand has 60 places, 43 transitions, 229 flow. Second operand 5 states and 658 transitions. [2023-08-30 06:16:54,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 122 transitions, 799 flow [2023-08-30 06:16:54,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 122 transitions, 759 flow, removed 15 selfloop flow, removed 1 redundant places. [2023-08-30 06:16:54,422 INFO L231 Difference]: Finished difference. Result has 66 places, 49 transitions, 311 flow [2023-08-30 06:16:54,422 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=311, PETRI_PLACES=66, PETRI_TRANSITIONS=49} [2023-08-30 06:16:54,422 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 11 predicate places. [2023-08-30 06:16:54,423 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 49 transitions, 311 flow [2023-08-30 06:16:54,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 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) [2023-08-30 06:16:54,423 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 06:16:54,423 INFO L208 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] [2023-08-30 06:16:54,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-30 06:16:54,423 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-30 06:16:54,424 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 06:16:54,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1717524940, now seen corresponding path program 4 times [2023-08-30 06:16:54,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 06:16:54,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878007138] [2023-08-30 06:16:54,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 06:16:54,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 06:16:54,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 06:16:54,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 06:16:54,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 06:16:54,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878007138] [2023-08-30 06:16:54,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878007138] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 06:16:54,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091072638] [2023-08-30 06:16:54,511 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-30 06:16:54,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 06:16:54,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 06:16:54,513 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 06:16:54,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-30 06:16:54,620 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-30 06:16:54,621 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 06:16:54,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-30 06:16:54,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 06:16:54,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 06:16:54,680 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 06:16:54,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 06:16:54,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1091072638] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 06:16:54,714 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 06:16:54,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-08-30 06:16:54,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553493702] [2023-08-30 06:16:54,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 06:16:54,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-30 06:16:54,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 06:16:54,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-30 06:16:54,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-08-30 06:16:54,807 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 267 [2023-08-30 06:16:54,808 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 49 transitions, 311 flow. Second operand has 10 states, 10 states have (on average 115.4) internal successors, (1154), 10 states have internal predecessors, (1154), 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) [2023-08-30 06:16:54,808 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 06:16:54,808 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 267 [2023-08-30 06:16:54,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 06:16:55,747 INFO L130 PetriNetUnfolder]: 7477/10190 cut-off events. [2023-08-30 06:16:55,747 INFO L131 PetriNetUnfolder]: For 23311/24335 co-relation queries the response was YES. [2023-08-30 06:16:55,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34676 conditions, 10190 events. 7477/10190 cut-off events. For 23311/24335 co-relation queries the response was YES. Maximal size of possible extension queue 574. Compared 52890 event pairs, 2146 based on Foata normal form. 1137/11105 useless extension candidates. Maximal degree in co-relation 34659. Up to 4817 conditions per place. [2023-08-30 06:16:55,803 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 107 selfloop transitions, 15 changer transitions 0/125 dead transitions. [2023-08-30 06:16:55,803 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 125 transitions, 881 flow [2023-08-30 06:16:55,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 06:16:55,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 06:16:55,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 651 transitions. [2023-08-30 06:16:55,807 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48764044943820223 [2023-08-30 06:16:55,807 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 651 transitions. [2023-08-30 06:16:55,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 651 transitions. [2023-08-30 06:16:55,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 06:16:55,808 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 651 transitions. [2023-08-30 06:16:55,809 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.2) internal successors, (651), 5 states have internal predecessors, (651), 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) [2023-08-30 06:16:55,811 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 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) [2023-08-30 06:16:55,811 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 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) [2023-08-30 06:16:55,811 INFO L175 Difference]: Start difference. First operand has 66 places, 49 transitions, 311 flow. Second operand 5 states and 651 transitions. [2023-08-30 06:16:55,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 125 transitions, 881 flow [2023-08-30 06:16:55,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 125 transitions, 849 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-30 06:16:55,838 INFO L231 Difference]: Finished difference. Result has 71 places, 56 transitions, 412 flow [2023-08-30 06:16:55,838 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=412, PETRI_PLACES=71, PETRI_TRANSITIONS=56} [2023-08-30 06:16:55,839 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 16 predicate places. [2023-08-30 06:16:55,839 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 56 transitions, 412 flow [2023-08-30 06:16:55,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 115.4) internal successors, (1154), 10 states have internal predecessors, (1154), 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) [2023-08-30 06:16:55,840 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 06:16:55,840 INFO L208 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] [2023-08-30 06:16:55,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-30 06:16:56,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-08-30 06:16:56,046 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-30 06:16:56,046 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 06:16:56,046 INFO L85 PathProgramCache]: Analyzing trace with hash 121399556, now seen corresponding path program 5 times [2023-08-30 06:16:56,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 06:16:56,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315855281] [2023-08-30 06:16:56,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 06:16:56,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 06:16:56,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 06:16:56,121 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 06:16:56,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 06:16:56,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315855281] [2023-08-30 06:16:56,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315855281] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 06:16:56,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51545799] [2023-08-30 06:16:56,122 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-30 06:16:56,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 06:16:56,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 06:16:56,123 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 06:16:56,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-30 06:16:56,217 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 06:16:56,217 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 06:16:56,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-30 06:16:56,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 06:16:56,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 06:16:56,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 06:16:56,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 06:16:56,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [51545799] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 06:16:56,287 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 06:16:56,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-08-30 06:16:56,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624694459] [2023-08-30 06:16:56,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 06:16:56,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 06:16:56,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 06:16:56,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 06:16:56,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-08-30 06:16:56,343 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 267 [2023-08-30 06:16:56,344 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 56 transitions, 412 flow. Second operand has 8 states, 8 states have (on average 116.125) internal successors, (929), 8 states have internal predecessors, (929), 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) [2023-08-30 06:16:56,344 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 06:16:56,344 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 267 [2023-08-30 06:16:56,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 06:16:57,379 INFO L130 PetriNetUnfolder]: 8095/10930 cut-off events. [2023-08-30 06:16:57,379 INFO L131 PetriNetUnfolder]: For 26014/27098 co-relation queries the response was YES. [2023-08-30 06:16:57,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39061 conditions, 10930 events. 8095/10930 cut-off events. For 26014/27098 co-relation queries the response was YES. Maximal size of possible extension queue 630. Compared 57517 event pairs, 1572 based on Foata normal form. 1172/11959 useless extension candidates. Maximal degree in co-relation 39041. Up to 5493 conditions per place. [2023-08-30 06:16:57,451 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 100 selfloop transitions, 15 changer transitions 0/118 dead transitions. [2023-08-30 06:16:57,451 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 118 transitions, 898 flow [2023-08-30 06:16:57,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 06:16:57,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 06:16:57,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 640 transitions. [2023-08-30 06:16:57,454 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4794007490636704 [2023-08-30 06:16:57,454 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 640 transitions. [2023-08-30 06:16:57,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 640 transitions. [2023-08-30 06:16:57,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 06:16:57,454 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 640 transitions. [2023-08-30 06:16:57,456 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.0) internal successors, (640), 5 states have internal predecessors, (640), 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) [2023-08-30 06:16:57,458 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 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) [2023-08-30 06:16:57,458 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 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) [2023-08-30 06:16:57,458 INFO L175 Difference]: Start difference. First operand has 71 places, 56 transitions, 412 flow. Second operand 5 states and 640 transitions. [2023-08-30 06:16:57,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 118 transitions, 898 flow [2023-08-30 06:16:57,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 118 transitions, 876 flow, removed 5 selfloop flow, removed 1 redundant places. [2023-08-30 06:16:57,504 INFO L231 Difference]: Finished difference. Result has 76 places, 58 transitions, 456 flow [2023-08-30 06:16:57,504 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=393, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=456, PETRI_PLACES=76, PETRI_TRANSITIONS=58} [2023-08-30 06:16:57,505 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 21 predicate places. [2023-08-30 06:16:57,505 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 58 transitions, 456 flow [2023-08-30 06:16:57,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 116.125) internal successors, (929), 8 states have internal predecessors, (929), 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) [2023-08-30 06:16:57,505 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 06:16:57,506 INFO L208 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] [2023-08-30 06:16:57,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-30 06:16:57,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 06:16:57,711 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-30 06:16:57,712 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 06:16:57,712 INFO L85 PathProgramCache]: Analyzing trace with hash 389338049, now seen corresponding path program 2 times [2023-08-30 06:16:57,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 06:16:57,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649047356] [2023-08-30 06:16:57,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 06:16:57,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 06:16:57,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 06:16:57,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 06:16:57,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 06:16:57,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649047356] [2023-08-30 06:16:57,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649047356] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 06:16:57,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129775533] [2023-08-30 06:16:57,794 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 06:16:57,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 06:16:57,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 06:16:57,795 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 06:16:57,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-30 06:16:57,912 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 06:16:57,913 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 06:16:57,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-30 06:16:57,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 06:16:57,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 06:16:57,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 06:16:57,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 06:16:57,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1129775533] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 06:16:57,966 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 06:16:57,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-08-30 06:16:57,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156064745] [2023-08-30 06:16:57,967 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 06:16:57,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 06:16:57,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 06:16:57,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 06:16:57,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-08-30 06:16:58,014 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 267 [2023-08-30 06:16:58,015 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 58 transitions, 456 flow. Second operand has 8 states, 8 states have (on average 115.875) internal successors, (927), 8 states have internal predecessors, (927), 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) [2023-08-30 06:16:58,016 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 06:16:58,016 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 267 [2023-08-30 06:16:58,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 06:16:58,976 INFO L130 PetriNetUnfolder]: 8305/11430 cut-off events. [2023-08-30 06:16:58,976 INFO L131 PetriNetUnfolder]: For 35137/36517 co-relation queries the response was YES. [2023-08-30 06:16:59,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41668 conditions, 11430 events. 8305/11430 cut-off events. For 35137/36517 co-relation queries the response was YES. Maximal size of possible extension queue 577. Compared 59915 event pairs, 1475 based on Foata normal form. 1531/12772 useless extension candidates. Maximal degree in co-relation 41646. Up to 5606 conditions per place. [2023-08-30 06:16:59,047 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 99 selfloop transitions, 13 changer transitions 0/120 dead transitions. [2023-08-30 06:16:59,048 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 120 transitions, 958 flow [2023-08-30 06:16:59,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 06:16:59,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 06:16:59,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 638 transitions. [2023-08-30 06:16:59,050 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4779026217228464 [2023-08-30 06:16:59,050 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 638 transitions. [2023-08-30 06:16:59,050 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 638 transitions. [2023-08-30 06:16:59,051 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 06:16:59,051 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 638 transitions. [2023-08-30 06:16:59,052 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 127.6) internal successors, (638), 5 states have internal predecessors, (638), 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) [2023-08-30 06:16:59,054 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 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) [2023-08-30 06:16:59,055 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 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) [2023-08-30 06:16:59,055 INFO L175 Difference]: Start difference. First operand has 76 places, 58 transitions, 456 flow. Second operand 5 states and 638 transitions. [2023-08-30 06:16:59,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 120 transitions, 958 flow [2023-08-30 06:16:59,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 120 transitions, 932 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-30 06:16:59,108 INFO L231 Difference]: Finished difference. Result has 80 places, 60 transitions, 483 flow [2023-08-30 06:16:59,109 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=483, PETRI_PLACES=80, PETRI_TRANSITIONS=60} [2023-08-30 06:16:59,109 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 25 predicate places. [2023-08-30 06:16:59,109 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 60 transitions, 483 flow [2023-08-30 06:16:59,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 115.875) internal successors, (927), 8 states have internal predecessors, (927), 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) [2023-08-30 06:16:59,110 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 06:16:59,110 INFO L208 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] [2023-08-30 06:16:59,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-30 06:16:59,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-08-30 06:16:59,316 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-30 06:16:59,316 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 06:16:59,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1551309662, now seen corresponding path program 1 times [2023-08-30 06:16:59,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 06:16:59,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933954824] [2023-08-30 06:16:59,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 06:16:59,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 06:16:59,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 06:16:59,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 06:16:59,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 06:16:59,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933954824] [2023-08-30 06:16:59,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933954824] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 06:16:59,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 06:16:59,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 06:16:59,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357476844] [2023-08-30 06:16:59,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 06:16:59,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 06:16:59,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 06:16:59,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 06:16:59,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 06:16:59,406 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 267 [2023-08-30 06:16:59,407 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 60 transitions, 483 flow. Second operand has 5 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 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) [2023-08-30 06:16:59,407 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 06:16:59,407 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 267 [2023-08-30 06:16:59,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 06:17:00,414 INFO L130 PetriNetUnfolder]: 9253/12713 cut-off events. [2023-08-30 06:17:00,414 INFO L131 PetriNetUnfolder]: For 53007/54739 co-relation queries the response was YES. [2023-08-30 06:17:00,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49995 conditions, 12713 events. 9253/12713 cut-off events. For 53007/54739 co-relation queries the response was YES. Maximal size of possible extension queue 692. Compared 69045 event pairs, 1923 based on Foata normal form. 1651/14072 useless extension candidates. Maximal degree in co-relation 49971. Up to 5537 conditions per place. [2023-08-30 06:17:00,477 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 116 selfloop transitions, 15 changer transitions 0/136 dead transitions. [2023-08-30 06:17:00,478 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 136 transitions, 1124 flow [2023-08-30 06:17:00,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 06:17:00,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 06:17:00,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 652 transitions. [2023-08-30 06:17:00,480 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4883895131086142 [2023-08-30 06:17:00,480 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 652 transitions. [2023-08-30 06:17:00,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 652 transitions. [2023-08-30 06:17:00,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 06:17:00,480 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 652 transitions. [2023-08-30 06:17:00,482 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.4) internal successors, (652), 5 states have internal predecessors, (652), 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) [2023-08-30 06:17:00,483 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 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) [2023-08-30 06:17:00,484 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 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) [2023-08-30 06:17:00,484 INFO L175 Difference]: Start difference. First operand has 80 places, 60 transitions, 483 flow. Second operand 5 states and 652 transitions. [2023-08-30 06:17:00,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 136 transitions, 1124 flow [2023-08-30 06:17:00,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 136 transitions, 1094 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-30 06:17:00,549 INFO L231 Difference]: Finished difference. Result has 85 places, 62 transitions, 532 flow [2023-08-30 06:17:00,549 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=467, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=532, PETRI_PLACES=85, PETRI_TRANSITIONS=62} [2023-08-30 06:17:00,549 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 30 predicate places. [2023-08-30 06:17:00,549 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 62 transitions, 532 flow [2023-08-30 06:17:00,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 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) [2023-08-30 06:17:00,550 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 06:17:00,550 INFO L208 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] [2023-08-30 06:17:00,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-30 06:17:00,550 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-30 06:17:00,550 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 06:17:00,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1124083191, now seen corresponding path program 3 times [2023-08-30 06:17:00,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 06:17:00,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965534698] [2023-08-30 06:17:00,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 06:17:00,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 06:17:00,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 06:17:00,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 06:17:00,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 06:17:00,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965534698] [2023-08-30 06:17:00,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965534698] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 06:17:00,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131393260] [2023-08-30 06:17:00,613 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 06:17:00,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 06:17:00,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 06:17:00,617 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 06:17:00,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-30 06:17:00,733 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-30 06:17:00,733 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 06:17:00,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-30 06:17:00,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 06:17:00,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 06:17:00,781 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 06:17:00,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 06:17:00,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2131393260] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 06:17:00,810 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 06:17:00,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-08-30 06:17:00,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273809227] [2023-08-30 06:17:00,811 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 06:17:00,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-30 06:17:00,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 06:17:00,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-30 06:17:00,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-08-30 06:17:00,860 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 267 [2023-08-30 06:17:00,861 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 62 transitions, 532 flow. Second operand has 10 states, 10 states have (on average 116.0) internal successors, (1160), 10 states have internal predecessors, (1160), 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) [2023-08-30 06:17:00,862 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 06:17:00,862 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 267 [2023-08-30 06:17:00,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 06:17:02,634 INFO L130 PetriNetUnfolder]: 15721/21933 cut-off events. [2023-08-30 06:17:02,635 INFO L131 PetriNetUnfolder]: For 81160/82718 co-relation queries the response was YES. [2023-08-30 06:17:02,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89421 conditions, 21933 events. 15721/21933 cut-off events. For 81160/82718 co-relation queries the response was YES. Maximal size of possible extension queue 1138. Compared 130086 event pairs, 2315 based on Foata normal form. 1836/23221 useless extension candidates. Maximal degree in co-relation 89394. Up to 8916 conditions per place. [2023-08-30 06:17:02,877 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 172 selfloop transitions, 35 changer transitions 0/215 dead transitions. [2023-08-30 06:17:02,878 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 215 transitions, 1849 flow [2023-08-30 06:17:02,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 06:17:02,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 06:17:02,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1035 transitions. [2023-08-30 06:17:02,881 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4845505617977528 [2023-08-30 06:17:02,881 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1035 transitions. [2023-08-30 06:17:02,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1035 transitions. [2023-08-30 06:17:02,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 06:17:02,882 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1035 transitions. [2023-08-30 06:17:02,883 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 129.375) internal successors, (1035), 8 states have internal predecessors, (1035), 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) [2023-08-30 06:17:02,886 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 267.0) internal successors, (2403), 9 states have internal predecessors, (2403), 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) [2023-08-30 06:17:02,887 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 267.0) internal successors, (2403), 9 states have internal predecessors, (2403), 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) [2023-08-30 06:17:02,887 INFO L175 Difference]: Start difference. First operand has 85 places, 62 transitions, 532 flow. Second operand 8 states and 1035 transitions. [2023-08-30 06:17:02,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 215 transitions, 1849 flow [2023-08-30 06:17:03,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 215 transitions, 1783 flow, removed 21 selfloop flow, removed 1 redundant places. [2023-08-30 06:17:03,004 INFO L231 Difference]: Finished difference. Result has 95 places, 90 transitions, 870 flow [2023-08-30 06:17:03,005 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=503, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=870, PETRI_PLACES=95, PETRI_TRANSITIONS=90} [2023-08-30 06:17:03,005 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 40 predicate places. [2023-08-30 06:17:03,005 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 90 transitions, 870 flow [2023-08-30 06:17:03,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 116.0) internal successors, (1160), 10 states have internal predecessors, (1160), 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) [2023-08-30 06:17:03,012 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 06:17:03,012 INFO L208 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] [2023-08-30 06:17:03,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-30 06:17:03,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 06:17:03,219 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-30 06:17:03,219 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 06:17:03,219 INFO L85 PathProgramCache]: Analyzing trace with hash 887138534, now seen corresponding path program 2 times [2023-08-30 06:17:03,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 06:17:03,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215871653] [2023-08-30 06:17:03,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 06:17:03,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 06:17:03,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 06:17:03,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 06:17:03,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 06:17:03,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215871653] [2023-08-30 06:17:03,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215871653] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 06:17:03,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 06:17:03,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 06:17:03,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510770151] [2023-08-30 06:17:03,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 06:17:03,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 06:17:03,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 06:17:03,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 06:17:03,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-30 06:17:03,330 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 267 [2023-08-30 06:17:03,331 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 90 transitions, 870 flow. Second operand has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 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) [2023-08-30 06:17:03,331 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 06:17:03,331 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 267 [2023-08-30 06:17:03,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 06:17:04,099 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([519] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork2_~i~1#1_24| 1) |v_thread2Thread1of1ForFork2_~i~1#1_23|) (< |v_thread2Thread1of1ForFork2_~i~1#1_24| v_~N~0_47) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (= v_~counter1~0_57 (+ v_~counter1~0_56 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (< 0 v_~counter1~0_57) 1 0)) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|))) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_24|, ~counter1~0=v_~counter1~0_57, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_9|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_17|, ~counter1~0=v_~counter1~0_56, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_#t~post3#1, ~counter1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][29], [Black: 379#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 389#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), 164#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 901#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 895#(= thread1Thread1of1ForFork0_~i~0 0), Black: 387#(= thread1Thread1of1ForFork0_~i~0 0), Black: 192#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 198#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 899#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 388#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 196#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 152#(and (<= 0 |ULTIMATE.start_main_~#t2~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t2~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 183#(and (<= (+ |ULTIMATE.start_main_~#t1~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (< 0 (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1))), 147#true, 156#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 723#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0)), Black: 720#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 168#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 103#L92-1true, 172#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 926#(<= 0 |thread2Thread1of1ForFork2_~i~1#1|), 16#L72-4true, 41#L51-4true, 6#$Ultimate##0true, 43#L62-4true, Black: 396#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 397#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 365#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 909#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 555#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0)), Black: 205#(= thread1Thread1of1ForFork0_~i~0 0), Black: 939#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 1067#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 362#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 1075#true, Black: 1069#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 179#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 160#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 889#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 886#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 187#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 376#(and (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 372#(= thread3Thread1of1ForFork1_~i~2 0)]) [2023-08-30 06:17:04,099 INFO L383 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2023-08-30 06:17:04,099 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-30 06:17:04,100 INFO L386 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-08-30 06:17:04,100 INFO L386 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-08-30 06:17:04,101 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([519] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork2_~i~1#1_24| 1) |v_thread2Thread1of1ForFork2_~i~1#1_23|) (< |v_thread2Thread1of1ForFork2_~i~1#1_24| v_~N~0_47) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (= v_~counter1~0_57 (+ v_~counter1~0_56 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (< 0 v_~counter1~0_57) 1 0)) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|))) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_24|, ~counter1~0=v_~counter1~0_57, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_9|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_17|, ~counter1~0=v_~counter1~0_56, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_#t~post3#1, ~counter1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][29], [Black: 379#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 389#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), 164#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 901#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 895#(= thread1Thread1of1ForFork0_~i~0 0), Black: 192#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 387#(= thread1Thread1of1ForFork0_~i~0 0), Black: 198#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 388#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 899#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 196#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 152#(and (<= 0 |ULTIMATE.start_main_~#t2~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t2~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 183#(and (<= (+ |ULTIMATE.start_main_~#t1~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (< 0 (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1))), 147#true, 156#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 723#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0)), Black: 720#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 168#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 92#thread3EXITtrue, 172#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 926#(<= 0 |thread2Thread1of1ForFork2_~i~1#1|), 16#L72-4true, 41#L51-4true, 6#$Ultimate##0true, Black: 396#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 397#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 365#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 909#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 555#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0)), Black: 205#(= thread1Thread1of1ForFork0_~i~0 0), Black: 939#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 1067#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 362#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 1075#true, Black: 1069#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 179#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 160#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 12#L91-4true, Black: 889#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 886#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 187#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 376#(and (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 372#(= thread3Thread1of1ForFork1_~i~2 0)]) [2023-08-30 06:17:04,101 INFO L383 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2023-08-30 06:17:04,102 INFO L386 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-08-30 06:17:04,102 INFO L386 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-08-30 06:17:04,102 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-30 06:17:04,273 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([519] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork2_~i~1#1_24| 1) |v_thread2Thread1of1ForFork2_~i~1#1_23|) (< |v_thread2Thread1of1ForFork2_~i~1#1_24| v_~N~0_47) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (= v_~counter1~0_57 (+ v_~counter1~0_56 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (< 0 v_~counter1~0_57) 1 0)) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|))) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_24|, ~counter1~0=v_~counter1~0_57, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_9|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_17|, ~counter1~0=v_~counter1~0_56, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_#t~post3#1, ~counter1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][74], [Black: 379#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 164#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 901#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 192#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 387#(= thread1Thread1of1ForFork0_~i~0 0), Black: 198#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 388#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 899#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 196#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 152#(and (<= 0 |ULTIMATE.start_main_~#t2~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t2~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 183#(and (<= (+ |ULTIMATE.start_main_~#t1~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (< 0 (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1))), 147#true, 156#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 723#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0)), Black: 720#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 895#(= thread1Thread1of1ForFork0_~i~0 0), 103#L92-1true, 168#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 172#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 926#(<= 0 |thread2Thread1of1ForFork2_~i~1#1|), 16#L72-4true, 41#L51-4true, 43#L62-4true, Black: 396#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 397#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 365#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 909#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 555#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0)), Black: 939#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 1067#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|) (= thread3Thread1of1ForFork1_~i~2 0)), 1075#true, Black: 362#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 1069#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 179#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 389#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), 160#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 123#L41-4true, Black: 889#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 886#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 187#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 376#(and (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 372#(= thread3Thread1of1ForFork1_~i~2 0)]) [2023-08-30 06:17:04,273 INFO L383 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2023-08-30 06:17:04,274 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-30 06:17:04,274 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-30 06:17:04,274 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-30 06:17:04,275 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([519] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork2_~i~1#1_24| 1) |v_thread2Thread1of1ForFork2_~i~1#1_23|) (< |v_thread2Thread1of1ForFork2_~i~1#1_24| v_~N~0_47) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (= v_~counter1~0_57 (+ v_~counter1~0_56 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (< 0 v_~counter1~0_57) 1 0)) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|))) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_24|, ~counter1~0=v_~counter1~0_57, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_9|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_17|, ~counter1~0=v_~counter1~0_56, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_#t~post3#1, ~counter1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][74], [Black: 379#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 164#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 901#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 192#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 387#(= thread1Thread1of1ForFork0_~i~0 0), Black: 198#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 899#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 388#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 196#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 152#(and (<= 0 |ULTIMATE.start_main_~#t2~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t2~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 183#(and (<= (+ |ULTIMATE.start_main_~#t1~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (< 0 (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1))), 147#true, 156#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 723#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0)), Black: 720#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 895#(= thread1Thread1of1ForFork0_~i~0 0), 168#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 92#thread3EXITtrue, 172#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 926#(<= 0 |thread2Thread1of1ForFork2_~i~1#1|), 16#L72-4true, 41#L51-4true, Black: 396#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 397#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 365#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 909#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 555#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0)), Black: 939#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 1075#true, Black: 1067#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 362#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 1069#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 179#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 389#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), 160#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 12#L91-4true, 123#L41-4true, Black: 889#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 886#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 187#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 376#(and (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 372#(= thread3Thread1of1ForFork1_~i~2 0)]) [2023-08-30 06:17:04,275 INFO L383 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2023-08-30 06:17:04,275 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-30 06:17:04,275 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-30 06:17:04,275 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-30 06:17:04,396 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([519] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork2_~i~1#1_24| 1) |v_thread2Thread1of1ForFork2_~i~1#1_23|) (< |v_thread2Thread1of1ForFork2_~i~1#1_24| v_~N~0_47) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (= v_~counter1~0_57 (+ v_~counter1~0_56 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (< 0 v_~counter1~0_57) 1 0)) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|))) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_24|, ~counter1~0=v_~counter1~0_57, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_9|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_17|, ~counter1~0=v_~counter1~0_56, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_#t~post3#1, ~counter1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][29], [Black: 379#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 389#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), 164#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 901#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 895#(= thread1Thread1of1ForFork0_~i~0 0), Black: 387#(= thread1Thread1of1ForFork0_~i~0 0), Black: 192#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 198#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 899#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 388#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 196#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 152#(and (<= 0 |ULTIMATE.start_main_~#t2~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t2~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 183#(and (<= (+ |ULTIMATE.start_main_~#t1~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (< 0 (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1))), 147#true, 156#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 723#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0)), Black: 720#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 168#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 103#L92-1true, 92#thread3EXITtrue, 172#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 926#(<= 0 |thread2Thread1of1ForFork2_~i~1#1|), 16#L72-4true, 41#L51-4true, 6#$Ultimate##0true, Black: 396#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 397#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 365#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 909#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 555#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0)), Black: 205#(= thread1Thread1of1ForFork0_~i~0 0), Black: 939#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 1067#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 362#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 1075#true, Black: 1069#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 179#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 160#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 889#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 886#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 187#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 376#(and (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 372#(= thread3Thread1of1ForFork1_~i~2 0)]) [2023-08-30 06:17:04,396 INFO L383 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2023-08-30 06:17:04,396 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-30 06:17:04,396 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-30 06:17:04,396 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-30 06:17:04,468 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([519] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork2_~i~1#1_24| 1) |v_thread2Thread1of1ForFork2_~i~1#1_23|) (< |v_thread2Thread1of1ForFork2_~i~1#1_24| v_~N~0_47) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (= v_~counter1~0_57 (+ v_~counter1~0_56 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (< 0 v_~counter1~0_57) 1 0)) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|))) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_24|, ~counter1~0=v_~counter1~0_57, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_9|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_17|, ~counter1~0=v_~counter1~0_56, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_#t~post3#1, ~counter1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][74], [Black: 379#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 164#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 901#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 192#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 895#(= thread1Thread1of1ForFork0_~i~0 0), Black: 387#(= thread1Thread1of1ForFork0_~i~0 0), Black: 198#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 388#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 196#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 152#(and (<= 0 |ULTIMATE.start_main_~#t2~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t2~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 183#(and (<= (+ |ULTIMATE.start_main_~#t1~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (< 0 (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1))), 147#true, 156#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 723#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0)), Black: 720#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 899#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 168#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 103#L92-1true, 172#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 926#(<= 0 |thread2Thread1of1ForFork2_~i~1#1|), 16#L72-4true, 77#thread1EXITtrue, 41#L51-4true, 43#L62-4true, Black: 396#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 397#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 365#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 909#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 555#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0)), Black: 939#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 1067#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|) (= thread3Thread1of1ForFork1_~i~2 0)), 1075#true, Black: 362#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 1069#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 179#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 389#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), 160#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 889#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 886#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 187#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 376#(and (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 372#(= thread3Thread1of1ForFork1_~i~2 0)]) [2023-08-30 06:17:04,468 INFO L383 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2023-08-30 06:17:04,468 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-30 06:17:04,468 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-30 06:17:04,468 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-30 06:17:04,470 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([519] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork2_~i~1#1_24| 1) |v_thread2Thread1of1ForFork2_~i~1#1_23|) (< |v_thread2Thread1of1ForFork2_~i~1#1_24| v_~N~0_47) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (= v_~counter1~0_57 (+ v_~counter1~0_56 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (< 0 v_~counter1~0_57) 1 0)) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|))) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_24|, ~counter1~0=v_~counter1~0_57, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_9|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_17|, ~counter1~0=v_~counter1~0_56, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_#t~post3#1, ~counter1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][74], [Black: 379#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 164#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 901#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 192#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 895#(= thread1Thread1of1ForFork0_~i~0 0), Black: 387#(= thread1Thread1of1ForFork0_~i~0 0), Black: 388#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 198#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 196#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 152#(and (<= 0 |ULTIMATE.start_main_~#t2~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t2~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 183#(and (<= (+ |ULTIMATE.start_main_~#t1~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (< 0 (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1))), 147#true, 156#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 723#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0)), Black: 720#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 899#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 168#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 92#thread3EXITtrue, 172#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 926#(<= 0 |thread2Thread1of1ForFork2_~i~1#1|), 16#L72-4true, 77#thread1EXITtrue, 41#L51-4true, Black: 396#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 397#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 365#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 909#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 555#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0)), Black: 939#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 1075#true, Black: 1067#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 362#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 1069#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 179#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 389#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), 160#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 12#L91-4true, Black: 889#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 886#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 187#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 376#(and (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 372#(= thread3Thread1of1ForFork1_~i~2 0)]) [2023-08-30 06:17:04,470 INFO L383 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2023-08-30 06:17:04,470 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-30 06:17:04,470 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-30 06:17:04,470 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-30 06:17:04,574 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([519] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork2_~i~1#1_24| 1) |v_thread2Thread1of1ForFork2_~i~1#1_23|) (< |v_thread2Thread1of1ForFork2_~i~1#1_24| v_~N~0_47) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (= v_~counter1~0_57 (+ v_~counter1~0_56 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (< 0 v_~counter1~0_57) 1 0)) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|))) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_24|, ~counter1~0=v_~counter1~0_57, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_9|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_17|, ~counter1~0=v_~counter1~0_56, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_#t~post3#1, ~counter1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][74], [Black: 379#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 164#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 901#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 192#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 387#(= thread1Thread1of1ForFork0_~i~0 0), Black: 198#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 388#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 899#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 196#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 152#(and (<= 0 |ULTIMATE.start_main_~#t2~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t2~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 183#(and (<= (+ |ULTIMATE.start_main_~#t1~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (< 0 (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1))), 147#true, 156#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 723#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0)), Black: 720#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 895#(= thread1Thread1of1ForFork0_~i~0 0), 103#L92-1true, 168#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 92#thread3EXITtrue, 172#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 926#(<= 0 |thread2Thread1of1ForFork2_~i~1#1|), 16#L72-4true, 41#L51-4true, Black: 396#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 397#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 365#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 909#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 555#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0)), Black: 939#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 1067#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|) (= thread3Thread1of1ForFork1_~i~2 0)), 1075#true, Black: 362#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 1069#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 179#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 389#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), 160#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 123#L41-4true, Black: 889#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 886#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 187#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 376#(and (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 372#(= thread3Thread1of1ForFork1_~i~2 0)]) [2023-08-30 06:17:04,574 INFO L383 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2023-08-30 06:17:04,574 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-30 06:17:04,574 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-30 06:17:04,574 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-30 06:17:04,780 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([519] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork2_~i~1#1_24| 1) |v_thread2Thread1of1ForFork2_~i~1#1_23|) (< |v_thread2Thread1of1ForFork2_~i~1#1_24| v_~N~0_47) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (= v_~counter1~0_57 (+ v_~counter1~0_56 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (< 0 v_~counter1~0_57) 1 0)) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|))) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_24|, ~counter1~0=v_~counter1~0_57, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_9|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_17|, ~counter1~0=v_~counter1~0_56, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_#t~post3#1, ~counter1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][74], [Black: 379#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 164#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 901#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 192#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 895#(= thread1Thread1of1ForFork0_~i~0 0), Black: 387#(= thread1Thread1of1ForFork0_~i~0 0), Black: 198#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 388#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 196#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 152#(and (<= 0 |ULTIMATE.start_main_~#t2~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t2~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 183#(and (<= (+ |ULTIMATE.start_main_~#t1~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (< 0 (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1))), 147#true, 156#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 723#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0)), Black: 720#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 899#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 168#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 103#L92-1true, 92#thread3EXITtrue, 172#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 926#(<= 0 |thread2Thread1of1ForFork2_~i~1#1|), 16#L72-4true, 77#thread1EXITtrue, 41#L51-4true, Black: 396#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 397#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 365#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 909#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 555#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0)), Black: 939#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 1067#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|) (= thread3Thread1of1ForFork1_~i~2 0)), 1075#true, Black: 362#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 1069#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 179#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 389#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), 160#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 889#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 886#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 187#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 376#(and (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 372#(= thread3Thread1of1ForFork1_~i~2 0)]) [2023-08-30 06:17:04,780 INFO L383 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2023-08-30 06:17:04,780 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-30 06:17:04,780 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-30 06:17:04,780 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 06:17:04,783 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([519] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork2_~i~1#1_24| 1) |v_thread2Thread1of1ForFork2_~i~1#1_23|) (< |v_thread2Thread1of1ForFork2_~i~1#1_24| v_~N~0_47) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (= v_~counter1~0_57 (+ v_~counter1~0_56 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (< 0 v_~counter1~0_57) 1 0)) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|))) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_24|, ~counter1~0=v_~counter1~0_57, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_9|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_17|, ~counter1~0=v_~counter1~0_56, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_#t~post3#1, ~counter1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][74], [Black: 379#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 60#L92-2true, 164#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 901#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 192#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 895#(= thread1Thread1of1ForFork0_~i~0 0), Black: 387#(= thread1Thread1of1ForFork0_~i~0 0), Black: 198#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 388#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 196#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 152#(and (<= 0 |ULTIMATE.start_main_~#t2~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t2~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 183#(and (<= (+ |ULTIMATE.start_main_~#t1~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (< 0 (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1))), 147#true, 156#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 723#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0)), Black: 720#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 899#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 168#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 172#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 926#(<= 0 |thread2Thread1of1ForFork2_~i~1#1|), 16#L72-4true, 41#L51-4true, 43#L62-4true, Black: 396#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 397#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 365#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 909#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 555#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0)), Black: 939#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 1067#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|) (= thread3Thread1of1ForFork1_~i~2 0)), 1075#true, Black: 362#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 1069#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 179#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 389#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), 160#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 889#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 886#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 187#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 376#(and (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 372#(= thread3Thread1of1ForFork1_~i~2 0)]) [2023-08-30 06:17:04,784 INFO L383 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2023-08-30 06:17:04,784 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-30 06:17:04,784 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-30 06:17:04,784 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 06:17:05,018 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([519] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork2_~i~1#1_24| 1) |v_thread2Thread1of1ForFork2_~i~1#1_23|) (< |v_thread2Thread1of1ForFork2_~i~1#1_24| v_~N~0_47) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (= v_~counter1~0_57 (+ v_~counter1~0_56 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (< 0 v_~counter1~0_57) 1 0)) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|))) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_24|, ~counter1~0=v_~counter1~0_57, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_9|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_17|, ~counter1~0=v_~counter1~0_56, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_#t~post3#1, ~counter1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][74], [Black: 379#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 60#L92-2true, 164#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 901#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 192#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 895#(= thread1Thread1of1ForFork0_~i~0 0), Black: 387#(= thread1Thread1of1ForFork0_~i~0 0), Black: 198#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 388#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 196#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 152#(and (<= 0 |ULTIMATE.start_main_~#t2~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t2~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 183#(and (<= (+ |ULTIMATE.start_main_~#t1~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (< 0 (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1))), 147#true, 156#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 723#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0)), Black: 720#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 899#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 168#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 92#thread3EXITtrue, 172#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 926#(<= 0 |thread2Thread1of1ForFork2_~i~1#1|), 16#L72-4true, 41#L51-4true, Black: 396#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 397#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 365#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 909#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 555#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0)), Black: 939#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 1067#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|) (= thread3Thread1of1ForFork1_~i~2 0)), 1075#true, Black: 362#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 1069#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 179#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 389#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), 160#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 889#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 886#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 187#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 376#(and (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 372#(= thread3Thread1of1ForFork1_~i~2 0)]) [2023-08-30 06:17:05,018 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-30 06:17:05,018 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 06:17:05,018 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 06:17:05,018 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 06:17:05,021 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([519] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork2_~i~1#1_24| 1) |v_thread2Thread1of1ForFork2_~i~1#1_23|) (< |v_thread2Thread1of1ForFork2_~i~1#1_24| v_~N~0_47) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (= v_~counter1~0_57 (+ v_~counter1~0_56 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (< 0 v_~counter1~0_57) 1 0)) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|))) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_24|, ~counter1~0=v_~counter1~0_57, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_9|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_17|, ~counter1~0=v_~counter1~0_56, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_#t~post3#1, ~counter1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][74], [Black: 379#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 164#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 901#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 192#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 895#(= thread1Thread1of1ForFork0_~i~0 0), Black: 387#(= thread1Thread1of1ForFork0_~i~0 0), Black: 198#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 388#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 196#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 152#(and (<= 0 |ULTIMATE.start_main_~#t2~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t2~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 183#(and (<= (+ |ULTIMATE.start_main_~#t1~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (< 0 (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1))), 147#true, 156#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 723#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0)), Black: 720#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 899#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 168#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 172#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 926#(<= 0 |thread2Thread1of1ForFork2_~i~1#1|), 110#L93-1true, 16#L72-4true, 41#L51-4true, 43#L62-4true, Black: 396#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 397#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 365#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 909#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 555#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0)), Black: 939#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 1075#true, Black: 1067#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 362#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 1069#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 179#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 389#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), 160#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 889#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 886#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 187#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 376#(and (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 372#(= thread3Thread1of1ForFork1_~i~2 0)]) [2023-08-30 06:17:05,021 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-30 06:17:05,021 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 06:17:05,021 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 06:17:05,022 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 06:17:05,177 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([519] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork2_~i~1#1_24| 1) |v_thread2Thread1of1ForFork2_~i~1#1_23|) (< |v_thread2Thread1of1ForFork2_~i~1#1_24| v_~N~0_47) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (= v_~counter1~0_57 (+ v_~counter1~0_56 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (< 0 v_~counter1~0_57) 1 0)) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|))) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_24|, ~counter1~0=v_~counter1~0_57, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_9|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_17|, ~counter1~0=v_~counter1~0_56, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_#t~post3#1, ~counter1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][74], [Black: 379#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 164#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 901#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 192#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 895#(= thread1Thread1of1ForFork0_~i~0 0), Black: 387#(= thread1Thread1of1ForFork0_~i~0 0), Black: 198#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 388#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 196#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 152#(and (<= 0 |ULTIMATE.start_main_~#t2~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t2~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 183#(and (<= (+ |ULTIMATE.start_main_~#t1~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (< 0 (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1))), 147#true, 156#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 723#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0)), Black: 720#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 899#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 168#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 92#thread3EXITtrue, 172#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 926#(<= 0 |thread2Thread1of1ForFork2_~i~1#1|), 110#L93-1true, 16#L72-4true, 41#L51-4true, Black: 396#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 397#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 365#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 909#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 555#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0)), Black: 939#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 1067#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|) (= thread3Thread1of1ForFork1_~i~2 0)), 1075#true, Black: 362#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 1069#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 179#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 389#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), 160#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 889#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 886#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 187#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 376#(and (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 372#(= thread3Thread1of1ForFork1_~i~2 0)]) [2023-08-30 06:17:05,177 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 06:17:05,177 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 06:17:05,177 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 06:17:05,177 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 06:17:05,508 INFO L130 PetriNetUnfolder]: 17427/24411 cut-off events. [2023-08-30 06:17:05,508 INFO L131 PetriNetUnfolder]: For 128682/131017 co-relation queries the response was YES. [2023-08-30 06:17:05,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107723 conditions, 24411 events. 17427/24411 cut-off events. For 128682/131017 co-relation queries the response was YES. Maximal size of possible extension queue 1269. Compared 148981 event pairs, 2600 based on Foata normal form. 2717/26753 useless extension candidates. Maximal degree in co-relation 107692. Up to 9890 conditions per place. [2023-08-30 06:17:05,823 INFO L137 encePairwiseOnDemand]: 261/267 looper letters, 172 selfloop transitions, 50 changer transitions 0/227 dead transitions. [2023-08-30 06:17:05,823 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 227 transitions, 2529 flow [2023-08-30 06:17:05,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 06:17:05,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 06:17:05,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 769 transitions. [2023-08-30 06:17:05,826 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48002496878901374 [2023-08-30 06:17:05,826 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 769 transitions. [2023-08-30 06:17:05,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 769 transitions. [2023-08-30 06:17:05,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 06:17:05,827 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 769 transitions. [2023-08-30 06:17:05,829 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 128.16666666666666) internal successors, (769), 6 states have internal predecessors, (769), 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) [2023-08-30 06:17:05,831 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 267.0) internal successors, (1869), 7 states have internal predecessors, (1869), 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) [2023-08-30 06:17:05,831 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 267.0) internal successors, (1869), 7 states have internal predecessors, (1869), 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) [2023-08-30 06:17:05,831 INFO L175 Difference]: Start difference. First operand has 95 places, 90 transitions, 870 flow. Second operand 6 states and 769 transitions. [2023-08-30 06:17:05,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 227 transitions, 2529 flow [2023-08-30 06:17:06,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 227 transitions, 2529 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 06:17:06,175 INFO L231 Difference]: Finished difference. Result has 103 places, 112 transitions, 1345 flow [2023-08-30 06:17:06,175 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=870, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1345, PETRI_PLACES=103, PETRI_TRANSITIONS=112} [2023-08-30 06:17:06,176 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 48 predicate places. [2023-08-30 06:17:06,176 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 112 transitions, 1345 flow [2023-08-30 06:17:06,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 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) [2023-08-30 06:17:06,176 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 06:17:06,177 INFO L208 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] [2023-08-30 06:17:06,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-30 06:17:06,177 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-30 06:17:06,177 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 06:17:06,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1966858371, now seen corresponding path program 4 times [2023-08-30 06:17:06,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 06:17:06,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609370372] [2023-08-30 06:17:06,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 06:17:06,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 06:17:06,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 06:17:06,239 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 06:17:06,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 06:17:06,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609370372] [2023-08-30 06:17:06,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609370372] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 06:17:06,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 06:17:06,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 06:17:06,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093396732] [2023-08-30 06:17:06,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 06:17:06,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 06:17:06,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 06:17:06,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 06:17:06,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 06:17:06,268 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 267 [2023-08-30 06:17:06,269 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 112 transitions, 1345 flow. Second operand has 5 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 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) [2023-08-30 06:17:06,269 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 06:17:06,270 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 267 [2023-08-30 06:17:06,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 06:17:08,435 INFO L130 PetriNetUnfolder]: 17150/24038 cut-off events. [2023-08-30 06:17:08,435 INFO L131 PetriNetUnfolder]: For 154577/156887 co-relation queries the response was YES. [2023-08-30 06:17:08,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117096 conditions, 24038 events. 17150/24038 cut-off events. For 154577/156887 co-relation queries the response was YES. Maximal size of possible extension queue 1301. Compared 146129 event pairs, 3227 based on Foata normal form. 2263/25463 useless extension candidates. Maximal degree in co-relation 117061. Up to 11204 conditions per place. [2023-08-30 06:17:08,708 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 147 selfloop transitions, 23 changer transitions 2/183 dead transitions. [2023-08-30 06:17:08,709 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 183 transitions, 2236 flow [2023-08-30 06:17:08,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 06:17:08,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 06:17:08,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 646 transitions. [2023-08-30 06:17:08,711 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48389513108614235 [2023-08-30 06:17:08,711 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 646 transitions. [2023-08-30 06:17:08,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 646 transitions. [2023-08-30 06:17:08,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 06:17:08,712 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 646 transitions. [2023-08-30 06:17:08,713 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.2) internal successors, (646), 5 states have internal predecessors, (646), 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) [2023-08-30 06:17:08,714 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 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) [2023-08-30 06:17:08,715 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 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) [2023-08-30 06:17:08,715 INFO L175 Difference]: Start difference. First operand has 103 places, 112 transitions, 1345 flow. Second operand 5 states and 646 transitions. [2023-08-30 06:17:08,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 183 transitions, 2236 flow [2023-08-30 06:17:09,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 183 transitions, 2099 flow, removed 41 selfloop flow, removed 2 redundant places. [2023-08-30 06:17:09,045 INFO L231 Difference]: Finished difference. Result has 107 places, 116 transitions, 1399 flow [2023-08-30 06:17:09,045 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=1249, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1399, PETRI_PLACES=107, PETRI_TRANSITIONS=116} [2023-08-30 06:17:09,045 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 52 predicate places. [2023-08-30 06:17:09,046 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 116 transitions, 1399 flow [2023-08-30 06:17:09,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 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) [2023-08-30 06:17:09,046 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 06:17:09,046 INFO L208 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] [2023-08-30 06:17:09,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-30 06:17:09,046 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-30 06:17:09,047 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 06:17:09,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1479612490, now seen corresponding path program 3 times [2023-08-30 06:17:09,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 06:17:09,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000190392] [2023-08-30 06:17:09,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 06:17:09,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 06:17:09,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 06:17:09,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 06:17:09,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 06:17:09,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000190392] [2023-08-30 06:17:09,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000190392] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 06:17:09,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 06:17:09,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 06:17:09,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017373355] [2023-08-30 06:17:09,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 06:17:09,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 06:17:09,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 06:17:09,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 06:17:09,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 06:17:09,129 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 267 [2023-08-30 06:17:09,130 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 116 transitions, 1399 flow. Second operand has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 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) [2023-08-30 06:17:09,130 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 06:17:09,130 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 267 [2023-08-30 06:17:09,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 06:17:09,898 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([519] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork2_~i~1#1_24| 1) |v_thread2Thread1of1ForFork2_~i~1#1_23|) (< |v_thread2Thread1of1ForFork2_~i~1#1_24| v_~N~0_47) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (= v_~counter1~0_57 (+ v_~counter1~0_56 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (< 0 v_~counter1~0_57) 1 0)) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|))) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_24|, ~counter1~0=v_~counter1~0_57, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_9|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_17|, ~counter1~0=v_~counter1~0_56, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_#t~post3#1, ~counter1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][36], [Black: 379#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1091#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 389#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 901#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 164#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 387#(= thread1Thread1of1ForFork0_~i~0 0), Black: 895#(= thread1Thread1of1ForFork0_~i~0 0), Black: 192#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 198#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 388#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 899#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 196#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 152#(and (<= 0 |ULTIMATE.start_main_~#t2~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t2~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 183#(and (<= (+ |ULTIMATE.start_main_~#t1~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (< 0 (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1))), 147#true, 156#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 723#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0)), Black: 720#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 1090#(<= 1 ~N~0), 168#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 172#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 926#(<= 0 |thread2Thread1of1ForFork2_~i~1#1|), 16#L72-4true, 41#L51-4true, 6#$Ultimate##0true, 43#L62-4true, Black: 396#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 397#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 365#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 909#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 555#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0)), Black: 939#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 205#(= thread1Thread1of1ForFork0_~i~0 0), Black: 1067#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 362#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 1069#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 179#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 160#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 12#L91-4true, Black: 889#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 886#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 1078#(and (= thread1Thread1of1ForFork0_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 187#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), 1095#true, Black: 1077#(= thread3Thread1of1ForFork1_~i~2 0), Black: 1081#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 376#(and (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 372#(= thread3Thread1of1ForFork1_~i~2 0)]) [2023-08-30 06:17:09,898 INFO L383 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2023-08-30 06:17:09,898 INFO L386 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2023-08-30 06:17:09,898 INFO L386 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-08-30 06:17:09,898 INFO L386 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2023-08-30 06:17:10,084 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([519] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork2_~i~1#1_24| 1) |v_thread2Thread1of1ForFork2_~i~1#1_23|) (< |v_thread2Thread1of1ForFork2_~i~1#1_24| v_~N~0_47) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (= v_~counter1~0_57 (+ v_~counter1~0_56 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (< 0 v_~counter1~0_57) 1 0)) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|))) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_24|, ~counter1~0=v_~counter1~0_57, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_9|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_17|, ~counter1~0=v_~counter1~0_56, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_#t~post3#1, ~counter1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][36], [Black: 379#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1091#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 389#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 901#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 164#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 387#(= thread1Thread1of1ForFork0_~i~0 0), Black: 895#(= thread1Thread1of1ForFork0_~i~0 0), Black: 192#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 198#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 899#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 388#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 196#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 152#(and (<= 0 |ULTIMATE.start_main_~#t2~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t2~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 183#(and (<= (+ |ULTIMATE.start_main_~#t1~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (< 0 (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1))), 147#true, 156#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 723#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0)), Black: 720#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 1090#(<= 1 ~N~0), 168#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 103#L92-1true, 172#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 926#(<= 0 |thread2Thread1of1ForFork2_~i~1#1|), 16#L72-4true, 41#L51-4true, 6#$Ultimate##0true, 43#L62-4true, Black: 396#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 397#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 365#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 909#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 555#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0)), Black: 939#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 205#(= thread1Thread1of1ForFork0_~i~0 0), Black: 1067#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 362#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 1069#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 179#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 160#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 889#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 1078#(and (= thread1Thread1of1ForFork0_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 886#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 1077#(= thread3Thread1of1ForFork1_~i~2 0), Black: 187#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), 1095#true, Black: 1081#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 376#(and (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 372#(= thread3Thread1of1ForFork1_~i~2 0)]) [2023-08-30 06:17:10,084 INFO L383 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2023-08-30 06:17:10,084 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-30 06:17:10,084 INFO L386 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-08-30 06:17:10,084 INFO L386 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-08-30 06:17:10,085 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([519] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork2_~i~1#1_24| 1) |v_thread2Thread1of1ForFork2_~i~1#1_23|) (< |v_thread2Thread1of1ForFork2_~i~1#1_24| v_~N~0_47) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (= v_~counter1~0_57 (+ v_~counter1~0_56 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (< 0 v_~counter1~0_57) 1 0)) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|))) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_24|, ~counter1~0=v_~counter1~0_57, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_9|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_17|, ~counter1~0=v_~counter1~0_56, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_#t~post3#1, ~counter1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][36], [Black: 379#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1091#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 389#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 901#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 164#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 387#(= thread1Thread1of1ForFork0_~i~0 0), Black: 895#(= thread1Thread1of1ForFork0_~i~0 0), Black: 192#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 198#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 899#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 388#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 196#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 152#(and (<= 0 |ULTIMATE.start_main_~#t2~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t2~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 183#(and (<= (+ |ULTIMATE.start_main_~#t1~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (< 0 (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1))), 147#true, 156#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 723#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0)), Black: 720#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 1090#(<= 1 ~N~0), 168#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 92#thread3EXITtrue, 172#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 926#(<= 0 |thread2Thread1of1ForFork2_~i~1#1|), 16#L72-4true, 41#L51-4true, 6#$Ultimate##0true, Black: 396#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 397#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 365#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 909#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 555#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0)), Black: 939#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 205#(= thread1Thread1of1ForFork0_~i~0 0), Black: 1067#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 362#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 1069#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 179#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 160#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 12#L91-4true, Black: 889#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 1078#(and (= thread1Thread1of1ForFork0_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 886#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 1077#(= thread3Thread1of1ForFork1_~i~2 0), Black: 187#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), 1095#true, Black: 1081#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 376#(and (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 372#(= thread3Thread1of1ForFork1_~i~2 0)]) [2023-08-30 06:17:10,085 INFO L383 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2023-08-30 06:17:10,085 INFO L386 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-08-30 06:17:10,085 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-30 06:17:10,085 INFO L386 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-08-30 06:17:10,318 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([519] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork2_~i~1#1_24| 1) |v_thread2Thread1of1ForFork2_~i~1#1_23|) (< |v_thread2Thread1of1ForFork2_~i~1#1_24| v_~N~0_47) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (= v_~counter1~0_57 (+ v_~counter1~0_56 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (< 0 v_~counter1~0_57) 1 0)) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|))) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_24|, ~counter1~0=v_~counter1~0_57, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_9|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_17|, ~counter1~0=v_~counter1~0_56, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_#t~post3#1, ~counter1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][36], [Black: 379#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1091#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 389#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 901#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 164#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 387#(= thread1Thread1of1ForFork0_~i~0 0), Black: 895#(= thread1Thread1of1ForFork0_~i~0 0), Black: 192#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 198#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 899#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 388#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 196#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 152#(and (<= 0 |ULTIMATE.start_main_~#t2~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t2~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 183#(and (<= (+ |ULTIMATE.start_main_~#t1~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (< 0 (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1))), 147#true, 156#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 723#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0)), Black: 720#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 1090#(<= 1 ~N~0), 168#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 103#L92-1true, 92#thread3EXITtrue, 172#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 926#(<= 0 |thread2Thread1of1ForFork2_~i~1#1|), 16#L72-4true, 41#L51-4true, 6#$Ultimate##0true, Black: 396#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 397#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 365#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 909#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 555#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0)), Black: 939#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 205#(= thread1Thread1of1ForFork0_~i~0 0), Black: 1067#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 362#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 1069#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 179#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 160#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 889#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 1078#(and (= thread1Thread1of1ForFork0_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 886#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 1077#(= thread3Thread1of1ForFork1_~i~2 0), Black: 187#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), 1095#true, Black: 1081#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 376#(and (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 372#(= thread3Thread1of1ForFork1_~i~2 0)]) [2023-08-30 06:17:10,318 INFO L383 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2023-08-30 06:17:10,318 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-30 06:17:10,318 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-30 06:17:10,318 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-30 06:17:11,446 INFO L130 PetriNetUnfolder]: 16637/23465 cut-off events. [2023-08-30 06:17:11,446 INFO L131 PetriNetUnfolder]: For 182759/185123 co-relation queries the response was YES. [2023-08-30 06:17:11,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110451 conditions, 23465 events. 16637/23465 cut-off events. For 182759/185123 co-relation queries the response was YES. Maximal size of possible extension queue 1312. Compared 143658 event pairs, 4321 based on Foata normal form. 2579/25515 useless extension candidates. Maximal degree in co-relation 110414. Up to 9365 conditions per place. [2023-08-30 06:17:11,796 INFO L137 encePairwiseOnDemand]: 261/267 looper letters, 152 selfloop transitions, 52 changer transitions 0/209 dead transitions. [2023-08-30 06:17:11,796 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 209 transitions, 2583 flow [2023-08-30 06:17:11,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 06:17:11,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 06:17:11,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 650 transitions. [2023-08-30 06:17:11,798 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4868913857677903 [2023-08-30 06:17:11,798 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 650 transitions. [2023-08-30 06:17:11,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 650 transitions. [2023-08-30 06:17:11,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 06:17:11,799 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 650 transitions. [2023-08-30 06:17:11,800 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.0) internal successors, (650), 5 states have internal predecessors, (650), 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) [2023-08-30 06:17:11,802 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 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) [2023-08-30 06:17:11,803 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 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) [2023-08-30 06:17:11,803 INFO L175 Difference]: Start difference. First operand has 107 places, 116 transitions, 1399 flow. Second operand 5 states and 650 transitions. [2023-08-30 06:17:11,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 209 transitions, 2583 flow [2023-08-30 06:17:12,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 209 transitions, 2502 flow, removed 23 selfloop flow, removed 3 redundant places. [2023-08-30 06:17:12,230 INFO L231 Difference]: Finished difference. Result has 111 places, 138 transitions, 1880 flow [2023-08-30 06:17:12,231 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=1346, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1880, PETRI_PLACES=111, PETRI_TRANSITIONS=138} [2023-08-30 06:17:12,231 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 56 predicate places. [2023-08-30 06:17:12,231 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 138 transitions, 1880 flow [2023-08-30 06:17:12,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 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) [2023-08-30 06:17:12,232 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 06:17:12,232 INFO L208 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] [2023-08-30 06:17:12,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-30 06:17:12,232 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-30 06:17:12,233 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 06:17:12,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1539562932, now seen corresponding path program 4 times [2023-08-30 06:17:12,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 06:17:12,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372714872] [2023-08-30 06:17:12,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 06:17:12,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 06:17:12,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 06:17:12,293 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 06:17:12,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 06:17:12,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372714872] [2023-08-30 06:17:12,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372714872] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 06:17:12,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312921662] [2023-08-30 06:17:12,294 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-30 06:17:12,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 06:17:12,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 06:17:12,297 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 06:17:12,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-30 06:17:12,409 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-30 06:17:12,409 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 06:17:12,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-30 06:17:12,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 06:17:12,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 06:17:12,436 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 06:17:12,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 06:17:12,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [312921662] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 06:17:12,464 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 06:17:12,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-08-30 06:17:12,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927087242] [2023-08-30 06:17:12,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 06:17:12,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 06:17:12,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 06:17:12,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 06:17:12,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-08-30 06:17:12,509 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 267 [2023-08-30 06:17:12,510 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 138 transitions, 1880 flow. Second operand has 8 states, 8 states have (on average 115.875) internal successors, (927), 8 states have internal predecessors, (927), 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) [2023-08-30 06:17:12,510 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 06:17:12,510 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 267 [2023-08-30 06:17:12,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 06:17:14,953 INFO L130 PetriNetUnfolder]: 17939/25152 cut-off events. [2023-08-30 06:17:14,953 INFO L131 PetriNetUnfolder]: For 197071/199029 co-relation queries the response was YES. [2023-08-30 06:17:15,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123918 conditions, 25152 events. 17939/25152 cut-off events. For 197071/199029 co-relation queries the response was YES. Maximal size of possible extension queue 1349. Compared 150989 event pairs, 4685 based on Foata normal form. 1981/26557 useless extension candidates. Maximal degree in co-relation 123879. Up to 16480 conditions per place. [2023-08-30 06:17:15,142 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 151 selfloop transitions, 54 changer transitions 0/218 dead transitions. [2023-08-30 06:17:15,142 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 218 transitions, 3002 flow [2023-08-30 06:17:15,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 06:17:15,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 06:17:15,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 634 transitions. [2023-08-30 06:17:15,144 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4749063670411985 [2023-08-30 06:17:15,144 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 634 transitions. [2023-08-30 06:17:15,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 634 transitions. [2023-08-30 06:17:15,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 06:17:15,145 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 634 transitions. [2023-08-30 06:17:15,146 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 126.8) internal successors, (634), 5 states have internal predecessors, (634), 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) [2023-08-30 06:17:15,148 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 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) [2023-08-30 06:17:15,148 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 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) [2023-08-30 06:17:15,148 INFO L175 Difference]: Start difference. First operand has 111 places, 138 transitions, 1880 flow. Second operand 5 states and 634 transitions. [2023-08-30 06:17:15,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 218 transitions, 3002 flow [2023-08-30 06:17:15,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 218 transitions, 2904 flow, removed 28 selfloop flow, removed 1 redundant places. [2023-08-30 06:17:15,894 INFO L231 Difference]: Finished difference. Result has 116 places, 146 transitions, 2073 flow [2023-08-30 06:17:15,894 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=1789, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2073, PETRI_PLACES=116, PETRI_TRANSITIONS=146} [2023-08-30 06:17:15,894 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 61 predicate places. [2023-08-30 06:17:15,894 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 146 transitions, 2073 flow [2023-08-30 06:17:15,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 115.875) internal successors, (927), 8 states have internal predecessors, (927), 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) [2023-08-30 06:17:15,895 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 06:17:15,895 INFO L208 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] [2023-08-30 06:17:15,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-30 06:17:16,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 06:17:16,097 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-30 06:17:16,097 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 06:17:16,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1927607435, now seen corresponding path program 1 times [2023-08-30 06:17:16,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 06:17:16,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956815994] [2023-08-30 06:17:16,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 06:17:16,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 06:17:16,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 06:17:16,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 06:17:16,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 06:17:16,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956815994] [2023-08-30 06:17:16,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956815994] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 06:17:16,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 06:17:16,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 06:17:16,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257573981] [2023-08-30 06:17:16,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 06:17:16,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 06:17:16,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 06:17:16,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 06:17:16,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 06:17:16,228 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 267 [2023-08-30 06:17:16,229 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 146 transitions, 2073 flow. Second operand has 5 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 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) [2023-08-30 06:17:16,229 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 06:17:16,229 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 267 [2023-08-30 06:17:16,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 06:17:19,517 INFO L130 PetriNetUnfolder]: 20402/29889 cut-off events. [2023-08-30 06:17:19,518 INFO L131 PetriNetUnfolder]: For 264010/270580 co-relation queries the response was YES. [2023-08-30 06:17:19,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144824 conditions, 29889 events. 20402/29889 cut-off events. For 264010/270580 co-relation queries the response was YES. Maximal size of possible extension queue 1651. Compared 202505 event pairs, 4580 based on Foata normal form. 4902/34413 useless extension candidates. Maximal degree in co-relation 144783. Up to 10376 conditions per place. [2023-08-30 06:17:19,772 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 173 selfloop transitions, 39 changer transitions 1/231 dead transitions. [2023-08-30 06:17:19,773 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 231 transitions, 3138 flow [2023-08-30 06:17:19,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 06:17:19,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 06:17:19,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 650 transitions. [2023-08-30 06:17:19,774 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4868913857677903 [2023-08-30 06:17:19,775 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 650 transitions. [2023-08-30 06:17:19,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 650 transitions. [2023-08-30 06:17:19,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 06:17:19,775 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 650 transitions. [2023-08-30 06:17:19,776 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.0) internal successors, (650), 5 states have internal predecessors, (650), 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) [2023-08-30 06:17:19,778 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 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) [2023-08-30 06:17:19,778 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 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) [2023-08-30 06:17:19,778 INFO L175 Difference]: Start difference. First operand has 116 places, 146 transitions, 2073 flow. Second operand 5 states and 650 transitions. [2023-08-30 06:17:19,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 231 transitions, 3138 flow [2023-08-30 06:17:20,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 231 transitions, 3080 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 06:17:20,396 INFO L231 Difference]: Finished difference. Result has 120 places, 147 transitions, 2112 flow [2023-08-30 06:17:20,397 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=2015, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2112, PETRI_PLACES=120, PETRI_TRANSITIONS=147} [2023-08-30 06:17:20,397 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 65 predicate places. [2023-08-30 06:17:20,397 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 147 transitions, 2112 flow [2023-08-30 06:17:20,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 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) [2023-08-30 06:17:20,398 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 06:17:20,398 INFO L208 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] [2023-08-30 06:17:20,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-30 06:17:20,398 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-30 06:17:20,399 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 06:17:20,399 INFO L85 PathProgramCache]: Analyzing trace with hash 15975187, now seen corresponding path program 2 times [2023-08-30 06:17:20,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 06:17:20,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940050878] [2023-08-30 06:17:20,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 06:17:20,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 06:17:20,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 06:17:20,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 06:17:20,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 06:17:20,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940050878] [2023-08-30 06:17:20,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940050878] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 06:17:20,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041998631] [2023-08-30 06:17:20,454 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 06:17:20,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 06:17:20,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 06:17:20,457 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 06:17:20,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-30 06:17:20,583 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 06:17:20,583 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 06:17:20,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-30 06:17:20,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 06:17:20,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 06:17:20,613 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 06:17:20,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 06:17:20,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041998631] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 06:17:20,637 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 06:17:20,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-08-30 06:17:20,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105243867] [2023-08-30 06:17:20,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 06:17:20,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 06:17:20,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 06:17:20,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 06:17:20,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-08-30 06:17:20,692 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 267 [2023-08-30 06:17:20,693 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 147 transitions, 2112 flow. Second operand has 8 states, 8 states have (on average 115.875) internal successors, (927), 8 states have internal predecessors, (927), 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) [2023-08-30 06:17:20,693 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 06:17:20,693 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 267 [2023-08-30 06:17:20,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 06:17:25,802 INFO L130 PetriNetUnfolder]: 30135/43297 cut-off events. [2023-08-30 06:17:25,802 INFO L131 PetriNetUnfolder]: For 408004/413204 co-relation queries the response was YES. [2023-08-30 06:17:26,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218652 conditions, 43297 events. 30135/43297 cut-off events. For 408004/413204 co-relation queries the response was YES. Maximal size of possible extension queue 2127. Compared 293230 event pairs, 5542 based on Foata normal form. 4084/47106 useless extension candidates. Maximal degree in co-relation 218609. Up to 17048 conditions per place. [2023-08-30 06:17:26,278 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 329 selfloop transitions, 43 changer transitions 6/395 dead transitions. [2023-08-30 06:17:26,278 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 395 transitions, 6433 flow [2023-08-30 06:17:26,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 06:17:26,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 06:17:26,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 632 transitions. [2023-08-30 06:17:26,280 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47340823970037454 [2023-08-30 06:17:26,280 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 632 transitions. [2023-08-30 06:17:26,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 632 transitions. [2023-08-30 06:17:26,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 06:17:26,281 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 632 transitions. [2023-08-30 06:17:26,282 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 126.4) internal successors, (632), 5 states have internal predecessors, (632), 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) [2023-08-30 06:17:26,284 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 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) [2023-08-30 06:17:26,284 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 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) [2023-08-30 06:17:26,284 INFO L175 Difference]: Start difference. First operand has 120 places, 147 transitions, 2112 flow. Second operand 5 states and 632 transitions. [2023-08-30 06:17:26,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 395 transitions, 6433 flow [2023-08-30 06:17:27,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 395 transitions, 6268 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 06:17:27,865 INFO L231 Difference]: Finished difference. Result has 125 places, 185 transitions, 2852 flow [2023-08-30 06:17:27,865 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=2037, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2852, PETRI_PLACES=125, PETRI_TRANSITIONS=185} [2023-08-30 06:17:27,866 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 70 predicate places. [2023-08-30 06:17:27,866 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 185 transitions, 2852 flow [2023-08-30 06:17:27,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 115.875) internal successors, (927), 8 states have internal predecessors, (927), 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) [2023-08-30 06:17:27,866 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 06:17:27,866 INFO L208 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] [2023-08-30 06:17:27,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-30 06:17:28,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 06:17:28,077 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-30 06:17:28,077 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 06:17:28,078 INFO L85 PathProgramCache]: Analyzing trace with hash -671385108, now seen corresponding path program 5 times [2023-08-30 06:17:28,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 06:17:28,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095101109] [2023-08-30 06:17:28,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 06:17:28,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 06:17:28,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 06:17:28,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 06:17:28,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 06:17:28,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095101109] [2023-08-30 06:17:28,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095101109] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 06:17:28,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 06:17:28,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 06:17:28,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992756810] [2023-08-30 06:17:28,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 06:17:28,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 06:17:28,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 06:17:28,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 06:17:28,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-30 06:17:28,173 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 267 [2023-08-30 06:17:28,174 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 185 transitions, 2852 flow. Second operand has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 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) [2023-08-30 06:17:28,174 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 06:17:28,174 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 267 [2023-08-30 06:17:28,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 06:17:32,762 INFO L130 PetriNetUnfolder]: 27421/39615 cut-off events. [2023-08-30 06:17:32,762 INFO L131 PetriNetUnfolder]: For 413299/416259 co-relation queries the response was YES. [2023-08-30 06:17:33,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211262 conditions, 39615 events. 27421/39615 cut-off events. For 413299/416259 co-relation queries the response was YES. Maximal size of possible extension queue 2098. Compared 271064 event pairs, 5827 based on Foata normal form. 3168/42134 useless extension candidates. Maximal degree in co-relation 211216. Up to 14838 conditions per place. [2023-08-30 06:17:33,248 INFO L137 encePairwiseOnDemand]: 261/267 looper letters, 178 selfloop transitions, 108 changer transitions 2/302 dead transitions. [2023-08-30 06:17:33,248 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 302 transitions, 4573 flow [2023-08-30 06:17:33,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 06:17:33,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 06:17:33,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 771 transitions. [2023-08-30 06:17:33,249 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4812734082397004 [2023-08-30 06:17:33,249 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 771 transitions. [2023-08-30 06:17:33,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 771 transitions. [2023-08-30 06:17:33,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 06:17:33,250 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 771 transitions. [2023-08-30 06:17:33,250 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 128.5) internal successors, (771), 6 states have internal predecessors, (771), 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) [2023-08-30 06:17:33,252 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 267.0) internal successors, (1869), 7 states have internal predecessors, (1869), 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) [2023-08-30 06:17:33,252 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 267.0) internal successors, (1869), 7 states have internal predecessors, (1869), 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) [2023-08-30 06:17:33,252 INFO L175 Difference]: Start difference. First operand has 125 places, 185 transitions, 2852 flow. Second operand 6 states and 771 transitions. [2023-08-30 06:17:33,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 302 transitions, 4573 flow [2023-08-30 06:17:34,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 302 transitions, 4532 flow, removed 19 selfloop flow, removed 1 redundant places. [2023-08-30 06:17:34,798 INFO L231 Difference]: Finished difference. Result has 133 places, 210 transitions, 3591 flow [2023-08-30 06:17:34,798 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=2819, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3591, PETRI_PLACES=133, PETRI_TRANSITIONS=210} [2023-08-30 06:17:34,799 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 78 predicate places. [2023-08-30 06:17:34,799 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 210 transitions, 3591 flow [2023-08-30 06:17:34,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 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) [2023-08-30 06:17:34,799 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 06:17:34,799 INFO L208 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] [2023-08-30 06:17:34,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-08-30 06:17:34,800 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-30 06:17:34,800 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 06:17:34,800 INFO L85 PathProgramCache]: Analyzing trace with hash -496087306, now seen corresponding path program 6 times [2023-08-30 06:17:34,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 06:17:34,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690251633] [2023-08-30 06:17:34,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 06:17:34,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 06:17:34,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 06:17:34,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 06:17:34,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 06:17:34,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690251633] [2023-08-30 06:17:34,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690251633] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 06:17:34,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 06:17:34,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 06:17:34,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342607743] [2023-08-30 06:17:34,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 06:17:34,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 06:17:34,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 06:17:34,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 06:17:34,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 06:17:34,881 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 267 [2023-08-30 06:17:34,882 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 210 transitions, 3591 flow. Second operand has 5 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 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) [2023-08-30 06:17:34,882 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 06:17:34,882 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 267 [2023-08-30 06:17:34,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 06:17:40,081 INFO L130 PetriNetUnfolder]: 28365/41426 cut-off events. [2023-08-30 06:17:40,081 INFO L131 PetriNetUnfolder]: For 511297/514382 co-relation queries the response was YES. [2023-08-30 06:17:40,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 230886 conditions, 41426 events. 28365/41426 cut-off events. For 511297/514382 co-relation queries the response was YES. Maximal size of possible extension queue 2229. Compared 291733 event pairs, 8225 based on Foata normal form. 3029/43748 useless extension candidates. Maximal degree in co-relation 230836. Up to 23493 conditions per place. [2023-08-30 06:17:40,610 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 253 selfloop transitions, 45 changer transitions 6/318 dead transitions. [2023-08-30 06:17:40,610 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 318 transitions, 5475 flow [2023-08-30 06:17:40,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 06:17:40,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 06:17:40,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 650 transitions. [2023-08-30 06:17:40,612 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4868913857677903 [2023-08-30 06:17:40,612 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 650 transitions. [2023-08-30 06:17:40,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 650 transitions. [2023-08-30 06:17:40,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 06:17:40,612 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 650 transitions. [2023-08-30 06:17:40,613 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.0) internal successors, (650), 5 states have internal predecessors, (650), 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) [2023-08-30 06:17:40,614 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 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) [2023-08-30 06:17:40,614 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 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) [2023-08-30 06:17:40,614 INFO L175 Difference]: Start difference. First operand has 133 places, 210 transitions, 3591 flow. Second operand 5 states and 650 transitions. [2023-08-30 06:17:40,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 318 transitions, 5475 flow [2023-08-30 06:17:42,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 318 transitions, 5397 flow, removed 39 selfloop flow, removed 0 redundant places. [2023-08-30 06:17:42,885 INFO L231 Difference]: Finished difference. Result has 139 places, 213 transitions, 3709 flow [2023-08-30 06:17:42,885 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=3513, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3709, PETRI_PLACES=139, PETRI_TRANSITIONS=213} [2023-08-30 06:17:42,886 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 84 predicate places. [2023-08-30 06:17:42,886 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 213 transitions, 3709 flow [2023-08-30 06:17:42,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 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) [2023-08-30 06:17:42,886 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 06:17:42,886 INFO L208 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] [2023-08-30 06:17:42,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-08-30 06:17:42,887 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-30 06:17:42,887 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 06:17:42,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1842347611, now seen corresponding path program 3 times [2023-08-30 06:17:42,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 06:17:42,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81799052] [2023-08-30 06:17:42,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 06:17:42,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 06:17:42,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 06:17:42,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 06:17:42,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 06:17:42,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81799052] [2023-08-30 06:17:42,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81799052] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 06:17:42,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 06:17:42,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 06:17:42,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130696351] [2023-08-30 06:17:42,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 06:17:42,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 06:17:42,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 06:17:42,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 06:17:42,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 06:17:42,984 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 267 [2023-08-30 06:17:42,984 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 213 transitions, 3709 flow. Second operand has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 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) [2023-08-30 06:17:42,985 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 06:17:42,985 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 267 [2023-08-30 06:17:42,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 06:17:49,153 INFO L130 PetriNetUnfolder]: 33411/49244 cut-off events. [2023-08-30 06:17:49,153 INFO L131 PetriNetUnfolder]: For 663876/672333 co-relation queries the response was YES. [2023-08-30 06:17:49,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 276664 conditions, 49244 events. 33411/49244 cut-off events. For 663876/672333 co-relation queries the response was YES. Maximal size of possible extension queue 2648. Compared 358919 event pairs, 9866 based on Foata normal form. 6107/54726 useless extension candidates. Maximal degree in co-relation 276611. Up to 20809 conditions per place. [2023-08-30 06:17:49,790 INFO L137 encePairwiseOnDemand]: 261/267 looper letters, 262 selfloop transitions, 65 changer transitions 14/376 dead transitions. [2023-08-30 06:17:49,790 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 376 transitions, 6551 flow [2023-08-30 06:17:49,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 06:17:49,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 06:17:49,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 648 transitions. [2023-08-30 06:17:49,791 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4853932584269663 [2023-08-30 06:17:49,791 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 648 transitions. [2023-08-30 06:17:49,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 648 transitions. [2023-08-30 06:17:49,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 06:17:49,791 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 648 transitions. [2023-08-30 06:17:49,792 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.6) internal successors, (648), 5 states have internal predecessors, (648), 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) [2023-08-30 06:17:49,793 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 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) [2023-08-30 06:17:49,793 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 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) [2023-08-30 06:17:49,793 INFO L175 Difference]: Start difference. First operand has 139 places, 213 transitions, 3709 flow. Second operand 5 states and 648 transitions. [2023-08-30 06:17:49,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 376 transitions, 6551 flow [2023-08-30 06:17:51,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 376 transitions, 6413 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-08-30 06:17:51,881 INFO L231 Difference]: Finished difference. Result has 144 places, 242 transitions, 4318 flow [2023-08-30 06:17:51,881 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=3617, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4318, PETRI_PLACES=144, PETRI_TRANSITIONS=242} [2023-08-30 06:17:51,882 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 89 predicate places. [2023-08-30 06:17:51,882 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 242 transitions, 4318 flow [2023-08-30 06:17:51,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 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) [2023-08-30 06:17:51,882 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 06:17:51,882 INFO L208 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] [2023-08-30 06:17:51,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-08-30 06:17:51,883 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-30 06:17:51,883 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 06:17:51,883 INFO L85 PathProgramCache]: Analyzing trace with hash 944870335, now seen corresponding path program 4 times [2023-08-30 06:17:51,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 06:17:51,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706666715] [2023-08-30 06:17:51,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 06:17:51,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 06:17:51,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 06:17:51,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 06:17:51,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 06:17:51,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706666715] [2023-08-30 06:17:51,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706666715] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 06:17:51,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 06:17:51,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 06:17:51,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876506690] [2023-08-30 06:17:51,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 06:17:51,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 06:17:51,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 06:17:51,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 06:17:51,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-30 06:17:51,965 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 267 [2023-08-30 06:17:51,966 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 242 transitions, 4318 flow. Second operand has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 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) [2023-08-30 06:17:51,966 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 06:17:51,966 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 267 [2023-08-30 06:17:51,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 06:17:59,542 INFO L130 PetriNetUnfolder]: 37747/55963 cut-off events. [2023-08-30 06:17:59,542 INFO L131 PetriNetUnfolder]: For 800880/807523 co-relation queries the response was YES. [2023-08-30 06:18:00,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 333466 conditions, 55963 events. 37747/55963 cut-off events. For 800880/807523 co-relation queries the response was YES. Maximal size of possible extension queue 2967. Compared 420291 event pairs, 9640 based on Foata normal form. 5979/61247 useless extension candidates. Maximal degree in co-relation 333410. Up to 26850 conditions per place. [2023-08-30 06:18:00,622 INFO L137 encePairwiseOnDemand]: 261/267 looper letters, 474 selfloop transitions, 61 changer transitions 36/606 dead transitions. [2023-08-30 06:18:00,622 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 606 transitions, 11486 flow [2023-08-30 06:18:00,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 06:18:00,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 06:18:00,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 765 transitions. [2023-08-30 06:18:00,623 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47752808988764045 [2023-08-30 06:18:00,623 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 765 transitions. [2023-08-30 06:18:00,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 765 transitions. [2023-08-30 06:18:00,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 06:18:00,623 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 765 transitions. [2023-08-30 06:18:00,624 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 127.5) internal successors, (765), 6 states have internal predecessors, (765), 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) [2023-08-30 06:18:00,626 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 267.0) internal successors, (1869), 7 states have internal predecessors, (1869), 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) [2023-08-30 06:18:00,626 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 267.0) internal successors, (1869), 7 states have internal predecessors, (1869), 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) [2023-08-30 06:18:00,626 INFO L175 Difference]: Start difference. First operand has 144 places, 242 transitions, 4318 flow. Second operand 6 states and 765 transitions. [2023-08-30 06:18:00,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 606 transitions, 11486 flow [2023-08-30 06:18:04,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 606 transitions, 11367 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-08-30 06:18:04,009 INFO L231 Difference]: Finished difference. Result has 152 places, 292 transitions, 5448 flow [2023-08-30 06:18:04,009 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=4259, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5448, PETRI_PLACES=152, PETRI_TRANSITIONS=292} [2023-08-30 06:18:04,010 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 97 predicate places. [2023-08-30 06:18:04,010 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 292 transitions, 5448 flow [2023-08-30 06:18:04,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 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) [2023-08-30 06:18:04,011 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 06:18:04,011 INFO L208 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] [2023-08-30 06:18:04,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-08-30 06:18:04,011 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-30 06:18:04,012 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 06:18:04,012 INFO L85 PathProgramCache]: Analyzing trace with hash -868880549, now seen corresponding path program 5 times [2023-08-30 06:18:04,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 06:18:04,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514989623] [2023-08-30 06:18:04,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 06:18:04,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 06:18:04,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 06:18:04,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 06:18:04,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 06:18:04,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514989623] [2023-08-30 06:18:04,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514989623] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 06:18:04,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 06:18:04,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 06:18:04,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221006833] [2023-08-30 06:18:04,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 06:18:04,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 06:18:04,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 06:18:04,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 06:18:04,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 06:18:04,103 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 267 [2023-08-30 06:18:04,103 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 292 transitions, 5448 flow. Second operand has 5 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 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) [2023-08-30 06:18:04,103 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 06:18:04,104 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 267 [2023-08-30 06:18:04,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 06:18:12,818 INFO L130 PetriNetUnfolder]: 38974/58937 cut-off events. [2023-08-30 06:18:12,818 INFO L131 PetriNetUnfolder]: For 946683/952430 co-relation queries the response was YES. [2023-08-30 06:18:13,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 377028 conditions, 58937 events. 38974/58937 cut-off events. For 946683/952430 co-relation queries the response was YES. Maximal size of possible extension queue 3181. Compared 459318 event pairs, 10822 based on Foata normal form. 4722/62980 useless extension candidates. Maximal degree in co-relation 376968. Up to 28090 conditions per place. [2023-08-30 06:18:13,630 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 295 selfloop transitions, 87 changer transitions 18/435 dead transitions. [2023-08-30 06:18:13,630 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 435 transitions, 8277 flow [2023-08-30 06:18:13,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 06:18:13,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 06:18:13,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 648 transitions. [2023-08-30 06:18:13,631 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4853932584269663 [2023-08-30 06:18:13,631 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 648 transitions. [2023-08-30 06:18:13,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 648 transitions. [2023-08-30 06:18:13,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 06:18:13,631 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 648 transitions. [2023-08-30 06:18:13,632 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.6) internal successors, (648), 5 states have internal predecessors, (648), 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) [2023-08-30 06:18:13,634 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 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) [2023-08-30 06:18:13,634 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 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) [2023-08-30 06:18:13,634 INFO L175 Difference]: Start difference. First operand has 152 places, 292 transitions, 5448 flow. Second operand 5 states and 648 transitions. [2023-08-30 06:18:13,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 435 transitions, 8277 flow [2023-08-30 06:18:19,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 435 transitions, 8224 flow, removed 12 selfloop flow, removed 1 redundant places. [2023-08-30 06:18:19,256 INFO L231 Difference]: Finished difference. Result has 157 places, 295 transitions, 5657 flow [2023-08-30 06:18:19,257 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=5417, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=5657, PETRI_PLACES=157, PETRI_TRANSITIONS=295} [2023-08-30 06:18:19,257 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 102 predicate places. [2023-08-30 06:18:19,257 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 295 transitions, 5657 flow [2023-08-30 06:18:19,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 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) [2023-08-30 06:18:19,257 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 06:18:19,258 INFO L208 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] [2023-08-30 06:18:19,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-08-30 06:18:19,258 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-30 06:18:19,258 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 06:18:19,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1163998239, now seen corresponding path program 5 times [2023-08-30 06:18:19,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 06:18:19,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110505347] [2023-08-30 06:18:19,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 06:18:19,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 06:18:19,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 06:18:19,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 06:18:19,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 06:18:19,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110505347] [2023-08-30 06:18:19,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110505347] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 06:18:19,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 06:18:19,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 06:18:19,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506808141] [2023-08-30 06:18:19,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 06:18:19,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 06:18:19,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 06:18:19,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 06:18:19,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 06:18:19,334 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 267 [2023-08-30 06:18:19,334 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 295 transitions, 5657 flow. Second operand has 5 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 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) [2023-08-30 06:18:19,335 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 06:18:19,335 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 267 [2023-08-30 06:18:19,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 06:18:28,422 INFO L130 PetriNetUnfolder]: 38801/59204 cut-off events. [2023-08-30 06:18:28,423 INFO L131 PetriNetUnfolder]: For 1016268/1023002 co-relation queries the response was YES. [2023-08-30 06:18:29,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 383594 conditions, 59204 events. 38801/59204 cut-off events. For 1016268/1023002 co-relation queries the response was YES. Maximal size of possible extension queue 3532. Compared 473027 event pairs, 10233 based on Foata normal form. 6289/64289 useless extension candidates. Maximal degree in co-relation 383531. Up to 25584 conditions per place. [2023-08-30 06:18:29,289 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 306 selfloop transitions, 66 changer transitions 21/425 dead transitions. [2023-08-30 06:18:29,289 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 425 transitions, 8141 flow [2023-08-30 06:18:29,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 06:18:29,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 06:18:29,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 654 transitions. [2023-08-30 06:18:29,291 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4898876404494382 [2023-08-30 06:18:29,291 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 654 transitions. [2023-08-30 06:18:29,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 654 transitions. [2023-08-30 06:18:29,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 06:18:29,291 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 654 transitions. [2023-08-30 06:18:29,292 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.8) internal successors, (654), 5 states have internal predecessors, (654), 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) [2023-08-30 06:18:29,293 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 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) [2023-08-30 06:18:29,293 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 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) [2023-08-30 06:18:29,294 INFO L175 Difference]: Start difference. First operand has 157 places, 295 transitions, 5657 flow. Second operand 5 states and 654 transitions. [2023-08-30 06:18:29,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 425 transitions, 8141 flow [2023-08-30 06:18:34,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 425 transitions, 7887 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-08-30 06:18:34,155 INFO L231 Difference]: Finished difference. Result has 161 places, 300 transitions, 5771 flow [2023-08-30 06:18:34,156 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=5483, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=5771, PETRI_PLACES=161, PETRI_TRANSITIONS=300} [2023-08-30 06:18:34,156 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 106 predicate places. [2023-08-30 06:18:34,156 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 300 transitions, 5771 flow [2023-08-30 06:18:34,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 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) [2023-08-30 06:18:34,157 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 06:18:34,157 INFO L208 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] [2023-08-30 06:18:34,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-08-30 06:18:34,157 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-30 06:18:34,157 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 06:18:34,157 INFO L85 PathProgramCache]: Analyzing trace with hash 130711419, now seen corresponding path program 6 times [2023-08-30 06:18:34,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 06:18:34,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836612989] [2023-08-30 06:18:34,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 06:18:34,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 06:18:34,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 06:18:34,218 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 06:18:34,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 06:18:34,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836612989] [2023-08-30 06:18:34,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836612989] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 06:18:34,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 06:18:34,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 06:18:34,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132004003] [2023-08-30 06:18:34,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 06:18:34,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 06:18:34,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 06:18:34,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 06:18:34,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 06:18:34,255 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 267 [2023-08-30 06:18:34,256 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 300 transitions, 5771 flow. Second operand has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 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) [2023-08-30 06:18:34,256 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 06:18:34,256 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 267 [2023-08-30 06:18:34,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 06:18:43,452 INFO L130 PetriNetUnfolder]: 38036/58263 cut-off events. [2023-08-30 06:18:43,452 INFO L131 PetriNetUnfolder]: For 1017847/1024181 co-relation queries the response was YES. [2023-08-30 06:18:44,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 373173 conditions, 58263 events. 38036/58263 cut-off events. For 1017847/1024181 co-relation queries the response was YES. Maximal size of possible extension queue 3253. Compared 464460 event pairs, 11512 based on Foata normal form. 5904/63500 useless extension candidates. Maximal degree in co-relation 373108. Up to 26990 conditions per place. [2023-08-30 06:18:44,309 INFO L137 encePairwiseOnDemand]: 261/267 looper letters, 289 selfloop transitions, 124 changer transitions 23/469 dead transitions. [2023-08-30 06:18:44,309 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 469 transitions, 9326 flow [2023-08-30 06:18:44,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 06:18:44,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 06:18:44,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 646 transitions. [2023-08-30 06:18:44,310 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48389513108614235 [2023-08-30 06:18:44,310 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 646 transitions. [2023-08-30 06:18:44,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 646 transitions. [2023-08-30 06:18:44,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 06:18:44,311 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 646 transitions. [2023-08-30 06:18:44,312 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.2) internal successors, (646), 5 states have internal predecessors, (646), 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) [2023-08-30 06:18:44,313 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 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) [2023-08-30 06:18:44,313 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 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) [2023-08-30 06:18:44,313 INFO L175 Difference]: Start difference. First operand has 161 places, 300 transitions, 5771 flow. Second operand 5 states and 646 transitions. [2023-08-30 06:18:44,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 469 transitions, 9326 flow [2023-08-30 06:18:51,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 469 transitions, 9146 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-30 06:18:51,128 INFO L231 Difference]: Finished difference. Result has 166 places, 333 transitions, 6739 flow [2023-08-30 06:18:51,128 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=5651, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=6739, PETRI_PLACES=166, PETRI_TRANSITIONS=333} [2023-08-30 06:18:51,129 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 111 predicate places. [2023-08-30 06:18:51,129 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 333 transitions, 6739 flow [2023-08-30 06:18:51,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 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) [2023-08-30 06:18:51,130 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 06:18:51,130 INFO L208 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] [2023-08-30 06:18:51,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-08-30 06:18:51,130 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-30 06:18:51,131 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 06:18:51,131 INFO L85 PathProgramCache]: Analyzing trace with hash 743299887, now seen corresponding path program 7 times [2023-08-30 06:18:51,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 06:18:51,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811467652] [2023-08-30 06:18:51,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 06:18:51,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 06:18:51,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 06:18:51,192 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 06:18:51,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 06:18:51,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811467652] [2023-08-30 06:18:51,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811467652] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 06:18:51,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 06:18:51,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 06:18:51,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811986664] [2023-08-30 06:18:51,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 06:18:51,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 06:18:51,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 06:18:51,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 06:18:51,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-30 06:18:51,221 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 267 [2023-08-30 06:18:51,222 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 333 transitions, 6739 flow. Second operand has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 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) [2023-08-30 06:18:51,222 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 06:18:51,222 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 267 [2023-08-30 06:18:51,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 06:19:01,725 INFO L130 PetriNetUnfolder]: 41241/63199 cut-off events. [2023-08-30 06:19:01,725 INFO L131 PetriNetUnfolder]: For 1149652/1152390 co-relation queries the response was YES. [2023-08-30 06:19:02,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 418924 conditions, 63199 events. 41241/63199 cut-off events. For 1149652/1152390 co-relation queries the response was YES. Maximal size of possible extension queue 3445. Compared 507887 event pairs, 9740 based on Foata normal form. 3242/66071 useless extension candidates. Maximal degree in co-relation 418856. Up to 26002 conditions per place. [2023-08-30 06:19:02,761 INFO L137 encePairwiseOnDemand]: 261/267 looper letters, 475 selfloop transitions, 107 changer transitions 51/675 dead transitions. [2023-08-30 06:19:02,761 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 675 transitions, 13778 flow [2023-08-30 06:19:02,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 06:19:02,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 06:19:02,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 767 transitions. [2023-08-30 06:19:02,763 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4787765293383271 [2023-08-30 06:19:02,763 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 767 transitions. [2023-08-30 06:19:02,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 767 transitions. [2023-08-30 06:19:02,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 06:19:02,763 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 767 transitions. [2023-08-30 06:19:02,764 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 127.83333333333333) internal successors, (767), 6 states have internal predecessors, (767), 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) [2023-08-30 06:19:02,765 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 267.0) internal successors, (1869), 7 states have internal predecessors, (1869), 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) [2023-08-30 06:19:02,765 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 267.0) internal successors, (1869), 7 states have internal predecessors, (1869), 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) [2023-08-30 06:19:02,766 INFO L175 Difference]: Start difference. First operand has 166 places, 333 transitions, 6739 flow. Second operand 6 states and 767 transitions. [2023-08-30 06:19:02,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 675 transitions, 13778 flow [2023-08-30 06:19:16,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 675 transitions, 13446 flow, removed 100 selfloop flow, removed 1 redundant places. [2023-08-30 06:19:16,191 INFO L231 Difference]: Finished difference. Result has 174 places, 411 transitions, 8510 flow [2023-08-30 06:19:16,191 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=6499, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=333, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=8510, PETRI_PLACES=174, PETRI_TRANSITIONS=411} [2023-08-30 06:19:16,192 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 119 predicate places. [2023-08-30 06:19:16,192 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 411 transitions, 8510 flow [2023-08-30 06:19:16,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 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) [2023-08-30 06:19:16,192 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 06:19:16,192 INFO L208 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] [2023-08-30 06:19:16,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-08-30 06:19:16,192 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-30 06:19:16,192 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 06:19:16,193 INFO L85 PathProgramCache]: Analyzing trace with hash -66814013, now seen corresponding path program 8 times [2023-08-30 06:19:16,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 06:19:16,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354473872] [2023-08-30 06:19:16,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 06:19:16,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 06:19:16,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 06:19:16,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 06:19:16,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 06:19:16,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354473872] [2023-08-30 06:19:16,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354473872] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 06:19:16,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 06:19:16,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 06:19:16,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714539075] [2023-08-30 06:19:16,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 06:19:16,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 06:19:16,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 06:19:16,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 06:19:16,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 06:19:16,320 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 267 [2023-08-30 06:19:16,321 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 411 transitions, 8510 flow. Second operand has 5 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 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) [2023-08-30 06:19:16,321 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 06:19:16,321 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 267 [2023-08-30 06:19:16,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 06:19:28,460 INFO L130 PetriNetUnfolder]: 42085/65879 cut-off events. [2023-08-30 06:19:28,460 INFO L131 PetriNetUnfolder]: For 1335174/1337781 co-relation queries the response was YES. [2023-08-30 06:19:29,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 459813 conditions, 65879 events. 42085/65879 cut-off events. For 1335174/1337781 co-relation queries the response was YES. Maximal size of possible extension queue 3713. Compared 551433 event pairs, 8883 based on Foata normal form. 2361/67969 useless extension candidates. Maximal degree in co-relation 459741. Up to 20974 conditions per place. [2023-08-30 06:19:29,838 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 334 selfloop transitions, 159 changer transitions 24/559 dead transitions. [2023-08-30 06:19:29,838 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 559 transitions, 11756 flow [2023-08-30 06:19:29,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 06:19:29,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 06:19:29,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 646 transitions. [2023-08-30 06:19:29,840 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48389513108614235 [2023-08-30 06:19:29,840 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 646 transitions. [2023-08-30 06:19:29,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 646 transitions. [2023-08-30 06:19:29,841 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 06:19:29,841 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 646 transitions. [2023-08-30 06:19:29,841 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.2) internal successors, (646), 5 states have internal predecessors, (646), 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) [2023-08-30 06:19:29,843 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 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) [2023-08-30 06:19:29,843 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 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) [2023-08-30 06:19:29,843 INFO L175 Difference]: Start difference. First operand has 174 places, 411 transitions, 8510 flow. Second operand 5 states and 646 transitions. [2023-08-30 06:19:29,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 559 transitions, 11756 flow [2023-08-30 06:19:44,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 559 transitions, 11658 flow, removed 49 selfloop flow, removed 0 redundant places. [2023-08-30 06:19:44,323 INFO L231 Difference]: Finished difference. Result has 180 places, 415 transitions, 8882 flow [2023-08-30 06:19:44,324 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=8412, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=411, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=155, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=8882, PETRI_PLACES=180, PETRI_TRANSITIONS=415} [2023-08-30 06:19:44,324 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 125 predicate places. [2023-08-30 06:19:44,324 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 415 transitions, 8882 flow [2023-08-30 06:19:44,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 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) [2023-08-30 06:19:44,324 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 06:19:44,324 INFO L208 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] [2023-08-30 06:19:44,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-08-30 06:19:44,324 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-30 06:19:44,325 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 06:19:44,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1328780872, now seen corresponding path program 7 times [2023-08-30 06:19:44,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 06:19:44,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988134423] [2023-08-30 06:19:44,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 06:19:44,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 06:19:44,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 06:19:44,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 06:19:44,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 06:19:44,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988134423] [2023-08-30 06:19:44,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988134423] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 06:19:44,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1667105099] [2023-08-30 06:19:44,382 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-30 06:19:44,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 06:19:44,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 06:19:44,384 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 06:19:44,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-30 06:19:44,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 06:19:44,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-30 06:19:44,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 06:19:44,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 06:19:44,509 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 06:19:44,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 06:19:44,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1667105099] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 06:19:44,533 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 06:19:44,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-08-30 06:19:44,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998732604] [2023-08-30 06:19:44,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 06:19:44,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 06:19:44,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 06:19:44,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 06:19:44,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-08-30 06:19:44,594 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 267 [2023-08-30 06:19:44,595 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 415 transitions, 8882 flow. Second operand has 8 states, 8 states have (on average 115.75) internal successors, (926), 8 states have internal predecessors, (926), 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) [2023-08-30 06:19:44,595 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 06:19:44,595 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 267 [2023-08-30 06:19:44,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 06:19:56,731 INFO L130 PetriNetUnfolder]: 41884/64809 cut-off events. [2023-08-30 06:19:56,732 INFO L131 PetriNetUnfolder]: For 1465135/1467569 co-relation queries the response was YES. [2023-08-30 06:19:57,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 464145 conditions, 64809 events. 41884/64809 cut-off events. For 1465135/1467569 co-relation queries the response was YES. Maximal size of possible extension queue 3601. Compared 526297 event pairs, 10330 based on Foata normal form. 2684/67136 useless extension candidates. Maximal degree in co-relation 464070. Up to 44601 conditions per place. [2023-08-30 06:19:57,858 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 366 selfloop transitions, 151 changer transitions 13/572 dead transitions. [2023-08-30 06:19:57,858 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 572 transitions, 12601 flow [2023-08-30 06:19:57,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 06:19:57,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 06:19:57,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 636 transitions. [2023-08-30 06:19:57,859 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4764044943820225 [2023-08-30 06:19:57,859 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 636 transitions. [2023-08-30 06:19:57,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 636 transitions. [2023-08-30 06:19:57,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 06:19:57,860 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 636 transitions. [2023-08-30 06:19:57,860 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 127.2) internal successors, (636), 5 states have internal predecessors, (636), 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) [2023-08-30 06:19:57,861 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 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) [2023-08-30 06:19:57,861 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 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) [2023-08-30 06:19:57,861 INFO L175 Difference]: Start difference. First operand has 180 places, 415 transitions, 8882 flow. Second operand 5 states and 636 transitions. [2023-08-30 06:19:57,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 572 transitions, 12601 flow [2023-08-30 06:20:10,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 572 transitions, 12285 flow, removed 12 selfloop flow, removed 2 redundant places. [2023-08-30 06:20:10,102 INFO L231 Difference]: Finished difference. Result has 184 places, 428 transitions, 9325 flow [2023-08-30 06:20:10,103 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=8582, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=415, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=137, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=9325, PETRI_PLACES=184, PETRI_TRANSITIONS=428} [2023-08-30 06:20:10,103 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 129 predicate places. [2023-08-30 06:20:10,103 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 428 transitions, 9325 flow [2023-08-30 06:20:10,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 115.75) internal successors, (926), 8 states have internal predecessors, (926), 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) [2023-08-30 06:20:10,103 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 06:20:10,103 INFO L208 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] [2023-08-30 06:20:10,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-08-30 06:20:10,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2023-08-30 06:20:10,307 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-30 06:20:10,308 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 06:20:10,308 INFO L85 PathProgramCache]: Analyzing trace with hash 154314935, now seen corresponding path program 6 times [2023-08-30 06:20:10,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 06:20:10,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984242152] [2023-08-30 06:20:10,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 06:20:10,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 06:20:10,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 06:20:10,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 06:20:10,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 06:20:10,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984242152] [2023-08-30 06:20:10,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984242152] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 06:20:10,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 06:20:10,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 06:20:10,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703712932] [2023-08-30 06:20:10,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 06:20:10,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 06:20:10,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 06:20:10,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 06:20:10,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 06:20:10,387 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 267 [2023-08-30 06:20:10,388 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 428 transitions, 9325 flow. Second operand has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 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) [2023-08-30 06:20:10,388 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 06:20:10,388 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 267 [2023-08-30 06:20:10,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 06:20:21,531 INFO L130 PetriNetUnfolder]: 37676/57590 cut-off events. [2023-08-30 06:20:21,531 INFO L131 PetriNetUnfolder]: For 1424177/1429240 co-relation queries the response was YES. [2023-08-30 06:20:22,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 428340 conditions, 57590 events. 37676/57590 cut-off events. For 1424177/1429240 co-relation queries the response was YES. Maximal size of possible extension queue 3442. Compared 455859 event pairs, 10673 based on Foata normal form. 3503/59858 useless extension candidates. Maximal degree in co-relation 428263. Up to 24590 conditions per place. [2023-08-30 06:20:22,564 INFO L137 encePairwiseOnDemand]: 261/267 looper letters, 413 selfloop transitions, 95 changer transitions 29/597 dead transitions. [2023-08-30 06:20:22,564 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 597 transitions, 13010 flow [2023-08-30 06:20:22,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 06:20:22,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 06:20:22,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 652 transitions. [2023-08-30 06:20:22,566 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4883895131086142 [2023-08-30 06:20:22,566 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 652 transitions. [2023-08-30 06:20:22,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 652 transitions. [2023-08-30 06:20:22,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 06:20:22,566 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 652 transitions. [2023-08-30 06:20:22,567 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.4) internal successors, (652), 5 states have internal predecessors, (652), 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) [2023-08-30 06:20:22,568 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 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) [2023-08-30 06:20:22,568 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 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) [2023-08-30 06:20:22,568 INFO L175 Difference]: Start difference. First operand has 184 places, 428 transitions, 9325 flow. Second operand 5 states and 652 transitions. [2023-08-30 06:20:22,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 597 transitions, 13010 flow [2023-08-30 06:20:30,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 597 transitions, 12768 flow, removed 26 selfloop flow, removed 2 redundant places. [2023-08-30 06:20:30,383 INFO L231 Difference]: Finished difference. Result has 187 places, 436 transitions, 9545 flow [2023-08-30 06:20:30,383 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=9111, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=428, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=333, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=9545, PETRI_PLACES=187, PETRI_TRANSITIONS=436} [2023-08-30 06:20:30,383 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 132 predicate places. [2023-08-30 06:20:30,383 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 436 transitions, 9545 flow [2023-08-30 06:20:30,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 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) [2023-08-30 06:20:30,384 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 06:20:30,384 INFO L208 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] [2023-08-30 06:20:30,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2023-08-30 06:20:30,384 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-30 06:20:30,384 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 06:20:30,384 INFO L85 PathProgramCache]: Analyzing trace with hash 339540687, now seen corresponding path program 9 times [2023-08-30 06:20:30,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 06:20:30,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853519742] [2023-08-30 06:20:30,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 06:20:30,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 06:20:30,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 06:20:30,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 06:20:30,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 06:20:30,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853519742] [2023-08-30 06:20:30,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853519742] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 06:20:30,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 06:20:30,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 06:20:30,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343931909] [2023-08-30 06:20:30,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 06:20:30,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 06:20:30,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 06:20:30,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 06:20:30,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 06:20:30,481 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 267 [2023-08-30 06:20:30,482 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 436 transitions, 9545 flow. Second operand has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 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) [2023-08-30 06:20:30,482 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 06:20:30,482 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 267 [2023-08-30 06:20:30,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 06:20:41,772 INFO L130 PetriNetUnfolder]: 36626/56604 cut-off events. [2023-08-30 06:20:41,772 INFO L131 PetriNetUnfolder]: For 1358527/1361703 co-relation queries the response was YES. [2023-08-30 06:20:42,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 418200 conditions, 56604 events. 36626/56604 cut-off events. For 1358527/1361703 co-relation queries the response was YES. Maximal size of possible extension queue 3226. Compared 453073 event pairs, 8638 based on Foata normal form. 3065/59304 useless extension candidates. Maximal degree in co-relation 418122. Up to 26205 conditions per place. [2023-08-30 06:20:42,840 INFO L137 encePairwiseOnDemand]: 261/267 looper letters, 360 selfloop transitions, 204 changer transitions 37/640 dead transitions. [2023-08-30 06:20:42,841 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 640 transitions, 14544 flow [2023-08-30 06:20:42,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 06:20:42,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 06:20:42,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 644 transitions. [2023-08-30 06:20:42,842 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48239700374531835 [2023-08-30 06:20:42,842 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 644 transitions. [2023-08-30 06:20:42,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 644 transitions. [2023-08-30 06:20:42,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 06:20:42,842 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 644 transitions. [2023-08-30 06:20:42,843 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.8) internal successors, (644), 5 states have internal predecessors, (644), 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) [2023-08-30 06:20:42,844 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 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) [2023-08-30 06:20:42,844 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 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) [2023-08-30 06:20:42,844 INFO L175 Difference]: Start difference. First operand has 187 places, 436 transitions, 9545 flow. Second operand 5 states and 644 transitions. [2023-08-30 06:20:42,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 640 transitions, 14544 flow [2023-08-30 06:20:53,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 640 transitions, 14232 flow, removed 48 selfloop flow, removed 3 redundant places. [2023-08-30 06:20:53,274 INFO L231 Difference]: Finished difference. Result has 191 places, 495 transitions, 11489 flow [2023-08-30 06:20:53,275 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=9339, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=436, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=142, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=11489, PETRI_PLACES=191, PETRI_TRANSITIONS=495} [2023-08-30 06:20:53,275 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 136 predicate places. [2023-08-30 06:20:53,275 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 495 transitions, 11489 flow [2023-08-30 06:20:53,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 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) [2023-08-30 06:20:53,276 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 06:20:53,276 INFO L208 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] [2023-08-30 06:20:53,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2023-08-30 06:20:53,276 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-30 06:20:53,276 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 06:20:53,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1365040330, now seen corresponding path program 8 times [2023-08-30 06:20:53,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 06:20:53,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441228518] [2023-08-30 06:20:53,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 06:20:53,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 06:20:53,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 06:20:53,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 06:20:53,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 06:20:53,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441228518] [2023-08-30 06:20:53,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441228518] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 06:20:53,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983221401] [2023-08-30 06:20:53,337 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 06:20:53,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 06:20:53,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 06:20:53,338 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 06:20:53,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-30 06:20:53,448 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 06:20:53,449 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 06:20:53,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-30 06:20:53,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 06:20:53,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 06:20:53,494 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 06:20:53,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 06:20:53,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1983221401] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 06:20:53,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 06:20:53,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-08-30 06:20:53,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060694747] [2023-08-30 06:20:53,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 06:20:53,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-30 06:20:53,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 06:20:53,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-30 06:20:53,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-08-30 06:20:53,567 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 267 [2023-08-30 06:20:53,568 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 495 transitions, 11489 flow. Second operand has 10 states, 10 states have (on average 115.5) internal successors, (1155), 10 states have internal predecessors, (1155), 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) [2023-08-30 06:20:53,568 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 06:20:53,568 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 267 [2023-08-30 06:20:53,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 06:21:05,637 INFO L130 PetriNetUnfolder]: 38085/58383 cut-off events. [2023-08-30 06:21:05,637 INFO L131 PetriNetUnfolder]: For 1459002/1462246 co-relation queries the response was YES. [2023-08-30 06:21:06,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 443459 conditions, 58383 events. 38085/58383 cut-off events. For 1459002/1462246 co-relation queries the response was YES. Maximal size of possible extension queue 3302. Compared 460761 event pairs, 7399 based on Foata normal form. 3015/60989 useless extension candidates. Maximal degree in co-relation 443378. Up to 25881 conditions per place. [2023-08-30 06:21:06,785 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 494 selfloop transitions, 224 changer transitions 40/797 dead transitions. [2023-08-30 06:21:06,785 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 797 transitions, 18278 flow [2023-08-30 06:21:06,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 06:21:06,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 06:21:06,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1017 transitions. [2023-08-30 06:21:06,787 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.476123595505618 [2023-08-30 06:21:06,787 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1017 transitions. [2023-08-30 06:21:06,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1017 transitions. [2023-08-30 06:21:06,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 06:21:06,787 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1017 transitions. [2023-08-30 06:21:06,788 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 127.125) internal successors, (1017), 8 states have internal predecessors, (1017), 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) [2023-08-30 06:21:06,789 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 267.0) internal successors, (2403), 9 states have internal predecessors, (2403), 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) [2023-08-30 06:21:06,789 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 267.0) internal successors, (2403), 9 states have internal predecessors, (2403), 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) [2023-08-30 06:21:06,790 INFO L175 Difference]: Start difference. First operand has 191 places, 495 transitions, 11489 flow. Second operand 8 states and 1017 transitions. [2023-08-30 06:21:06,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 797 transitions, 18278 flow [2023-08-30 06:21:20,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 797 transitions, 17880 flow, removed 115 selfloop flow, removed 1 redundant places. [2023-08-30 06:21:20,020 INFO L231 Difference]: Finished difference. Result has 199 places, 512 transitions, 12023 flow [2023-08-30 06:21:20,020 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=11091, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=495, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=207, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=12023, PETRI_PLACES=199, PETRI_TRANSITIONS=512} [2023-08-30 06:21:20,021 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 144 predicate places. [2023-08-30 06:21:20,021 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 512 transitions, 12023 flow [2023-08-30 06:21:20,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 115.5) internal successors, (1155), 10 states have internal predecessors, (1155), 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) [2023-08-30 06:21:20,021 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 06:21:20,021 INFO L208 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] [2023-08-30 06:21:20,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-08-30 06:21:20,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2023-08-30 06:21:20,222 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-30 06:21:20,222 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 06:21:20,222 INFO L85 PathProgramCache]: Analyzing trace with hash 753687983, now seen corresponding path program 10 times [2023-08-30 06:21:20,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 06:21:20,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268513750] [2023-08-30 06:21:20,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 06:21:20,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 06:21:20,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 06:21:20,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 06:21:20,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 06:21:20,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268513750] [2023-08-30 06:21:20,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268513750] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 06:21:20,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 06:21:20,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 06:21:20,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739802885] [2023-08-30 06:21:20,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 06:21:20,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 06:21:20,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 06:21:20,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 06:21:20,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-30 06:21:20,306 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 267 [2023-08-30 06:21:20,307 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 512 transitions, 12023 flow. Second operand has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 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) [2023-08-30 06:21:20,307 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 06:21:20,307 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 267 [2023-08-30 06:21:20,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 06:21:32,308 INFO L130 PetriNetUnfolder]: 37323/57241 cut-off events. [2023-08-30 06:21:32,308 INFO L131 PetriNetUnfolder]: For 1510642/1515530 co-relation queries the response was YES. [2023-08-30 06:21:33,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 434279 conditions, 57241 events. 37323/57241 cut-off events. For 1510642/1515530 co-relation queries the response was YES. Maximal size of possible extension queue 3298. Compared 454740 event pairs, 8774 based on Foata normal form. 3254/59886 useless extension candidates. Maximal degree in co-relation 434196. Up to 22809 conditions per place. [2023-08-30 06:21:33,404 INFO L137 encePairwiseOnDemand]: 261/267 looper letters, 458 selfloop transitions, 183 changer transitions 72/769 dead transitions. [2023-08-30 06:21:33,404 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 769 transitions, 18118 flow [2023-08-30 06:21:33,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 06:21:33,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 06:21:33,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 763 transitions. [2023-08-30 06:21:33,405 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4762796504369538 [2023-08-30 06:21:33,405 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 763 transitions. [2023-08-30 06:21:33,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 763 transitions. [2023-08-30 06:21:33,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 06:21:33,405 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 763 transitions. [2023-08-30 06:21:33,633 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 127.16666666666667) internal successors, (763), 6 states have internal predecessors, (763), 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) [2023-08-30 06:21:33,635 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 267.0) internal successors, (1869), 7 states have internal predecessors, (1869), 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) [2023-08-30 06:21:33,635 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 267.0) internal successors, (1869), 7 states have internal predecessors, (1869), 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) [2023-08-30 06:21:33,635 INFO L175 Difference]: Start difference. First operand has 199 places, 512 transitions, 12023 flow. Second operand 6 states and 763 transitions. [2023-08-30 06:21:33,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 769 transitions, 18118 flow [2023-08-30 06:21:46,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 769 transitions, 17548 flow, removed 43 selfloop flow, removed 5 redundant places. [2023-08-30 06:21:46,114 INFO L231 Difference]: Finished difference. Result has 203 places, 578 transitions, 13692 flow [2023-08-30 06:21:46,115 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=11539, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=512, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=113, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=13692, PETRI_PLACES=203, PETRI_TRANSITIONS=578} [2023-08-30 06:21:46,115 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 148 predicate places. [2023-08-30 06:21:46,115 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 578 transitions, 13692 flow [2023-08-30 06:21:46,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 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) [2023-08-30 06:21:46,116 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 06:21:46,116 INFO L208 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] [2023-08-30 06:21:46,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2023-08-30 06:21:46,116 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-30 06:21:46,117 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 06:21:46,117 INFO L85 PathProgramCache]: Analyzing trace with hash 780929349, now seen corresponding path program 11 times [2023-08-30 06:21:46,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 06:21:46,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677317543] [2023-08-30 06:21:46,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 06:21:46,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 06:21:46,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 06:21:46,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 06:21:46,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 06:21:46,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677317543] [2023-08-30 06:21:46,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677317543] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 06:21:46,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 06:21:46,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 06:21:46,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238750249] [2023-08-30 06:21:46,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 06:21:46,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 06:21:46,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 06:21:46,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 06:21:46,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-30 06:21:46,204 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 267 [2023-08-30 06:21:46,205 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 578 transitions, 13692 flow. Second operand has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 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) [2023-08-30 06:21:46,205 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 06:21:46,205 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 267 [2023-08-30 06:21:46,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 06:21:59,130 INFO L130 PetriNetUnfolder]: 37664/57098 cut-off events. [2023-08-30 06:21:59,130 INFO L131 PetriNetUnfolder]: For 1600579/1603822 co-relation queries the response was YES. [2023-08-30 06:22:00,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 451549 conditions, 57098 events. 37664/57098 cut-off events. For 1600579/1603822 co-relation queries the response was YES. Maximal size of possible extension queue 3217. Compared 440946 event pairs, 11026 based on Foata normal form. 2381/58844 useless extension candidates. Maximal degree in co-relation 451462. Up to 27492 conditions per place. [2023-08-30 06:22:00,347 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 515 selfloop transitions, 159 changer transitions 26/756 dead transitions. [2023-08-30 06:22:00,347 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 756 transitions, 18493 flow [2023-08-30 06:22:00,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 06:22:00,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 06:22:00,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 642 transitions. [2023-08-30 06:22:00,348 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48089887640449436 [2023-08-30 06:22:00,348 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 642 transitions. [2023-08-30 06:22:00,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 642 transitions. [2023-08-30 06:22:00,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 06:22:00,348 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 642 transitions. [2023-08-30 06:22:00,349 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.4) internal successors, (642), 5 states have internal predecessors, (642), 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) [2023-08-30 06:22:00,350 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 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) [2023-08-30 06:22:00,350 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 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) [2023-08-30 06:22:00,350 INFO L175 Difference]: Start difference. First operand has 203 places, 578 transitions, 13692 flow. Second operand 5 states and 642 transitions. [2023-08-30 06:22:00,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 756 transitions, 18493 flow [2023-08-30 06:22:13,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 756 transitions, 18271 flow, removed 111 selfloop flow, removed 0 redundant places. [2023-08-30 06:22:13,857 INFO L231 Difference]: Finished difference. Result has 208 places, 598 transitions, 14351 flow [2023-08-30 06:22:13,857 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=13502, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=578, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=139, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=439, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=14351, PETRI_PLACES=208, PETRI_TRANSITIONS=598} [2023-08-30 06:22:13,857 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 153 predicate places. [2023-08-30 06:22:13,858 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 598 transitions, 14351 flow [2023-08-30 06:22:13,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 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) [2023-08-30 06:22:13,858 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 06:22:13,858 INFO L208 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] [2023-08-30 06:22:13,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2023-08-30 06:22:13,858 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-30 06:22:13,859 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 06:22:13,859 INFO L85 PathProgramCache]: Analyzing trace with hash 34021147, now seen corresponding path program 12 times [2023-08-30 06:22:13,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 06:22:13,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282196509] [2023-08-30 06:22:13,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 06:22:13,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 06:22:13,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 06:22:13,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 06:22:13,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 06:22:13,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282196509] [2023-08-30 06:22:13,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282196509] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 06:22:13,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 06:22:13,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 06:22:13,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064996855] [2023-08-30 06:22:13,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 06:22:13,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 06:22:13,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 06:22:13,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 06:22:13,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-30 06:22:13,941 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 267 [2023-08-30 06:22:13,942 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 598 transitions, 14351 flow. Second operand has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 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) [2023-08-30 06:22:13,942 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 06:22:13,942 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 267 [2023-08-30 06:22:13,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 06:22:29,359 INFO L130 PetriNetUnfolder]: 40033/60338 cut-off events. [2023-08-30 06:22:29,359 INFO L131 PetriNetUnfolder]: For 1706625/1709374 co-relation queries the response was YES. [2023-08-30 06:22:30,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 482882 conditions, 60338 events. 40033/60338 cut-off events. For 1706625/1709374 co-relation queries the response was YES. Maximal size of possible extension queue 3352. Compared 462894 event pairs, 10850 based on Foata normal form. 2132/61937 useless extension candidates. Maximal degree in co-relation 482793. Up to 23580 conditions per place. [2023-08-30 06:22:30,621 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 483 selfloop transitions, 219 changer transitions 24/770 dead transitions. [2023-08-30 06:22:30,621 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 770 transitions, 19093 flow [2023-08-30 06:22:30,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 06:22:30,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 06:22:30,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 642 transitions. [2023-08-30 06:22:30,622 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48089887640449436 [2023-08-30 06:22:30,622 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 642 transitions. [2023-08-30 06:22:30,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 642 transitions. [2023-08-30 06:22:30,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 06:22:30,622 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 642 transitions. [2023-08-30 06:22:30,623 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.4) internal successors, (642), 5 states have internal predecessors, (642), 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) [2023-08-30 06:22:30,624 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 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) [2023-08-30 06:22:30,625 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 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) [2023-08-30 06:22:30,625 INFO L175 Difference]: Start difference. First operand has 208 places, 598 transitions, 14351 flow. Second operand 5 states and 642 transitions. [2023-08-30 06:22:30,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 770 transitions, 19093 flow [2023-08-30 06:22:45,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 770 transitions, 18679 flow, removed 26 selfloop flow, removed 3 redundant places. [2023-08-30 06:22:45,654 INFO L231 Difference]: Finished difference. Result has 210 places, 626 transitions, 15244 flow [2023-08-30 06:22:45,655 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=13987, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=598, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=191, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=407, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=15244, PETRI_PLACES=210, PETRI_TRANSITIONS=626} [2023-08-30 06:22:45,655 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 155 predicate places. [2023-08-30 06:22:45,656 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 626 transitions, 15244 flow [2023-08-30 06:22:45,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 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) [2023-08-30 06:22:45,656 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 06:22:45,656 INFO L208 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] [2023-08-30 06:22:45,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2023-08-30 06:22:45,656 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-30 06:22:45,657 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 06:22:45,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1102447902, now seen corresponding path program 9 times [2023-08-30 06:22:45,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 06:22:45,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756042636] [2023-08-30 06:22:45,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 06:22:45,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 06:22:45,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 06:22:45,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 06:22:45,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 06:22:45,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756042636] [2023-08-30 06:22:45,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756042636] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 06:22:45,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606254500] [2023-08-30 06:22:45,714 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 06:22:45,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 06:22:45,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 06:22:45,721 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 06:22:45,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-08-30 06:22:45,835 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-30 06:22:45,835 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 06:22:45,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-30 06:22:45,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 06:22:45,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 06:22:45,865 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 06:22:45,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 06:22:45,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1606254500] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 06:22:45,886 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 06:22:45,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-08-30 06:22:45,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300962993] [2023-08-30 06:22:45,886 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 06:22:45,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-30 06:22:45,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 06:22:45,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-30 06:22:45,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-08-30 06:22:45,940 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 267 [2023-08-30 06:22:45,941 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 626 transitions, 15244 flow. Second operand has 10 states, 10 states have (on average 115.3) internal successors, (1153), 10 states have internal predecessors, (1153), 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) [2023-08-30 06:22:45,941 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 06:22:45,941 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 267 [2023-08-30 06:22:45,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 06:22:59,917 INFO L130 PetriNetUnfolder]: 38509/58104 cut-off events. [2023-08-30 06:22:59,918 INFO L131 PetriNetUnfolder]: For 1720360/1723990 co-relation queries the response was YES. [2023-08-30 06:23:00,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 469495 conditions, 58104 events. 38509/58104 cut-off events. For 1720360/1723990 co-relation queries the response was YES. Maximal size of possible extension queue 3242. Compared 445906 event pairs, 12061 based on Foata normal form. 2643/60287 useless extension candidates. Maximal degree in co-relation 469405. Up to 28512 conditions per place. [2023-08-30 06:23:01,081 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 525 selfloop transitions, 171 changer transitions 37/773 dead transitions. [2023-08-30 06:23:01,082 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 773 transitions, 19388 flow [2023-08-30 06:23:01,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 06:23:01,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 06:23:01,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 637 transitions. [2023-08-30 06:23:01,083 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4771535580524345 [2023-08-30 06:23:01,083 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 637 transitions. [2023-08-30 06:23:01,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 637 transitions. [2023-08-30 06:23:01,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 06:23:01,084 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 637 transitions. [2023-08-30 06:23:01,084 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 127.4) internal successors, (637), 5 states have internal predecessors, (637), 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) [2023-08-30 06:23:01,085 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 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) [2023-08-30 06:23:01,085 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 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) [2023-08-30 06:23:01,085 INFO L175 Difference]: Start difference. First operand has 210 places, 626 transitions, 15244 flow. Second operand 5 states and 637 transitions. [2023-08-30 06:23:01,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 773 transitions, 19388 flow [2023-08-30 06:23:15,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 773 transitions, 18810 flow, removed 70 selfloop flow, removed 3 redundant places. [2023-08-30 06:23:15,473 INFO L231 Difference]: Finished difference. Result has 212 places, 617 transitions, 14932 flow [2023-08-30 06:23:15,473 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=14666, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=626, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=163, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=463, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=14932, PETRI_PLACES=212, PETRI_TRANSITIONS=617} [2023-08-30 06:23:15,474 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 157 predicate places. [2023-08-30 06:23:15,474 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 617 transitions, 14932 flow [2023-08-30 06:23:15,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 115.3) internal successors, (1153), 10 states have internal predecessors, (1153), 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) [2023-08-30 06:23:15,474 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 06:23:15,474 INFO L208 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] [2023-08-30 06:23:15,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-08-30 06:23:15,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2023-08-30 06:23:15,676 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-30 06:23:15,677 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 06:23:15,677 INFO L85 PathProgramCache]: Analyzing trace with hash -462565781, now seen corresponding path program 13 times [2023-08-30 06:23:15,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 06:23:15,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466357193] [2023-08-30 06:23:15,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 06:23:15,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 06:23:15,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 06:23:15,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 06:23:15,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 06:23:15,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466357193] [2023-08-30 06:23:15,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466357193] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 06:23:15,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 06:23:15,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 06:23:15,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303480044] [2023-08-30 06:23:15,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 06:23:15,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 06:23:15,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 06:23:15,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 06:23:15,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 06:23:15,760 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 267 [2023-08-30 06:23:15,761 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 617 transitions, 14932 flow. Second operand has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 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) [2023-08-30 06:23:15,761 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 06:23:15,761 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 267 [2023-08-30 06:23:15,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 06:23:27,650 INFO L130 PetriNetUnfolder]: 34574/51530 cut-off events. [2023-08-30 06:23:27,650 INFO L131 PetriNetUnfolder]: For 1515816/1519201 co-relation queries the response was YES. [2023-08-30 06:23:28,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 416848 conditions, 51530 events. 34574/51530 cut-off events. For 1515816/1519201 co-relation queries the response was YES. Maximal size of possible extension queue 2827. Compared 380596 event pairs, 9808 based on Foata normal form. 2459/53559 useless extension candidates. Maximal degree in co-relation 416757. Up to 21361 conditions per place. [2023-08-30 06:23:28,722 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 511 selfloop transitions, 199 changer transitions 27/771 dead transitions. [2023-08-30 06:23:28,722 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 771 transitions, 19281 flow [2023-08-30 06:23:28,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 06:23:28,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 06:23:28,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 640 transitions. [2023-08-30 06:23:28,723 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4794007490636704 [2023-08-30 06:23:28,723 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 640 transitions. [2023-08-30 06:23:28,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 640 transitions. [2023-08-30 06:23:28,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 06:23:28,724 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 640 transitions. [2023-08-30 06:23:28,724 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.0) internal successors, (640), 5 states have internal predecessors, (640), 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) [2023-08-30 06:23:28,725 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 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) [2023-08-30 06:23:28,725 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 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) [2023-08-30 06:23:28,725 INFO L175 Difference]: Start difference. First operand has 212 places, 617 transitions, 14932 flow. Second operand 5 states and 640 transitions. [2023-08-30 06:23:28,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 771 transitions, 19281 flow [2023-08-30 06:23:40,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 771 transitions, 18907 flow, removed 93 selfloop flow, removed 2 redundant places. [2023-08-30 06:23:40,840 INFO L231 Difference]: Finished difference. Result has 215 places, 624 transitions, 15327 flow [2023-08-30 06:23:40,841 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=14560, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=617, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=177, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=418, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=15327, PETRI_PLACES=215, PETRI_TRANSITIONS=624} [2023-08-30 06:23:40,842 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 160 predicate places. [2023-08-30 06:23:40,842 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 624 transitions, 15327 flow [2023-08-30 06:23:40,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 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) [2023-08-30 06:23:40,842 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 06:23:40,842 INFO L208 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] [2023-08-30 06:23:40,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2023-08-30 06:23:40,843 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-30 06:23:40,843 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 06:23:40,843 INFO L85 PathProgramCache]: Analyzing trace with hash -482494160, now seen corresponding path program 6 times [2023-08-30 06:23:40,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 06:23:40,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169619178] [2023-08-30 06:23:40,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 06:23:40,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 06:23:40,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 06:23:40,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 06:23:40,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 06:23:40,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169619178] [2023-08-30 06:23:40,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169619178] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 06:23:40,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119298112] [2023-08-30 06:23:40,896 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-30 06:23:40,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 06:23:40,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 06:23:40,898 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 06:23:40,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-08-30 06:23:41,038 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-08-30 06:23:41,038 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 06:23:41,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-30 06:23:41,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 06:23:41,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 06:23:41,085 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 06:23:41,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 06:23:41,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [119298112] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 06:23:41,117 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 06:23:41,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-08-30 06:23:41,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477704188] [2023-08-30 06:23:41,117 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 06:23:41,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-30 06:23:41,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 06:23:41,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-30 06:23:41,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-08-30 06:23:41,169 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 267 [2023-08-30 06:23:41,170 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 624 transitions, 15327 flow. Second operand has 10 states, 10 states have (on average 116.5) internal successors, (1165), 10 states have internal predecessors, (1165), 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) [2023-08-30 06:23:41,170 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 06:23:41,170 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 267 [2023-08-30 06:23:41,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 06:23:52,540 INFO L130 PetriNetUnfolder]: 33421/48947 cut-off events. [2023-08-30 06:23:52,540 INFO L131 PetriNetUnfolder]: For 1457129/1463548 co-relation queries the response was YES. [2023-08-30 06:23:53,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 400215 conditions, 48947 events. 33421/48947 cut-off events. For 1457129/1463548 co-relation queries the response was YES. Maximal size of possible extension queue 2809. Compared 351292 event pairs, 6188 based on Foata normal form. 3935/51900 useless extension candidates. Maximal degree in co-relation 400123. Up to 20731 conditions per place. [2023-08-30 06:23:53,499 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 707 selfloop transitions, 162 changer transitions 87/1017 dead transitions. [2023-08-30 06:23:53,499 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 1017 transitions, 25390 flow [2023-08-30 06:23:53,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 06:23:53,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 06:23:53,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1025 transitions. [2023-08-30 06:23:53,500 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4798689138576779 [2023-08-30 06:23:53,500 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1025 transitions. [2023-08-30 06:23:53,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1025 transitions. [2023-08-30 06:23:53,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 06:23:53,501 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1025 transitions. [2023-08-30 06:23:53,501 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 128.125) internal successors, (1025), 8 states have internal predecessors, (1025), 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) [2023-08-30 06:23:53,503 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 267.0) internal successors, (2403), 9 states have internal predecessors, (2403), 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) [2023-08-30 06:23:53,503 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 267.0) internal successors, (2403), 9 states have internal predecessors, (2403), 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) [2023-08-30 06:23:53,503 INFO L175 Difference]: Start difference. First operand has 215 places, 624 transitions, 15327 flow. Second operand 8 states and 1025 transitions. [2023-08-30 06:23:53,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 1017 transitions, 25390 flow [2023-08-30 06:24:02,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 1017 transitions, 24188 flow, removed 153 selfloop flow, removed 5 redundant places. [2023-08-30 06:24:02,322 INFO L231 Difference]: Finished difference. Result has 218 places, 646 transitions, 15535 flow [2023-08-30 06:24:02,323 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=14565, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=624, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=133, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=478, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=15535, PETRI_PLACES=218, PETRI_TRANSITIONS=646} [2023-08-30 06:24:02,323 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 163 predicate places. [2023-08-30 06:24:02,323 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 646 transitions, 15535 flow [2023-08-30 06:24:02,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 116.5) internal successors, (1165), 10 states have internal predecessors, (1165), 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) [2023-08-30 06:24:02,323 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 06:24:02,323 INFO L208 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] [2023-08-30 06:24:02,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-08-30 06:24:02,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2023-08-30 06:24:02,525 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-30 06:24:02,525 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 06:24:02,525 INFO L85 PathProgramCache]: Analyzing trace with hash -413986243, now seen corresponding path program 7 times [2023-08-30 06:24:02,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 06:24:02,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255582391] [2023-08-30 06:24:02,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 06:24:02,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 06:24:02,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 06:24:02,579 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 06:24:02,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 06:24:02,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255582391] [2023-08-30 06:24:02,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255582391] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 06:24:02,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 06:24:02,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 06:24:02,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722421655] [2023-08-30 06:24:02,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 06:24:02,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 06:24:02,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 06:24:02,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 06:24:02,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-30 06:24:02,606 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 267 [2023-08-30 06:24:02,606 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 646 transitions, 15535 flow. Second operand has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 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) [2023-08-30 06:24:02,607 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 06:24:02,607 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 267 [2023-08-30 06:24:02,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 06:24:13,053 INFO L130 PetriNetUnfolder]: 31341/45428 cut-off events. [2023-08-30 06:24:13,053 INFO L131 PetriNetUnfolder]: For 1287985/1291702 co-relation queries the response was YES. [2023-08-30 06:24:13,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 378761 conditions, 45428 events. 31341/45428 cut-off events. For 1287985/1291702 co-relation queries the response was YES. Maximal size of possible extension queue 2470. Compared 314667 event pairs, 8008 based on Foata normal form. 3149/47721 useless extension candidates. Maximal degree in co-relation 378668. Up to 25755 conditions per place. [2023-08-30 06:24:14,029 INFO L137 encePairwiseOnDemand]: 261/267 looper letters, 512 selfloop transitions, 193 changer transitions 89/831 dead transitions. [2023-08-30 06:24:14,029 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 831 transitions, 20521 flow [2023-08-30 06:24:14,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 06:24:14,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 06:24:14,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 773 transitions. [2023-08-30 06:24:14,030 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48252184769038703 [2023-08-30 06:24:14,030 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 773 transitions. [2023-08-30 06:24:14,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 773 transitions. [2023-08-30 06:24:14,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 06:24:14,031 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 773 transitions. [2023-08-30 06:24:14,031 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 128.83333333333334) internal successors, (773), 6 states have internal predecessors, (773), 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) [2023-08-30 06:24:14,032 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 267.0) internal successors, (1869), 7 states have internal predecessors, (1869), 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) [2023-08-30 06:24:14,032 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 267.0) internal successors, (1869), 7 states have internal predecessors, (1869), 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) [2023-08-30 06:24:14,032 INFO L175 Difference]: Start difference. First operand has 218 places, 646 transitions, 15535 flow. Second operand 6 states and 773 transitions. [2023-08-30 06:24:14,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 831 transitions, 20521 flow [2023-08-30 06:24:22,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 831 transitions, 19980 flow, removed 96 selfloop flow, removed 7 redundant places. [2023-08-30 06:24:22,490 INFO L231 Difference]: Finished difference. Result has 217 places, 640 transitions, 15347 flow [2023-08-30 06:24:22,491 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=15050, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=646, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=190, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=456, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=15347, PETRI_PLACES=217, PETRI_TRANSITIONS=640} [2023-08-30 06:24:22,491 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 162 predicate places. [2023-08-30 06:24:22,491 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 640 transitions, 15347 flow [2023-08-30 06:24:22,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 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) [2023-08-30 06:24:22,491 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 06:24:22,491 INFO L208 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] [2023-08-30 06:24:22,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2023-08-30 06:24:22,492 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-30 06:24:22,492 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 06:24:22,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1838366115, now seen corresponding path program 8 times [2023-08-30 06:24:22,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 06:24:22,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509359340] [2023-08-30 06:24:22,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 06:24:22,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 06:24:22,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 06:24:22,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 06:24:22,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 06:24:22,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509359340] [2023-08-30 06:24:22,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509359340] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 06:24:22,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419763651] [2023-08-30 06:24:22,543 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 06:24:22,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 06:24:22,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 06:24:22,545 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 06:24:22,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-08-30 06:24:22,690 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 06:24:22,691 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 06:24:22,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-30 06:24:22,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 06:24:22,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 06:24:22,733 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 06:24:22,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 06:24:22,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1419763651] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 06:24:22,760 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 06:24:22,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-08-30 06:24:22,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446895967] [2023-08-30 06:24:22,761 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 06:24:22,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-30 06:24:22,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 06:24:22,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-30 06:24:22,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-08-30 06:24:22,800 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 267 [2023-08-30 06:24:22,800 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 640 transitions, 15347 flow. Second operand has 10 states, 10 states have (on average 115.5) internal successors, (1155), 10 states have internal predecessors, (1155), 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) [2023-08-30 06:24:22,801 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 06:24:22,801 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 267 [2023-08-30 06:24:22,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 06:24:33,281 INFO L130 PetriNetUnfolder]: 33169/47217 cut-off events. [2023-08-30 06:24:33,282 INFO L131 PetriNetUnfolder]: For 1290611/1293488 co-relation queries the response was YES. [2023-08-30 06:24:34,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 392965 conditions, 47217 events. 33169/47217 cut-off events. For 1290611/1293488 co-relation queries the response was YES. Maximal size of possible extension queue 2490. Compared 315649 event pairs, 4130 based on Foata normal form. 2540/49047 useless extension candidates. Maximal degree in co-relation 392873. Up to 22065 conditions per place. [2023-08-30 06:24:34,323 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 602 selfloop transitions, 250 changer transitions 113/1010 dead transitions. [2023-08-30 06:24:34,324 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 1010 transitions, 24591 flow [2023-08-30 06:24:34,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 06:24:34,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 06:24:34,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1019 transitions. [2023-08-30 06:24:34,325 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.477059925093633 [2023-08-30 06:24:34,325 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1019 transitions. [2023-08-30 06:24:34,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1019 transitions. [2023-08-30 06:24:34,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 06:24:34,325 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1019 transitions. [2023-08-30 06:24:34,326 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 127.375) internal successors, (1019), 8 states have internal predecessors, (1019), 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) [2023-08-30 06:24:34,327 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 267.0) internal successors, (2403), 9 states have internal predecessors, (2403), 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) [2023-08-30 06:24:34,327 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 267.0) internal successors, (2403), 9 states have internal predecessors, (2403), 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) [2023-08-30 06:24:34,327 INFO L175 Difference]: Start difference. First operand has 217 places, 640 transitions, 15347 flow. Second operand 8 states and 1019 transitions. [2023-08-30 06:24:34,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 1010 transitions, 24591 flow [2023-08-30 06:24:42,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 1010 transitions, 23855 flow, removed 85 selfloop flow, removed 7 redundant places. [2023-08-30 06:24:42,541 INFO L231 Difference]: Finished difference. Result has 218 places, 675 transitions, 16245 flow [2023-08-30 06:24:42,541 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=14670, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=640, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=206, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=411, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=16245, PETRI_PLACES=218, PETRI_TRANSITIONS=675} [2023-08-30 06:24:42,541 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 163 predicate places. [2023-08-30 06:24:42,542 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 675 transitions, 16245 flow [2023-08-30 06:24:42,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 115.5) internal successors, (1155), 10 states have internal predecessors, (1155), 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) [2023-08-30 06:24:42,542 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 06:24:42,542 INFO L208 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] [2023-08-30 06:24:42,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-08-30 06:24:42,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2023-08-30 06:24:42,743 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-30 06:24:42,743 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 06:24:42,743 INFO L85 PathProgramCache]: Analyzing trace with hash 610739002, now seen corresponding path program 7 times [2023-08-30 06:24:42,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 06:24:42,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20598239] [2023-08-30 06:24:42,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 06:24:42,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 06:24:42,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 06:24:42,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 06:24:42,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 06:24:42,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20598239] [2023-08-30 06:24:42,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20598239] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 06:24:42,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 06:24:42,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 06:24:42,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428253775] [2023-08-30 06:24:42,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 06:24:42,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 06:24:42,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 06:24:42,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 06:24:42,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 06:24:42,830 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 267 [2023-08-30 06:24:42,831 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 675 transitions, 16245 flow. Second operand has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 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) [2023-08-30 06:24:42,831 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 06:24:42,831 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 267 [2023-08-30 06:24:42,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 06:24:51,945 INFO L130 PetriNetUnfolder]: 29985/41321 cut-off events. [2023-08-30 06:24:51,945 INFO L131 PetriNetUnfolder]: For 1173263/1178687 co-relation queries the response was YES. [2023-08-30 06:24:52,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 356087 conditions, 41321 events. 29985/41321 cut-off events. For 1173263/1178687 co-relation queries the response was YES. Maximal size of possible extension queue 2249. Compared 254754 event pairs, 7920 based on Foata normal form. 3494/43748 useless extension candidates. Maximal degree in co-relation 355995. Up to 27710 conditions per place. [2023-08-30 06:24:52,890 INFO L137 encePairwiseOnDemand]: 261/267 looper letters, 510 selfloop transitions, 166 changer transitions 85/809 dead transitions. [2023-08-30 06:24:52,890 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 809 transitions, 20086 flow [2023-08-30 06:24:52,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 06:24:52,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 06:24:52,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 648 transitions. [2023-08-30 06:24:52,892 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4853932584269663 [2023-08-30 06:24:52,892 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 648 transitions. [2023-08-30 06:24:52,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 648 transitions. [2023-08-30 06:24:52,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 06:24:52,892 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 648 transitions. [2023-08-30 06:24:52,892 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.6) internal successors, (648), 5 states have internal predecessors, (648), 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) [2023-08-30 06:24:52,893 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 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) [2023-08-30 06:24:52,893 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 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) [2023-08-30 06:24:52,894 INFO L175 Difference]: Start difference. First operand has 218 places, 675 transitions, 16245 flow. Second operand 5 states and 648 transitions. [2023-08-30 06:24:52,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 809 transitions, 20086 flow [2023-08-30 06:24:59,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 809 transitions, 19257 flow, removed 180 selfloop flow, removed 8 redundant places. [2023-08-30 06:24:59,215 INFO L231 Difference]: Finished difference. Result has 213 places, 652 transitions, 15289 flow [2023-08-30 06:24:59,215 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=15418, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=674, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=164, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=508, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=15289, PETRI_PLACES=213, PETRI_TRANSITIONS=652} [2023-08-30 06:24:59,215 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 158 predicate places. [2023-08-30 06:24:59,215 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 652 transitions, 15289 flow [2023-08-30 06:24:59,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 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) [2023-08-30 06:24:59,216 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 06:24:59,216 INFO L208 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] [2023-08-30 06:24:59,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2023-08-30 06:24:59,216 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-30 06:24:59,216 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 06:24:59,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1884746823, now seen corresponding path program 9 times [2023-08-30 06:24:59,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 06:24:59,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865365680] [2023-08-30 06:24:59,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 06:24:59,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 06:24:59,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 06:24:59,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 06:24:59,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 06:24:59,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865365680] [2023-08-30 06:24:59,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865365680] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 06:24:59,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604297035] [2023-08-30 06:24:59,267 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 06:24:59,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 06:24:59,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 06:24:59,269 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 06:24:59,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-08-30 06:24:59,404 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-30 06:24:59,404 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 06:24:59,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-30 06:24:59,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 06:24:59,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 06:24:59,437 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 06:24:59,460 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 06:24:59,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1604297035] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 06:24:59,460 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 06:24:59,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-08-30 06:24:59,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999353087] [2023-08-30 06:24:59,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 06:24:59,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-30 06:24:59,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 06:24:59,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-30 06:24:59,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-08-30 06:24:59,520 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 267 [2023-08-30 06:24:59,521 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 652 transitions, 15289 flow. Second operand has 10 states, 10 states have (on average 115.5) internal successors, (1155), 10 states have internal predecessors, (1155), 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) [2023-08-30 06:24:59,521 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 06:24:59,521 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 267 [2023-08-30 06:24:59,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 06:25:06,989 INFO L130 PetriNetUnfolder]: 27154/36707 cut-off events. [2023-08-30 06:25:06,989 INFO L131 PetriNetUnfolder]: For 984772/988951 co-relation queries the response was YES. [2023-08-30 06:25:07,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 314052 conditions, 36707 events. 27154/36707 cut-off events. For 984772/988951 co-relation queries the response was YES. Maximal size of possible extension queue 1811. Compared 210951 event pairs, 6363 based on Foata normal form. 2904/38976 useless extension candidates. Maximal degree in co-relation 313962. Up to 22230 conditions per place. [2023-08-30 06:25:07,865 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 464 selfloop transitions, 214 changer transitions 46/764 dead transitions. [2023-08-30 06:25:07,865 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 764 transitions, 18795 flow [2023-08-30 06:25:07,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 06:25:07,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 06:25:07,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 627 transitions. [2023-08-30 06:25:07,867 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4696629213483146 [2023-08-30 06:25:07,867 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 627 transitions. [2023-08-30 06:25:07,867 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 627 transitions. [2023-08-30 06:25:07,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 06:25:07,867 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 627 transitions. [2023-08-30 06:25:07,868 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 125.4) internal successors, (627), 5 states have internal predecessors, (627), 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) [2023-08-30 06:25:07,868 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 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) [2023-08-30 06:25:07,869 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 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) [2023-08-30 06:25:07,869 INFO L175 Difference]: Start difference. First operand has 213 places, 652 transitions, 15289 flow. Second operand 5 states and 627 transitions. [2023-08-30 06:25:07,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 764 transitions, 18795 flow [2023-08-30 06:25:13,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 764 transitions, 18151 flow, removed 154 selfloop flow, removed 5 redundant places. [2023-08-30 06:25:13,261 INFO L231 Difference]: Finished difference. Result has 205 places, 636 transitions, 14768 flow [2023-08-30 06:25:13,261 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=14647, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=650, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=199, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=451, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=14768, PETRI_PLACES=205, PETRI_TRANSITIONS=636} [2023-08-30 06:25:13,262 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 150 predicate places. [2023-08-30 06:25:13,262 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 636 transitions, 14768 flow [2023-08-30 06:25:13,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 115.5) internal successors, (1155), 10 states have internal predecessors, (1155), 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) [2023-08-30 06:25:13,262 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 06:25:13,262 INFO L208 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] [2023-08-30 06:25:13,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-08-30 06:25:13,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2023-08-30 06:25:13,463 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-30 06:25:13,463 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 06:25:13,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1942890753, now seen corresponding path program 1 times [2023-08-30 06:25:13,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 06:25:13,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672165441] [2023-08-30 06:25:13,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 06:25:13,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 06:25:13,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 06:25:13,512 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 06:25:13,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 06:25:13,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672165441] [2023-08-30 06:25:13,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672165441] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 06:25:13,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 06:25:13,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 06:25:13,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147177410] [2023-08-30 06:25:13,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 06:25:13,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 06:25:13,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 06:25:13,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 06:25:13,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 06:25:13,533 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 267 [2023-08-30 06:25:13,534 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 636 transitions, 14768 flow. Second operand has 5 states, 5 states have (on average 119.0) internal successors, (595), 5 states have internal predecessors, (595), 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) [2023-08-30 06:25:13,534 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 06:25:13,534 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 267 [2023-08-30 06:25:13,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 06:25:20,408 INFO L130 PetriNetUnfolder]: 26246/34565 cut-off events. [2023-08-30 06:25:20,409 INFO L131 PetriNetUnfolder]: For 820298/823456 co-relation queries the response was YES. [2023-08-30 06:25:21,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 301455 conditions, 34565 events. 26246/34565 cut-off events. For 820298/823456 co-relation queries the response was YES. Maximal size of possible extension queue 1607. Compared 183788 event pairs, 2422 based on Foata normal form. 1677/35636 useless extension candidates. Maximal degree in co-relation 301367. Up to 20444 conditions per place. [2023-08-30 06:25:21,496 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 513 selfloop transitions, 211 changer transitions 8/772 dead transitions. [2023-08-30 06:25:21,497 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 772 transitions, 18554 flow [2023-08-30 06:25:21,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 06:25:21,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 06:25:21,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 637 transitions. [2023-08-30 06:25:21,498 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4771535580524345 [2023-08-30 06:25:21,498 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 637 transitions. [2023-08-30 06:25:21,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 637 transitions. [2023-08-30 06:25:21,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 06:25:21,499 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 637 transitions. [2023-08-30 06:25:21,500 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 127.4) internal successors, (637), 5 states have internal predecessors, (637), 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) [2023-08-30 06:25:21,501 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 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) [2023-08-30 06:25:21,501 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 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) [2023-08-30 06:25:21,501 INFO L175 Difference]: Start difference. First operand has 205 places, 636 transitions, 14768 flow. Second operand 5 states and 637 transitions. [2023-08-30 06:25:21,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 772 transitions, 18554 flow [2023-08-30 06:25:26,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 772 transitions, 17258 flow, removed 197 selfloop flow, removed 21 redundant places. [2023-08-30 06:25:26,595 INFO L231 Difference]: Finished difference. Result has 178 places, 673 transitions, 15036 flow [2023-08-30 06:25:26,595 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=13524, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=636, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=174, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=425, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=15036, PETRI_PLACES=178, PETRI_TRANSITIONS=673} [2023-08-30 06:25:26,595 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 123 predicate places. [2023-08-30 06:25:26,595 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 673 transitions, 15036 flow [2023-08-30 06:25:26,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 119.0) internal successors, (595), 5 states have internal predecessors, (595), 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) [2023-08-30 06:25:26,596 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 06:25:26,596 INFO L208 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] [2023-08-30 06:25:26,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2023-08-30 06:25:26,596 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-30 06:25:26,596 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 06:25:26,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1923507149, now seen corresponding path program 2 times [2023-08-30 06:25:26,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 06:25:26,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538348461] [2023-08-30 06:25:26,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 06:25:26,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 06:25:26,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 06:25:26,646 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 06:25:26,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 06:25:26,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538348461] [2023-08-30 06:25:26,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538348461] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 06:25:26,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155718736] [2023-08-30 06:25:26,647 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 06:25:26,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 06:25:26,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 06:25:26,653 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 06:25:26,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-08-30 06:25:26,791 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 06:25:26,791 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 06:25:26,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-30 06:25:26,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 06:25:26,832 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 06:25:26,832 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 06:25:26,860 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 06:25:26,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1155718736] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 06:25:26,860 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 06:25:26,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-08-30 06:25:26,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807828190] [2023-08-30 06:25:26,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 06:25:26,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-30 06:25:26,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 06:25:26,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-30 06:25:26,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-08-30 06:25:26,909 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 267 [2023-08-30 06:25:26,910 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 673 transitions, 15036 flow. Second operand has 10 states, 10 states have (on average 116.1) internal successors, (1161), 10 states have internal predecessors, (1161), 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) [2023-08-30 06:25:26,910 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 06:25:26,910 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 267 [2023-08-30 06:25:26,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 06:25:34,289 INFO L130 PetriNetUnfolder]: 31512/41502 cut-off events. [2023-08-30 06:25:34,289 INFO L131 PetriNetUnfolder]: For 911585/914118 co-relation queries the response was YES. [2023-08-30 06:25:34,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 348096 conditions, 41502 events. 31512/41502 cut-off events. For 911585/914118 co-relation queries the response was YES. Maximal size of possible extension queue 1913. Compared 225847 event pairs, 2722 based on Foata normal form. 1644/42223 useless extension candidates. Maximal degree in co-relation 348023. Up to 24492 conditions per place. [2023-08-30 06:25:35,361 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 534 selfloop transitions, 367 changer transitions 12/944 dead transitions. [2023-08-30 06:25:35,362 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 944 transitions, 21889 flow [2023-08-30 06:25:35,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 06:25:35,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 06:25:35,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1000 transitions. [2023-08-30 06:25:35,363 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4681647940074906 [2023-08-30 06:25:35,363 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1000 transitions. [2023-08-30 06:25:35,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1000 transitions. [2023-08-30 06:25:35,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 06:25:35,364 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1000 transitions. [2023-08-30 06:25:35,365 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 125.0) internal successors, (1000), 8 states have internal predecessors, (1000), 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) [2023-08-30 06:25:35,366 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 267.0) internal successors, (2403), 9 states have internal predecessors, (2403), 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) [2023-08-30 06:25:35,367 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 267.0) internal successors, (2403), 9 states have internal predecessors, (2403), 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) [2023-08-30 06:25:35,367 INFO L175 Difference]: Start difference. First operand has 178 places, 673 transitions, 15036 flow. Second operand 8 states and 1000 transitions. [2023-08-30 06:25:35,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 944 transitions, 21889 flow [2023-08-30 06:25:41,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 944 transitions, 21645 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-30 06:25:41,094 INFO L231 Difference]: Finished difference. Result has 185 places, 745 transitions, 17457 flow [2023-08-30 06:25:41,094 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=14836, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=673, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=295, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=341, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=17457, PETRI_PLACES=185, PETRI_TRANSITIONS=745} [2023-08-30 06:25:41,095 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 130 predicate places. [2023-08-30 06:25:41,095 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 745 transitions, 17457 flow [2023-08-30 06:25:41,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 116.1) internal successors, (1161), 10 states have internal predecessors, (1161), 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) [2023-08-30 06:25:41,096 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 06:25:41,096 INFO L208 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] [2023-08-30 06:25:41,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-08-30 06:25:41,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 06:25:41,301 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-30 06:25:41,301 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 06:25:41,301 INFO L85 PathProgramCache]: Analyzing trace with hash -898022775, now seen corresponding path program 3 times [2023-08-30 06:25:41,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 06:25:41,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188925918] [2023-08-30 06:25:41,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 06:25:41,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 06:25:41,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 06:25:41,352 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 06:25:41,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 06:25:41,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188925918] [2023-08-30 06:25:41,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188925918] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 06:25:41,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412617006] [2023-08-30 06:25:41,353 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 06:25:41,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 06:25:41,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 06:25:41,354 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 06:25:41,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-08-30 06:25:41,523 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-30 06:25:41,524 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 06:25:41,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-30 06:25:41,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 06:25:41,571 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 06:25:41,571 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 06:25:41,596 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 06:25:41,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1412617006] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 06:25:41,597 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 06:25:41,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-08-30 06:25:41,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250010989] [2023-08-30 06:25:41,597 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 06:25:41,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-30 06:25:41,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 06:25:41,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-30 06:25:41,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-08-30 06:25:41,649 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 267 [2023-08-30 06:25:41,650 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 745 transitions, 17457 flow. Second operand has 10 states, 10 states have (on average 116.0) internal successors, (1160), 10 states have internal predecessors, (1160), 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) [2023-08-30 06:25:41,650 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 06:25:41,650 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 267 [2023-08-30 06:25:41,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 06:25:50,135 INFO L130 PetriNetUnfolder]: 34188/44924 cut-off events. [2023-08-30 06:25:50,135 INFO L131 PetriNetUnfolder]: For 1062301/1066242 co-relation queries the response was YES. [2023-08-30 06:25:50,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 389296 conditions, 44924 events. 34188/44924 cut-off events. For 1062301/1066242 co-relation queries the response was YES. Maximal size of possible extension queue 1999. Compared 246490 event pairs, 2948 based on Foata normal form. 2439/46790 useless extension candidates. Maximal degree in co-relation 389221. Up to 26495 conditions per place. [2023-08-30 06:25:50,951 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 575 selfloop transitions, 364 changer transitions 15/993 dead transitions. [2023-08-30 06:25:50,952 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 993 transitions, 24105 flow [2023-08-30 06:25:50,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 06:25:50,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 06:25:50,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 992 transitions. [2023-08-30 06:25:50,953 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46441947565543074 [2023-08-30 06:25:50,953 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 992 transitions. [2023-08-30 06:25:50,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 992 transitions. [2023-08-30 06:25:50,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 06:25:50,954 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 992 transitions. [2023-08-30 06:25:50,955 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 124.0) internal successors, (992), 8 states have internal predecessors, (992), 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) [2023-08-30 06:25:50,957 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 267.0) internal successors, (2403), 9 states have internal predecessors, (2403), 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) [2023-08-30 06:25:50,957 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 267.0) internal successors, (2403), 9 states have internal predecessors, (2403), 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) [2023-08-30 06:25:50,957 INFO L175 Difference]: Start difference. First operand has 185 places, 745 transitions, 17457 flow. Second operand 8 states and 992 transitions. [2023-08-30 06:25:50,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 993 transitions, 24105 flow [2023-08-30 06:25:58,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 993 transitions, 23071 flow, removed 98 selfloop flow, removed 5 redundant places. [2023-08-30 06:25:58,716 INFO L231 Difference]: Finished difference. Result has 189 places, 818 transitions, 19411 flow [2023-08-30 06:25:58,717 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=16657, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=745, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=285, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=423, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=19411, PETRI_PLACES=189, PETRI_TRANSITIONS=818} [2023-08-30 06:25:58,717 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 134 predicate places. [2023-08-30 06:25:58,718 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 818 transitions, 19411 flow [2023-08-30 06:25:58,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 116.0) internal successors, (1160), 10 states have internal predecessors, (1160), 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) [2023-08-30 06:25:58,718 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 06:25:58,718 INFO L208 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] [2023-08-30 06:25:58,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-08-30 06:25:58,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 06:25:58,924 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-30 06:25:58,924 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 06:25:58,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1929965688, now seen corresponding path program 1 times [2023-08-30 06:25:58,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 06:25:58,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168369235] [2023-08-30 06:25:58,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 06:25:58,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 06:25:58,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 06:25:58,975 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 06:25:58,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 06:25:58,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168369235] [2023-08-30 06:25:58,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168369235] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 06:25:58,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49043003] [2023-08-30 06:25:58,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 06:25:58,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 06:25:58,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 06:25:58,978 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 06:25:59,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-08-30 06:25:59,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 06:25:59,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-30 06:25:59,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 06:25:59,180 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 06:25:59,180 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 06:25:59,221 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 06:25:59,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49043003] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 06:25:59,221 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 06:25:59,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-08-30 06:25:59,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133561611] [2023-08-30 06:25:59,222 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 06:25:59,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-30 06:25:59,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 06:25:59,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-30 06:25:59,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-08-30 06:25:59,267 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 267 [2023-08-30 06:25:59,267 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 818 transitions, 19411 flow. Second operand has 10 states, 10 states have (on average 117.1) internal successors, (1171), 10 states have internal predecessors, (1171), 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) [2023-08-30 06:25:59,267 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 06:25:59,267 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 267 [2023-08-30 06:25:59,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 06:26:08,022 INFO L130 PetriNetUnfolder]: 33951/44117 cut-off events. [2023-08-30 06:26:08,022 INFO L131 PetriNetUnfolder]: For 1053398/1057366 co-relation queries the response was YES. [2023-08-30 06:26:08,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 394302 conditions, 44117 events. 33951/44117 cut-off events. For 1053398/1057366 co-relation queries the response was YES. Maximal size of possible extension queue 2026. Compared 235083 event pairs, 4008 based on Foata normal form. 1691/44743 useless extension candidates. Maximal degree in co-relation 394225. Up to 27296 conditions per place. [2023-08-30 06:26:08,795 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 671 selfloop transitions, 383 changer transitions 1/1100 dead transitions. [2023-08-30 06:26:08,795 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 1100 transitions, 26835 flow [2023-08-30 06:26:08,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 06:26:08,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 06:26:08,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1000 transitions. [2023-08-30 06:26:08,797 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4681647940074906 [2023-08-30 06:26:08,797 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1000 transitions. [2023-08-30 06:26:08,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1000 transitions. [2023-08-30 06:26:08,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 06:26:08,800 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1000 transitions. [2023-08-30 06:26:08,801 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 125.0) internal successors, (1000), 8 states have internal predecessors, (1000), 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) [2023-08-30 06:26:08,803 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 267.0) internal successors, (2403), 9 states have internal predecessors, (2403), 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) [2023-08-30 06:26:08,803 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 267.0) internal successors, (2403), 9 states have internal predecessors, (2403), 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) [2023-08-30 06:26:08,803 INFO L175 Difference]: Start difference. First operand has 189 places, 818 transitions, 19411 flow. Second operand 8 states and 1000 transitions. [2023-08-30 06:26:08,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 1100 transitions, 26835 flow [2023-08-30 06:26:16,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 1100 transitions, 25833 flow, removed 60 selfloop flow, removed 9 redundant places. [2023-08-30 06:26:16,265 INFO L231 Difference]: Finished difference. Result has 183 places, 835 transitions, 19802 flow [2023-08-30 06:26:16,266 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=18607, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=818, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=365, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=444, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=19802, PETRI_PLACES=183, PETRI_TRANSITIONS=835} [2023-08-30 06:26:16,266 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 128 predicate places. [2023-08-30 06:26:16,266 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 835 transitions, 19802 flow [2023-08-30 06:26:16,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 117.1) internal successors, (1171), 10 states have internal predecessors, (1171), 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) [2023-08-30 06:26:16,266 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 06:26:16,266 INFO L208 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] [2023-08-30 06:26:16,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-08-30 06:26:16,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 06:26:16,467 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-30 06:26:16,467 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 06:26:16,467 INFO L85 PathProgramCache]: Analyzing trace with hash -733342054, now seen corresponding path program 1 times [2023-08-30 06:26:16,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 06:26:16,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047717749] [2023-08-30 06:26:16,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 06:26:16,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 06:26:16,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 06:26:16,674 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 06:26:16,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 06:26:16,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047717749] [2023-08-30 06:26:16,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047717749] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 06:26:16,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1323200327] [2023-08-30 06:26:16,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 06:26:16,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 06:26:16,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 06:26:16,676 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 06:26:16,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-08-30 06:26:16,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 06:26:16,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-30 06:26:16,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 06:26:16,929 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 06:26:16,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 06:26:17,033 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 06:26:17,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1323200327] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 06:26:17,033 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 06:26:17,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 7 [2023-08-30 06:26:17,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924397567] [2023-08-30 06:26:17,034 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 06:26:17,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-30 06:26:17,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 06:26:17,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-30 06:26:17,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-08-30 06:26:17,053 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 267 [2023-08-30 06:26:17,054 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 835 transitions, 19802 flow. Second operand has 9 states, 9 states have (on average 125.66666666666667) internal successors, (1131), 9 states have internal predecessors, (1131), 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) [2023-08-30 06:26:17,054 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 06:26:17,054 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 267 [2023-08-30 06:26:17,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 06:26:33,317 INFO L130 PetriNetUnfolder]: 59469/78160 cut-off events. [2023-08-30 06:26:33,317 INFO L131 PetriNetUnfolder]: For 1850806/1868398 co-relation queries the response was YES. [2023-08-30 06:26:34,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 636722 conditions, 78160 events. 59469/78160 cut-off events. For 1850806/1868398 co-relation queries the response was YES. Maximal size of possible extension queue 3391. Compared 460392 event pairs, 5236 based on Foata normal form. 9342/85172 useless extension candidates. Maximal degree in co-relation 636648. Up to 46252 conditions per place. [2023-08-30 06:26:34,835 INFO L137 encePairwiseOnDemand]: 261/267 looper letters, 548 selfloop transitions, 662 changer transitions 5/1281 dead transitions. [2023-08-30 06:26:34,835 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 1281 transitions, 30807 flow [2023-08-30 06:26:34,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 06:26:34,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 06:26:34,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1246 transitions. [2023-08-30 06:26:34,837 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2023-08-30 06:26:34,837 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1246 transitions. [2023-08-30 06:26:34,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1246 transitions. [2023-08-30 06:26:34,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 06:26:34,837 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1246 transitions. [2023-08-30 06:26:34,838 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 138.44444444444446) internal successors, (1246), 9 states have internal predecessors, (1246), 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) [2023-08-30 06:26:34,839 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 267.0) internal successors, (2670), 10 states have internal predecessors, (2670), 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) [2023-08-30 06:26:34,840 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 267.0) internal successors, (2670), 10 states have internal predecessors, (2670), 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) [2023-08-30 06:26:34,840 INFO L175 Difference]: Start difference. First operand has 183 places, 835 transitions, 19802 flow. Second operand 9 states and 1246 transitions. [2023-08-30 06:26:34,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 1281 transitions, 30807 flow [2023-08-30 06:26:55,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 1281 transitions, 29157 flow, removed 117 selfloop flow, removed 12 redundant places. [2023-08-30 06:26:55,416 INFO L231 Difference]: Finished difference. Result has 182 places, 1171 transitions, 29350 flow [2023-08-30 06:26:55,417 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=12560, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=564, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=201, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=29350, PETRI_PLACES=182, PETRI_TRANSITIONS=1171} [2023-08-30 06:26:55,417 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 127 predicate places. [2023-08-30 06:26:55,418 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 1171 transitions, 29350 flow [2023-08-30 06:26:55,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 125.66666666666667) internal successors, (1131), 9 states have internal predecessors, (1131), 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) [2023-08-30 06:26:55,418 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 06:26:55,418 INFO L208 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] [2023-08-30 06:26:55,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-08-30 06:26:55,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 06:26:55,624 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-30 06:26:55,624 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 06:26:55,625 INFO L85 PathProgramCache]: Analyzing trace with hash -672429962, now seen corresponding path program 2 times [2023-08-30 06:26:55,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 06:26:55,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13231288] [2023-08-30 06:26:55,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 06:26:55,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 06:26:55,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 06:26:55,710 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 06:26:55,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 06:26:55,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13231288] [2023-08-30 06:26:55,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13231288] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 06:26:55,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197568508] [2023-08-30 06:26:55,710 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 06:26:55,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 06:26:55,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 06:26:55,712 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 06:26:55,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-08-30 06:26:55,836 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 06:26:55,836 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 06:26:55,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 06:26:55,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 06:26:55,909 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 06:26:55,909 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 06:26:55,950 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 06:26:55,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [197568508] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 06:26:55,950 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 06:26:55,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2023-08-30 06:26:55,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889287364] [2023-08-30 06:26:55,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 06:26:55,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-30 06:26:55,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 06:26:55,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-30 06:26:55,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-08-30 06:26:56,023 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 267 [2023-08-30 06:26:56,024 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 1171 transitions, 29350 flow. Second operand has 12 states, 12 states have (on average 115.91666666666667) internal successors, (1391), 12 states have internal predecessors, (1391), 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) [2023-08-30 06:26:56,024 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 06:26:56,024 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 267 [2023-08-30 06:26:56,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 06:27:28,202 INFO L130 PetriNetUnfolder]: 99106/132036 cut-off events. [2023-08-30 06:27:28,202 INFO L131 PetriNetUnfolder]: For 2985121/3007036 co-relation queries the response was YES. [2023-08-30 06:27:30,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1086054 conditions, 132036 events. 99106/132036 cut-off events. For 2985121/3007036 co-relation queries the response was YES. Maximal size of possible extension queue 5127. Compared 845318 event pairs, 3493 based on Foata normal form. 11900/143192 useless extension candidates. Maximal degree in co-relation 1085980. Up to 72705 conditions per place. [2023-08-30 06:27:31,083 INFO L137 encePairwiseOnDemand]: 261/267 looper letters, 2900 selfloop transitions, 1106 changer transitions 0/4039 dead transitions. [2023-08-30 06:27:31,083 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 4039 transitions, 102538 flow [2023-08-30 06:27:31,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-08-30 06:27:31,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-08-30 06:27:31,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 2527 transitions. [2023-08-30 06:27:31,086 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47322097378277156 [2023-08-30 06:27:31,086 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 2527 transitions. [2023-08-30 06:27:31,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 2527 transitions. [2023-08-30 06:27:31,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 06:27:31,087 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 2527 transitions. [2023-08-30 06:27:31,090 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 126.35) internal successors, (2527), 20 states have internal predecessors, (2527), 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) [2023-08-30 06:27:31,093 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 267.0) internal successors, (5607), 21 states have internal predecessors, (5607), 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) [2023-08-30 06:27:31,093 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 267.0) internal successors, (5607), 21 states have internal predecessors, (5607), 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) [2023-08-30 06:27:31,094 INFO L175 Difference]: Start difference. First operand has 182 places, 1171 transitions, 29350 flow. Second operand 20 states and 2527 transitions. [2023-08-30 06:27:31,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 4039 transitions, 102538 flow [2023-08-30 06:28:27,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 4039 transitions, 96042 flow, removed 3248 selfloop flow, removed 0 redundant places. [2023-08-30 06:28:27,582 INFO L231 Difference]: Finished difference. Result has 212 places, 1819 transitions, 45778 flow [2023-08-30 06:28:27,583 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=27704, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=493, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=546, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=45778, PETRI_PLACES=212, PETRI_TRANSITIONS=1819} [2023-08-30 06:28:27,583 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 157 predicate places. [2023-08-30 06:28:27,583 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 1819 transitions, 45778 flow [2023-08-30 06:28:27,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 115.91666666666667) internal successors, (1391), 12 states have internal predecessors, (1391), 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) [2023-08-30 06:28:27,583 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 06:28:27,583 INFO L208 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] [2023-08-30 06:28:27,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2023-08-30 06:28:27,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 06:28:27,784 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-30 06:28:27,784 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 06:28:27,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1231628952, now seen corresponding path program 3 times [2023-08-30 06:28:27,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 06:28:27,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036726459] [2023-08-30 06:28:27,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 06:28:27,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 06:28:27,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 06:28:27,858 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 06:28:27,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 06:28:27,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036726459] [2023-08-30 06:28:27,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036726459] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 06:28:27,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506912414] [2023-08-30 06:28:27,859 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 06:28:27,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 06:28:27,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 06:28:27,861 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 06:28:27,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-08-30 06:28:28,019 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-30 06:28:28,019 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 06:28:28,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 06:28:28,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 06:28:28,063 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 06:28:28,063 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 06:28:28,104 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 06:28:28,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [506912414] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 06:28:28,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 06:28:28,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-08-30 06:28:28,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85399433] [2023-08-30 06:28:28,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 06:28:28,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-30 06:28:28,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 06:28:28,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-30 06:28:28,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2023-08-30 06:28:28,189 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 267 [2023-08-30 06:28:28,190 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 1819 transitions, 45778 flow. Second operand has 11 states, 11 states have (on average 115.18181818181819) internal successors, (1267), 11 states have internal predecessors, (1267), 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) [2023-08-30 06:28:28,190 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 06:28:28,190 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 267 [2023-08-30 06:28:28,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand