./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/weaver/bench-exp2x4.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42b976be-4d73-4d24-bdbf-6a9117e8c02b/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42b976be-4d73-4d24-bdbf-6a9117e8c02b/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42b976be-4d73-4d24-bdbf-6a9117e8c02b/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42b976be-4d73-4d24-bdbf-6a9117e8c02b/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/weaver/bench-exp2x4.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42b976be-4d73-4d24-bdbf-6a9117e8c02b/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42b976be-4d73-4d24-bdbf-6a9117e8c02b/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --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 f64e270e7d8e8fe7bf3b7cd641a237e1a4059fd56c14ffbabdcef7751fd05704 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 00:42:20,223 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 00:42:20,291 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42b976be-4d73-4d24-bdbf-6a9117e8c02b/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 00:42:20,296 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 00:42:20,296 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 00:42:20,319 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 00:42:20,320 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 00:42:20,321 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 00:42:20,322 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 00:42:20,322 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 00:42:20,323 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 00:42:20,323 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 00:42:20,324 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 00:42:20,325 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 00:42:20,325 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 00:42:20,326 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 00:42:20,326 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 00:42:20,327 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 00:42:20,327 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 00:42:20,328 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 00:42:20,328 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 00:42:20,329 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 00:42:20,329 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 00:42:20,330 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 00:42:20,330 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 00:42:20,331 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 00:42:20,331 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 00:42:20,332 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 00:42:20,332 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 00:42:20,333 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 00:42:20,333 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 00:42:20,333 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 00:42:20,334 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:42:20,334 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 00:42:20,335 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 00:42:20,335 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 00:42:20,336 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 00:42:20,336 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 00:42:20,336 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 00:42:20,336 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 00:42:20,336 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 00:42:20,337 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42b976be-4d73-4d24-bdbf-6a9117e8c02b/bin/uautomizer-verify-BQ2R08f2Ya/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42b976be-4d73-4d24-bdbf-6a9117e8c02b/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G 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 -> f64e270e7d8e8fe7bf3b7cd641a237e1a4059fd56c14ffbabdcef7751fd05704 [2023-11-29 00:42:20,588 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 00:42:20,609 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 00:42:20,612 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 00:42:20,613 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 00:42:20,613 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 00:42:20,615 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42b976be-4d73-4d24-bdbf-6a9117e8c02b/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/weaver/bench-exp2x4.wvr.c [2023-11-29 00:42:23,463 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 00:42:23,699 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 00:42:23,700 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42b976be-4d73-4d24-bdbf-6a9117e8c02b/sv-benchmarks/c/weaver/bench-exp2x4.wvr.c [2023-11-29 00:42:23,710 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42b976be-4d73-4d24-bdbf-6a9117e8c02b/bin/uautomizer-verify-BQ2R08f2Ya/data/016b00888/d9478900a3f34fa38fe78e14f6c98bdb/FLAGe5dc51015 [2023-11-29 00:42:23,727 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42b976be-4d73-4d24-bdbf-6a9117e8c02b/bin/uautomizer-verify-BQ2R08f2Ya/data/016b00888/d9478900a3f34fa38fe78e14f6c98bdb [2023-11-29 00:42:23,730 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 00:42:23,732 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 00:42:23,733 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 00:42:23,734 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 00:42:23,744 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 00:42:23,744 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:42:23" (1/1) ... [2023-11-29 00:42:23,745 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17f149 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:42:23, skipping insertion in model container [2023-11-29 00:42:23,746 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:42:23" (1/1) ... [2023-11-29 00:42:23,772 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:42:23,941 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:42:23,952 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 00:42:23,976 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:42:23,990 INFO L206 MainTranslator]: Completed translation [2023-11-29 00:42:23,990 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:42:23 WrapperNode [2023-11-29 00:42:23,990 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 00:42:23,992 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 00:42:23,992 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 00:42:23,992 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 00:42:23,999 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:42:23" (1/1) ... [2023-11-29 00:42:24,007 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:42:23" (1/1) ... [2023-11-29 00:42:24,031 INFO L138 Inliner]: procedures = 20, calls = 33, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 97 [2023-11-29 00:42:24,031 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 00:42:24,032 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 00:42:24,032 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 00:42:24,033 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 00:42:24,043 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:42:23" (1/1) ... [2023-11-29 00:42:24,044 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:42:23" (1/1) ... [2023-11-29 00:42:24,047 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:42:23" (1/1) ... [2023-11-29 00:42:24,066 INFO L175 MemorySlicer]: Split 10 memory accesses to 5 slices as follows [2, 2, 2, 2, 2]. 20 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2023-11-29 00:42:24,066 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:42:23" (1/1) ... [2023-11-29 00:42:24,066 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:42:23" (1/1) ... [2023-11-29 00:42:24,075 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:42:23" (1/1) ... [2023-11-29 00:42:24,079 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:42:23" (1/1) ... [2023-11-29 00:42:24,082 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:42:23" (1/1) ... [2023-11-29 00:42:24,084 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:42:23" (1/1) ... [2023-11-29 00:42:24,088 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 00:42:24,089 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 00:42:24,089 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 00:42:24,089 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 00:42:24,090 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:42:23" (1/1) ... [2023-11-29 00:42:24,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:42:24,107 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42b976be-4d73-4d24-bdbf-6a9117e8c02b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:42:24,120 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42b976be-4d73-4d24-bdbf-6a9117e8c02b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 00:42:24,128 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42b976be-4d73-4d24-bdbf-6a9117e8c02b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 00:42:24,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 00:42:24,159 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-29 00:42:24,159 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-29 00:42:24,159 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-29 00:42:24,159 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-29 00:42:24,159 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-29 00:42:24,160 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-29 00:42:24,160 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-11-29 00:42:24,160 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-11-29 00:42:24,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 00:42:24,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 00:42:24,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 00:42:24,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 00:42:24,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-29 00:42:24,161 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 00:42:24,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 00:42:24,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 00:42:24,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 00:42:24,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 00:42:24,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-29 00:42:24,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 00:42:24,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 00:42:24,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 00:42:24,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 00:42:24,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 00:42:24,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-29 00:42:24,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-11-29 00:42:24,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 00:42:24,165 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 00:42:24,308 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 00:42:24,311 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 00:42:24,622 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 00:42:24,790 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 00:42:24,801 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-29 00:42:24,802 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:42:24 BoogieIcfgContainer [2023-11-29 00:42:24,802 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 00:42:24,804 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 00:42:24,804 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 00:42:24,807 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 00:42:24,807 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 12:42:23" (1/3) ... [2023-11-29 00:42:24,808 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a9ef749 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:42:24, skipping insertion in model container [2023-11-29 00:42:24,808 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:42:23" (2/3) ... [2023-11-29 00:42:24,808 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a9ef749 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:42:24, skipping insertion in model container [2023-11-29 00:42:24,809 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:42:24" (3/3) ... [2023-11-29 00:42:24,810 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp2x4.wvr.c [2023-11-29 00:42:24,837 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 00:42:24,837 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2023-11-29 00:42:24,837 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 00:42:24,902 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-11-29 00:42:24,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 61 transitions, 150 flow [2023-11-29 00:42:24,975 INFO L124 PetriNetUnfolderBase]: 4/57 cut-off events. [2023-11-29 00:42:24,975 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-29 00:42:24,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 57 events. 4/57 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 73 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2023-11-29 00:42:24,979 INFO L82 GeneralOperation]: Start removeDead. Operand has 70 places, 61 transitions, 150 flow [2023-11-29 00:42:24,984 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 65 places, 56 transitions, 136 flow [2023-11-29 00:42:24,995 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:42:25,002 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;@fc5f6b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:42:25,002 INFO L358 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2023-11-29 00:42:25,006 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 00:42:25,007 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-29 00:42:25,007 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 00:42:25,007 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:42:25,008 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 00:42:25,008 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-11-29 00:42:25,014 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:42:25,014 INFO L85 PathProgramCache]: Analyzing trace with hash 11075, now seen corresponding path program 1 times [2023-11-29 00:42:25,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:42:25,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869781133] [2023-11-29 00:42:25,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:42:25,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:42:25,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:25,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:42:25,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:42:25,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869781133] [2023-11-29 00:42:25,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869781133] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:42:25,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:42:25,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 00:42:25,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138106504] [2023-11-29 00:42:25,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:42:25,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:42:25,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:42:25,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:42:25,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:42:25,529 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 61 [2023-11-29 00:42:25,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 56 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:25,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:42:25,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 61 [2023-11-29 00:42:25,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:42:25,917 INFO L124 PetriNetUnfolderBase]: 1488/2142 cut-off events. [2023-11-29 00:42:25,918 INFO L125 PetriNetUnfolderBase]: For 105/105 co-relation queries the response was YES. [2023-11-29 00:42:25,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4093 conditions, 2142 events. 1488/2142 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 8751 event pairs, 691 based on Foata normal form. 1/1226 useless extension candidates. Maximal degree in co-relation 3527. Up to 1825 conditions per place. [2023-11-29 00:42:25,949 INFO L140 encePairwiseOnDemand]: 57/61 looper letters, 23 selfloop transitions, 1 changer transitions 0/52 dead transitions. [2023-11-29 00:42:25,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 52 transitions, 176 flow [2023-11-29 00:42:25,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:42:25,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:42:25,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2023-11-29 00:42:25,964 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6885245901639344 [2023-11-29 00:42:25,965 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 126 transitions. [2023-11-29 00:42:25,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 126 transitions. [2023-11-29 00:42:25,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:42:25,969 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 126 transitions. [2023-11-29 00:42:25,972 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:25,976 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:25,976 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:25,978 INFO L175 Difference]: Start difference. First operand has 65 places, 56 transitions, 136 flow. Second operand 3 states and 126 transitions. [2023-11-29 00:42:25,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 52 transitions, 176 flow [2023-11-29 00:42:25,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 52 transitions, 160 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-11-29 00:42:25,991 INFO L231 Difference]: Finished difference. Result has 55 places, 52 transitions, 114 flow [2023-11-29 00:42:25,993 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=55, PETRI_TRANSITIONS=52} [2023-11-29 00:42:25,997 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, -10 predicate places. [2023-11-29 00:42:25,998 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 52 transitions, 114 flow [2023-11-29 00:42:25,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:25,998 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:42:25,998 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 00:42:25,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 00:42:25,999 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-11-29 00:42:26,000 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:42:26,000 INFO L85 PathProgramCache]: Analyzing trace with hash 11076, now seen corresponding path program 1 times [2023-11-29 00:42:26,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:42:26,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868899444] [2023-11-29 00:42:26,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:42:26,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:42:26,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:26,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:42:26,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:42:26,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868899444] [2023-11-29 00:42:26,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868899444] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:42:26,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:42:26,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 00:42:26,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016547316] [2023-11-29 00:42:26,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:42:26,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:42:26,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:42:26,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:42:26,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:42:26,230 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 61 [2023-11-29 00:42:26,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 52 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:26,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:42:26,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 61 [2023-11-29 00:42:26,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:42:26,440 INFO L124 PetriNetUnfolderBase]: 1056/1576 cut-off events. [2023-11-29 00:42:26,441 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2023-11-29 00:42:26,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2931 conditions, 1576 events. 1056/1576 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 6365 event pairs, 475 based on Foata normal form. 82/979 useless extension candidates. Maximal degree in co-relation 2925. Up to 1311 conditions per place. [2023-11-29 00:42:26,456 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 21 selfloop transitions, 1 changer transitions 0/50 dead transitions. [2023-11-29 00:42:26,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 50 transitions, 154 flow [2023-11-29 00:42:26,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:42:26,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:42:26,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 129 transitions. [2023-11-29 00:42:26,458 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7049180327868853 [2023-11-29 00:42:26,458 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 129 transitions. [2023-11-29 00:42:26,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 129 transitions. [2023-11-29 00:42:26,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:42:26,459 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 129 transitions. [2023-11-29 00:42:26,460 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:26,462 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:26,462 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:26,462 INFO L175 Difference]: Start difference. First operand has 55 places, 52 transitions, 114 flow. Second operand 3 states and 129 transitions. [2023-11-29 00:42:26,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 50 transitions, 154 flow [2023-11-29 00:42:26,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 50 transitions, 153 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 00:42:26,464 INFO L231 Difference]: Finished difference. Result has 54 places, 50 transitions, 111 flow [2023-11-29 00:42:26,465 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=111, PETRI_PLACES=54, PETRI_TRANSITIONS=50} [2023-11-29 00:42:26,465 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, -11 predicate places. [2023-11-29 00:42:26,466 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 50 transitions, 111 flow [2023-11-29 00:42:26,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:26,466 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:42:26,466 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 00:42:26,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 00:42:26,467 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-11-29 00:42:26,467 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:42:26,467 INFO L85 PathProgramCache]: Analyzing trace with hash 330267262, now seen corresponding path program 1 times [2023-11-29 00:42:26,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:42:26,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692752310] [2023-11-29 00:42:26,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:42:26,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:42:26,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:26,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:42:26,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:42:26,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692752310] [2023-11-29 00:42:26,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692752310] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:42:26,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:42:26,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 00:42:26,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775867300] [2023-11-29 00:42:26,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:42:26,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:42:26,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:42:26,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:42:26,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:42:26,590 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 61 [2023-11-29 00:42:26,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 50 transitions, 111 flow. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:26,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:42:26,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 61 [2023-11-29 00:42:26,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:42:26,792 INFO L124 PetriNetUnfolderBase]: 1164/1690 cut-off events. [2023-11-29 00:42:26,792 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2023-11-29 00:42:26,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3183 conditions, 1690 events. 1164/1690 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 6586 event pairs, 530 based on Foata normal form. 0/992 useless extension candidates. Maximal degree in co-relation 3176. Up to 1448 conditions per place. [2023-11-29 00:42:26,807 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 23 selfloop transitions, 1 changer transitions 0/48 dead transitions. [2023-11-29 00:42:26,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 48 transitions, 155 flow [2023-11-29 00:42:26,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:42:26,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:42:26,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 125 transitions. [2023-11-29 00:42:26,809 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6830601092896175 [2023-11-29 00:42:26,809 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 125 transitions. [2023-11-29 00:42:26,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 125 transitions. [2023-11-29 00:42:26,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:42:26,810 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 125 transitions. [2023-11-29 00:42:26,811 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:26,812 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:26,812 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:26,812 INFO L175 Difference]: Start difference. First operand has 54 places, 50 transitions, 111 flow. Second operand 3 states and 125 transitions. [2023-11-29 00:42:26,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 48 transitions, 155 flow [2023-11-29 00:42:26,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 48 transitions, 154 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 00:42:26,815 INFO L231 Difference]: Finished difference. Result has 53 places, 48 transitions, 108 flow [2023-11-29 00:42:26,815 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=53, PETRI_TRANSITIONS=48} [2023-11-29 00:42:26,816 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, -12 predicate places. [2023-11-29 00:42:26,816 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 48 transitions, 108 flow [2023-11-29 00:42:26,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:26,817 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:42:26,817 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 00:42:26,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 00:42:26,817 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-11-29 00:42:26,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:42:26,818 INFO L85 PathProgramCache]: Analyzing trace with hash 330267263, now seen corresponding path program 1 times [2023-11-29 00:42:26,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:42:26,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034794317] [2023-11-29 00:42:26,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:42:26,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:42:26,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:26,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:42:26,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:42:26,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034794317] [2023-11-29 00:42:26,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034794317] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:42:26,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:42:26,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 00:42:26,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855261951] [2023-11-29 00:42:26,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:42:26,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:42:26,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:42:26,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:42:26,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:42:27,006 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 61 [2023-11-29 00:42:27,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 48 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:27,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:42:27,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 61 [2023-11-29 00:42:27,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:42:27,201 INFO L124 PetriNetUnfolderBase]: 1056/1536 cut-off events. [2023-11-29 00:42:27,201 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2023-11-29 00:42:27,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2893 conditions, 1536 events. 1056/1536 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 5993 event pairs, 475 based on Foata normal form. 30/927 useless extension candidates. Maximal degree in co-relation 2885. Up to 1311 conditions per place. [2023-11-29 00:42:27,216 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 21 selfloop transitions, 1 changer transitions 0/46 dead transitions. [2023-11-29 00:42:27,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 46 transitions, 148 flow [2023-11-29 00:42:27,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:42:27,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:42:27,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 129 transitions. [2023-11-29 00:42:27,218 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7049180327868853 [2023-11-29 00:42:27,218 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 129 transitions. [2023-11-29 00:42:27,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 129 transitions. [2023-11-29 00:42:27,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:42:27,219 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 129 transitions. [2023-11-29 00:42:27,220 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:27,221 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:27,221 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:27,221 INFO L175 Difference]: Start difference. First operand has 53 places, 48 transitions, 108 flow. Second operand 3 states and 129 transitions. [2023-11-29 00:42:27,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 46 transitions, 148 flow [2023-11-29 00:42:27,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 46 transitions, 147 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 00:42:27,224 INFO L231 Difference]: Finished difference. Result has 52 places, 46 transitions, 105 flow [2023-11-29 00:42:27,224 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=105, PETRI_PLACES=52, PETRI_TRANSITIONS=46} [2023-11-29 00:42:27,225 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, -13 predicate places. [2023-11-29 00:42:27,226 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 46 transitions, 105 flow [2023-11-29 00:42:27,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:27,226 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:42:27,226 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:42:27,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 00:42:27,227 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-11-29 00:42:27,227 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:42:27,227 INFO L85 PathProgramCache]: Analyzing trace with hash -777736923, now seen corresponding path program 1 times [2023-11-29 00:42:27,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:42:27,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581291152] [2023-11-29 00:42:27,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:42:27,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:42:27,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:27,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:42:27,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:42:27,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581291152] [2023-11-29 00:42:27,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581291152] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:42:27,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:42:27,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 00:42:27,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527829755] [2023-11-29 00:42:27,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:42:27,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:42:27,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:42:27,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:42:27,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:42:27,401 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 61 [2023-11-29 00:42:27,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 46 transitions, 105 flow. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:27,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:42:27,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 61 [2023-11-29 00:42:27,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:42:27,581 INFO L124 PetriNetUnfolderBase]: 1056/1524 cut-off events. [2023-11-29 00:42:27,581 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2023-11-29 00:42:27,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2882 conditions, 1524 events. 1056/1524 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 5906 event pairs, 475 based on Foata normal form. 18/915 useless extension candidates. Maximal degree in co-relation 2873. Up to 1311 conditions per place. [2023-11-29 00:42:27,595 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 21 selfloop transitions, 1 changer transitions 0/44 dead transitions. [2023-11-29 00:42:27,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 44 transitions, 145 flow [2023-11-29 00:42:27,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:42:27,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:42:27,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 129 transitions. [2023-11-29 00:42:27,597 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7049180327868853 [2023-11-29 00:42:27,597 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 129 transitions. [2023-11-29 00:42:27,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 129 transitions. [2023-11-29 00:42:27,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:42:27,598 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 129 transitions. [2023-11-29 00:42:27,599 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:27,600 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:27,601 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:27,601 INFO L175 Difference]: Start difference. First operand has 52 places, 46 transitions, 105 flow. Second operand 3 states and 129 transitions. [2023-11-29 00:42:27,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 44 transitions, 145 flow [2023-11-29 00:42:27,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 44 transitions, 144 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 00:42:27,603 INFO L231 Difference]: Finished difference. Result has 51 places, 44 transitions, 102 flow [2023-11-29 00:42:27,603 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=51, PETRI_TRANSITIONS=44} [2023-11-29 00:42:27,604 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, -14 predicate places. [2023-11-29 00:42:27,604 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 44 transitions, 102 flow [2023-11-29 00:42:27,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:27,605 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:42:27,605 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:42:27,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 00:42:27,605 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-11-29 00:42:27,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:42:27,606 INFO L85 PathProgramCache]: Analyzing trace with hash -777736924, now seen corresponding path program 1 times [2023-11-29 00:42:27,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:42:27,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553959974] [2023-11-29 00:42:27,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:42:27,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:42:27,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:27,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:42:27,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:42:27,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553959974] [2023-11-29 00:42:27,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553959974] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:42:27,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:42:27,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 00:42:27,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398364892] [2023-11-29 00:42:27,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:42:27,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:42:27,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:42:27,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:42:27,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:42:27,720 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 61 [2023-11-29 00:42:27,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 44 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:27,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:42:27,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 61 [2023-11-29 00:42:27,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:42:27,907 INFO L124 PetriNetUnfolderBase]: 1088/1554 cut-off events. [2023-11-29 00:42:27,907 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2023-11-29 00:42:27,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2960 conditions, 1554 events. 1088/1554 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 5920 event pairs, 494 based on Foata normal form. 0/922 useless extension candidates. Maximal degree in co-relation 2950. Up to 1358 conditions per place. [2023-11-29 00:42:27,920 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 23 selfloop transitions, 1 changer transitions 0/42 dead transitions. [2023-11-29 00:42:27,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 42 transitions, 146 flow [2023-11-29 00:42:27,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:42:27,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:42:27,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 125 transitions. [2023-11-29 00:42:27,922 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6830601092896175 [2023-11-29 00:42:27,922 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 125 transitions. [2023-11-29 00:42:27,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 125 transitions. [2023-11-29 00:42:27,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:42:27,923 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 125 transitions. [2023-11-29 00:42:27,923 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:27,924 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:27,924 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:27,925 INFO L175 Difference]: Start difference. First operand has 51 places, 44 transitions, 102 flow. Second operand 3 states and 125 transitions. [2023-11-29 00:42:27,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 42 transitions, 146 flow [2023-11-29 00:42:27,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 42 transitions, 145 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 00:42:27,927 INFO L231 Difference]: Finished difference. Result has 50 places, 42 transitions, 99 flow [2023-11-29 00:42:27,927 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=99, PETRI_PLACES=50, PETRI_TRANSITIONS=42} [2023-11-29 00:42:27,928 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, -15 predicate places. [2023-11-29 00:42:27,928 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 99 flow [2023-11-29 00:42:27,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:27,928 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:42:27,928 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:42:27,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 00:42:27,929 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-11-29 00:42:27,929 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:42:27,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1788193956, now seen corresponding path program 1 times [2023-11-29 00:42:27,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:42:27,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548402666] [2023-11-29 00:42:27,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:42:27,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:42:27,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:28,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:42:28,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:42:28,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548402666] [2023-11-29 00:42:28,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548402666] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:42:28,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:42:28,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 00:42:28,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254545598] [2023-11-29 00:42:28,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:42:28,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:42:28,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:42:28,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:42:28,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:42:28,047 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 61 [2023-11-29 00:42:28,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 99 flow. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:28,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:42:28,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 61 [2023-11-29 00:42:28,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:42:28,207 INFO L124 PetriNetUnfolderBase]: 1056/1492 cut-off events. [2023-11-29 00:42:28,207 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2023-11-29 00:42:28,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2852 conditions, 1492 events. 1056/1492 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 5537 event pairs, 475 based on Foata normal form. 30/927 useless extension candidates. Maximal degree in co-relation 2841. Up to 1311 conditions per place. [2023-11-29 00:42:28,219 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 21 selfloop transitions, 1 changer transitions 0/40 dead transitions. [2023-11-29 00:42:28,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 40 transitions, 139 flow [2023-11-29 00:42:28,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:42:28,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:42:28,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 129 transitions. [2023-11-29 00:42:28,221 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7049180327868853 [2023-11-29 00:42:28,221 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 129 transitions. [2023-11-29 00:42:28,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 129 transitions. [2023-11-29 00:42:28,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:42:28,221 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 129 transitions. [2023-11-29 00:42:28,222 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:28,222 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:28,223 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:28,223 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 99 flow. Second operand 3 states and 129 transitions. [2023-11-29 00:42:28,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 40 transitions, 139 flow [2023-11-29 00:42:28,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 40 transitions, 138 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 00:42:28,224 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 96 flow [2023-11-29 00:42:28,225 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2023-11-29 00:42:28,225 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, -16 predicate places. [2023-11-29 00:42:28,225 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 96 flow [2023-11-29 00:42:28,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:28,226 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:42:28,226 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:42:28,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 00:42:28,226 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-11-29 00:42:28,227 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:42:28,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1788193955, now seen corresponding path program 1 times [2023-11-29 00:42:28,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:42:28,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087057705] [2023-11-29 00:42:28,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:42:28,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:42:28,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:28,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:42:28,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:42:28,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087057705] [2023-11-29 00:42:28,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087057705] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:42:28,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:42:28,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 00:42:28,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305782502] [2023-11-29 00:42:28,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:42:28,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:42:28,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:42:28,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:42:28,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:42:28,314 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 61 [2023-11-29 00:42:28,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:28,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:42:28,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 61 [2023-11-29 00:42:28,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:42:28,471 INFO L124 PetriNetUnfolderBase]: 1108/1534 cut-off events. [2023-11-29 00:42:28,471 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2023-11-29 00:42:28,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2968 conditions, 1534 events. 1108/1534 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 5595 event pairs, 510 based on Foata normal form. 0/933 useless extension candidates. Maximal degree in co-relation 2956. Up to 1384 conditions per place. [2023-11-29 00:42:28,483 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 23 selfloop transitions, 1 changer transitions 0/38 dead transitions. [2023-11-29 00:42:28,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 38 transitions, 140 flow [2023-11-29 00:42:28,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:42:28,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:42:28,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 125 transitions. [2023-11-29 00:42:28,485 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6830601092896175 [2023-11-29 00:42:28,485 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 125 transitions. [2023-11-29 00:42:28,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 125 transitions. [2023-11-29 00:42:28,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:42:28,485 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 125 transitions. [2023-11-29 00:42:28,486 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:28,486 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:28,487 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:28,487 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 96 flow. Second operand 3 states and 125 transitions. [2023-11-29 00:42:28,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 38 transitions, 140 flow [2023-11-29 00:42:28,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 38 transitions, 139 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 00:42:28,488 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 93 flow [2023-11-29 00:42:28,489 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=93, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2023-11-29 00:42:28,489 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, -17 predicate places. [2023-11-29 00:42:28,489 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 93 flow [2023-11-29 00:42:28,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:28,490 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:42:28,490 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, 1, 1, 1, 1, 1] [2023-11-29 00:42:28,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 00:42:28,490 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-11-29 00:42:28,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:42:28,491 INFO L85 PathProgramCache]: Analyzing trace with hash 933237846, now seen corresponding path program 1 times [2023-11-29 00:42:28,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:42:28,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619586136] [2023-11-29 00:42:28,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:42:28,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:42:28,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:28,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:42:28,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:42:28,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619586136] [2023-11-29 00:42:28,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619586136] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:42:28,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:42:28,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:42:28,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546773687] [2023-11-29 00:42:28,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:42:28,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:42:28,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:42:28,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:42:28,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:42:28,666 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 61 [2023-11-29 00:42:28,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 93 flow. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:28,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:42:28,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 61 [2023-11-29 00:42:28,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:42:28,930 INFO L124 PetriNetUnfolderBase]: 1367/1869 cut-off events. [2023-11-29 00:42:28,930 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2023-11-29 00:42:28,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3647 conditions, 1869 events. 1367/1869 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 6604 event pairs, 131 based on Foata normal form. 1/1136 useless extension candidates. Maximal degree in co-relation 3634. Up to 1541 conditions per place. [2023-11-29 00:42:28,945 INFO L140 encePairwiseOnDemand]: 55/61 looper letters, 35 selfloop transitions, 5 changer transitions 1/57 dead transitions. [2023-11-29 00:42:28,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 57 transitions, 220 flow [2023-11-29 00:42:28,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:42:28,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:42:28,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 153 transitions. [2023-11-29 00:42:28,947 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8360655737704918 [2023-11-29 00:42:28,948 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 153 transitions. [2023-11-29 00:42:28,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 153 transitions. [2023-11-29 00:42:28,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:42:28,948 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 153 transitions. [2023-11-29 00:42:28,949 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:28,949 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:28,950 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:28,950 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 93 flow. Second operand 3 states and 153 transitions. [2023-11-29 00:42:28,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 57 transitions, 220 flow [2023-11-29 00:42:28,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 57 transitions, 219 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 00:42:28,952 INFO L231 Difference]: Finished difference. Result has 50 places, 42 transitions, 125 flow [2023-11-29 00:42:28,953 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=125, PETRI_PLACES=50, PETRI_TRANSITIONS=42} [2023-11-29 00:42:28,953 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, -15 predicate places. [2023-11-29 00:42:28,954 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 125 flow [2023-11-29 00:42:28,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:28,954 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:42:28,954 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, 1, 1, 1, 1, 1, 1] [2023-11-29 00:42:28,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 00:42:28,954 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-11-29 00:42:28,955 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:42:28,955 INFO L85 PathProgramCache]: Analyzing trace with hash 2134926882, now seen corresponding path program 1 times [2023-11-29 00:42:28,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:42:28,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901997279] [2023-11-29 00:42:28,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:42:28,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:42:28,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:29,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:42:29,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:42:29,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901997279] [2023-11-29 00:42:29,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901997279] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:42:29,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:42:29,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:42:29,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603535511] [2023-11-29 00:42:29,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:42:29,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:42:29,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:42:29,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:42:29,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:42:29,097 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 61 [2023-11-29 00:42:29,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 125 flow. Second operand has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:29,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:42:29,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 61 [2023-11-29 00:42:29,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:42:29,471 INFO L124 PetriNetUnfolderBase]: 1593/2178 cut-off events. [2023-11-29 00:42:29,472 INFO L125 PetriNetUnfolderBase]: For 506/506 co-relation queries the response was YES. [2023-11-29 00:42:29,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5220 conditions, 2178 events. 1593/2178 cut-off events. For 506/506 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 8049 event pairs, 113 based on Foata normal form. 34/2205 useless extension candidates. Maximal degree in co-relation 5205. Up to 842 conditions per place. [2023-11-29 00:42:29,484 INFO L140 encePairwiseOnDemand]: 56/61 looper letters, 66 selfloop transitions, 10 changer transitions 0/92 dead transitions. [2023-11-29 00:42:29,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 92 transitions, 421 flow [2023-11-29 00:42:29,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:42:29,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 00:42:29,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 255 transitions. [2023-11-29 00:42:29,486 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8360655737704918 [2023-11-29 00:42:29,487 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 255 transitions. [2023-11-29 00:42:29,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 255 transitions. [2023-11-29 00:42:29,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:42:29,487 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 255 transitions. [2023-11-29 00:42:29,488 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 51.0) internal successors, (255), 5 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:29,490 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 61.0) internal successors, (366), 6 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:29,490 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 61.0) internal successors, (366), 6 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:29,490 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 125 flow. Second operand 5 states and 255 transitions. [2023-11-29 00:42:29,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 92 transitions, 421 flow [2023-11-29 00:42:29,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 92 transitions, 413 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 00:42:29,494 INFO L231 Difference]: Finished difference. Result has 55 places, 49 transitions, 185 flow [2023-11-29 00:42:29,494 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=185, PETRI_PLACES=55, PETRI_TRANSITIONS=49} [2023-11-29 00:42:29,495 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, -10 predicate places. [2023-11-29 00:42:29,495 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 49 transitions, 185 flow [2023-11-29 00:42:29,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:29,496 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:42:29,496 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, 1, 1, 1, 1, 1, 1] [2023-11-29 00:42:29,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 00:42:29,496 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-11-29 00:42:29,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:42:29,497 INFO L85 PathProgramCache]: Analyzing trace with hash 94763401, now seen corresponding path program 1 times [2023-11-29 00:42:29,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:42:29,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306470414] [2023-11-29 00:42:29,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:42:29,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:42:29,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:29,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:42:29,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:42:29,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306470414] [2023-11-29 00:42:29,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306470414] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:42:29,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:42:29,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:42:29,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057918897] [2023-11-29 00:42:29,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:42:29,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:42:29,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:42:29,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:42:29,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:42:29,621 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 61 [2023-11-29 00:42:29,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 49 transitions, 185 flow. Second operand has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:29,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:42:29,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 61 [2023-11-29 00:42:29,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:42:30,063 INFO L124 PetriNetUnfolderBase]: 1547/2150 cut-off events. [2023-11-29 00:42:30,063 INFO L125 PetriNetUnfolderBase]: For 1808/1817 co-relation queries the response was YES. [2023-11-29 00:42:30,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6194 conditions, 2150 events. 1547/2150 cut-off events. For 1808/1817 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 8189 event pairs, 95 based on Foata normal form. 55/2198 useless extension candidates. Maximal degree in co-relation 6176. Up to 812 conditions per place. [2023-11-29 00:42:30,081 INFO L140 encePairwiseOnDemand]: 56/61 looper letters, 65 selfloop transitions, 8 changer transitions 0/89 dead transitions. [2023-11-29 00:42:30,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 89 transitions, 442 flow [2023-11-29 00:42:30,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:42:30,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 00:42:30,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 253 transitions. [2023-11-29 00:42:30,083 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8295081967213115 [2023-11-29 00:42:30,084 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 253 transitions. [2023-11-29 00:42:30,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 253 transitions. [2023-11-29 00:42:30,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:42:30,084 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 253 transitions. [2023-11-29 00:42:30,085 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 50.6) internal successors, (253), 5 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:30,086 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 61.0) internal successors, (366), 6 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:30,086 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 61.0) internal successors, (366), 6 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:30,087 INFO L175 Difference]: Start difference. First operand has 55 places, 49 transitions, 185 flow. Second operand 5 states and 253 transitions. [2023-11-29 00:42:30,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 89 transitions, 442 flow [2023-11-29 00:42:30,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 89 transitions, 442 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 00:42:30,091 INFO L231 Difference]: Finished difference. Result has 60 places, 48 transitions, 199 flow [2023-11-29 00:42:30,092 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=199, PETRI_PLACES=60, PETRI_TRANSITIONS=48} [2023-11-29 00:42:30,092 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, -5 predicate places. [2023-11-29 00:42:30,092 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 48 transitions, 199 flow [2023-11-29 00:42:30,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:30,093 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:42:30,093 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, 1, 1, 1, 1, 1, 1] [2023-11-29 00:42:30,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 00:42:30,093 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-11-29 00:42:30,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:42:30,094 INFO L85 PathProgramCache]: Analyzing trace with hash 22308404, now seen corresponding path program 1 times [2023-11-29 00:42:30,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:42:30,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476369387] [2023-11-29 00:42:30,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:42:30,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:42:30,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:30,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:42:30,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:42:30,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476369387] [2023-11-29 00:42:30,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476369387] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:42:30,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:42:30,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:42:30,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411525658] [2023-11-29 00:42:30,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:42:30,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:42:30,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:42:30,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:42:30,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:42:30,236 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 61 [2023-11-29 00:42:30,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 48 transitions, 199 flow. Second operand has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:30,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:42:30,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 61 [2023-11-29 00:42:30,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:42:30,671 INFO L124 PetriNetUnfolderBase]: 1869/2663 cut-off events. [2023-11-29 00:42:30,671 INFO L125 PetriNetUnfolderBase]: For 4527/4533 co-relation queries the response was YES. [2023-11-29 00:42:30,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8479 conditions, 2663 events. 1869/2663 cut-off events. For 4527/4533 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 11731 event pairs, 284 based on Foata normal form. 70/2722 useless extension candidates. Maximal degree in co-relation 8458. Up to 1031 conditions per place. [2023-11-29 00:42:30,690 INFO L140 encePairwiseOnDemand]: 56/61 looper letters, 79 selfloop transitions, 8 changer transitions 0/103 dead transitions. [2023-11-29 00:42:30,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 103 transitions, 652 flow [2023-11-29 00:42:30,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:42:30,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 00:42:30,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 248 transitions. [2023-11-29 00:42:30,692 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8131147540983606 [2023-11-29 00:42:30,692 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 248 transitions. [2023-11-29 00:42:30,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 248 transitions. [2023-11-29 00:42:30,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:42:30,692 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 248 transitions. [2023-11-29 00:42:30,693 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 49.6) internal successors, (248), 5 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:30,694 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 61.0) internal successors, (366), 6 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:30,694 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 61.0) internal successors, (366), 6 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:30,694 INFO L175 Difference]: Start difference. First operand has 60 places, 48 transitions, 199 flow. Second operand 5 states and 248 transitions. [2023-11-29 00:42:30,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 103 transitions, 652 flow [2023-11-29 00:42:30,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 103 transitions, 635 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 00:42:30,699 INFO L231 Difference]: Finished difference. Result has 66 places, 53 transitions, 247 flow [2023-11-29 00:42:30,699 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=247, PETRI_PLACES=66, PETRI_TRANSITIONS=53} [2023-11-29 00:42:30,700 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, 1 predicate places. [2023-11-29 00:42:30,700 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 53 transitions, 247 flow [2023-11-29 00:42:30,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:30,701 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:42:30,701 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, 1, 1, 1, 1, 1, 1] [2023-11-29 00:42:30,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 00:42:30,701 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-11-29 00:42:30,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:42:30,702 INFO L85 PathProgramCache]: Analyzing trace with hash 2067760029, now seen corresponding path program 1 times [2023-11-29 00:42:30,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:42:30,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800226144] [2023-11-29 00:42:30,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:42:30,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:42:30,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:30,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:42:30,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:42:30,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800226144] [2023-11-29 00:42:30,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800226144] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:42:30,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:42:30,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:42:30,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419974276] [2023-11-29 00:42:30,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:42:30,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:42:30,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:42:30,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:42:30,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:42:30,799 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 61 [2023-11-29 00:42:30,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 53 transitions, 247 flow. Second operand has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:30,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:42:30,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 61 [2023-11-29 00:42:30,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:42:31,176 INFO L124 PetriNetUnfolderBase]: 1836/2520 cut-off events. [2023-11-29 00:42:31,176 INFO L125 PetriNetUnfolderBase]: For 5156/5168 co-relation queries the response was YES. [2023-11-29 00:42:31,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9641 conditions, 2520 events. 1836/2520 cut-off events. For 5156/5168 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 10141 event pairs, 70 based on Foata normal form. 39/2544 useless extension candidates. Maximal degree in co-relation 9616. Up to 1016 conditions per place. [2023-11-29 00:42:31,194 INFO L140 encePairwiseOnDemand]: 56/61 looper letters, 81 selfloop transitions, 10 changer transitions 0/107 dead transitions. [2023-11-29 00:42:31,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 107 transitions, 717 flow [2023-11-29 00:42:31,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:42:31,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 00:42:31,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 246 transitions. [2023-11-29 00:42:31,197 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8065573770491803 [2023-11-29 00:42:31,197 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 246 transitions. [2023-11-29 00:42:31,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 246 transitions. [2023-11-29 00:42:31,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:42:31,197 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 246 transitions. [2023-11-29 00:42:31,198 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 49.2) internal successors, (246), 5 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:31,199 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 61.0) internal successors, (366), 6 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:31,199 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 61.0) internal successors, (366), 6 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:31,200 INFO L175 Difference]: Start difference. First operand has 66 places, 53 transitions, 247 flow. Second operand 5 states and 246 transitions. [2023-11-29 00:42:31,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 107 transitions, 717 flow [2023-11-29 00:42:31,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 107 transitions, 717 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 00:42:31,207 INFO L231 Difference]: Finished difference. Result has 71 places, 58 transitions, 310 flow [2023-11-29 00:42:31,208 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=310, PETRI_PLACES=71, PETRI_TRANSITIONS=58} [2023-11-29 00:42:31,208 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, 6 predicate places. [2023-11-29 00:42:31,209 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 58 transitions, 310 flow [2023-11-29 00:42:31,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:31,209 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:42:31,209 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, 1, 1, 1, 1, 1, 1] [2023-11-29 00:42:31,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 00:42:31,209 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-11-29 00:42:31,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:42:31,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1352296840, now seen corresponding path program 2 times [2023-11-29 00:42:31,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:42:31,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424201748] [2023-11-29 00:42:31,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:42:31,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:42:31,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:31,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:42:31,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:42:31,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424201748] [2023-11-29 00:42:31,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424201748] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:42:31,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:42:31,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:42:31,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175320983] [2023-11-29 00:42:31,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:42:31,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:42:31,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:42:31,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:42:31,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:42:31,319 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 61 [2023-11-29 00:42:31,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 58 transitions, 310 flow. Second operand has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:31,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:42:31,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 61 [2023-11-29 00:42:31,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:42:31,668 INFO L124 PetriNetUnfolderBase]: 1653/2267 cut-off events. [2023-11-29 00:42:31,668 INFO L125 PetriNetUnfolderBase]: For 5420/5430 co-relation queries the response was YES. [2023-11-29 00:42:31,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9252 conditions, 2267 events. 1653/2267 cut-off events. For 5420/5430 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 8821 event pairs, 90 based on Foata normal form. 35/2287 useless extension candidates. Maximal degree in co-relation 9224. Up to 877 conditions per place. [2023-11-29 00:42:31,684 INFO L140 encePairwiseOnDemand]: 56/61 looper letters, 76 selfloop transitions, 9 changer transitions 4/105 dead transitions. [2023-11-29 00:42:31,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 105 transitions, 726 flow [2023-11-29 00:42:31,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:42:31,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 00:42:31,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 246 transitions. [2023-11-29 00:42:31,686 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8065573770491803 [2023-11-29 00:42:31,686 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 246 transitions. [2023-11-29 00:42:31,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 246 transitions. [2023-11-29 00:42:31,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:42:31,687 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 246 transitions. [2023-11-29 00:42:31,687 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 49.2) internal successors, (246), 5 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:31,688 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 61.0) internal successors, (366), 6 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:31,689 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 61.0) internal successors, (366), 6 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:31,689 INFO L175 Difference]: Start difference. First operand has 71 places, 58 transitions, 310 flow. Second operand 5 states and 246 transitions. [2023-11-29 00:42:31,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 105 transitions, 726 flow [2023-11-29 00:42:31,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 105 transitions, 713 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-11-29 00:42:31,702 INFO L231 Difference]: Finished difference. Result has 75 places, 57 transitions, 310 flow [2023-11-29 00:42:31,702 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=277, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=310, PETRI_PLACES=75, PETRI_TRANSITIONS=57} [2023-11-29 00:42:31,703 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, 10 predicate places. [2023-11-29 00:42:31,703 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 57 transitions, 310 flow [2023-11-29 00:42:31,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:31,703 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:42:31,703 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, 1, 1, 1, 1, 1, 1] [2023-11-29 00:42:31,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 00:42:31,704 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-11-29 00:42:31,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:42:31,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1302612057, now seen corresponding path program 2 times [2023-11-29 00:42:31,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:42:31,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003194048] [2023-11-29 00:42:31,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:42:31,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:42:31,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:31,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:42:31,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:42:31,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003194048] [2023-11-29 00:42:31,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003194048] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:42:31,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [730964185] [2023-11-29 00:42:31,813 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 00:42:31,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:42:31,813 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42b976be-4d73-4d24-bdbf-6a9117e8c02b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:42:31,815 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42b976be-4d73-4d24-bdbf-6a9117e8c02b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:42:31,831 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42b976be-4d73-4d24-bdbf-6a9117e8c02b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 00:42:31,966 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 00:42:31,966 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:42:31,968 INFO L262 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 00:42:31,972 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:42:32,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:42:32,228 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:42:32,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:42:32,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [730964185] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:42:32,367 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:42:32,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-11-29 00:42:32,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975616185] [2023-11-29 00:42:32,368 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:42:32,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:42:32,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:42:32,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:42:32,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:42:32,370 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 61 [2023-11-29 00:42:32,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 57 transitions, 310 flow. Second operand has 6 states, 6 states have (on average 42.833333333333336) internal successors, (257), 6 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:32,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:42:32,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 61 [2023-11-29 00:42:32,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:42:32,816 INFO L124 PetriNetUnfolderBase]: 1591/2315 cut-off events. [2023-11-29 00:42:32,816 INFO L125 PetriNetUnfolderBase]: For 5709/5709 co-relation queries the response was YES. [2023-11-29 00:42:32,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9403 conditions, 2315 events. 1591/2315 cut-off events. For 5709/5709 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 10253 event pairs, 257 based on Foata normal form. 62/2366 useless extension candidates. Maximal degree in co-relation 9373. Up to 1162 conditions per place. [2023-11-29 00:42:32,840 INFO L140 encePairwiseOnDemand]: 56/61 looper letters, 79 selfloop transitions, 8 changer transitions 0/103 dead transitions. [2023-11-29 00:42:32,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 103 transitions, 738 flow [2023-11-29 00:42:32,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:42:32,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 00:42:32,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 243 transitions. [2023-11-29 00:42:32,843 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7967213114754098 [2023-11-29 00:42:32,843 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 243 transitions. [2023-11-29 00:42:32,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 243 transitions. [2023-11-29 00:42:32,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:42:32,843 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 243 transitions. [2023-11-29 00:42:32,844 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 48.6) internal successors, (243), 5 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:32,845 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 61.0) internal successors, (366), 6 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:32,846 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 61.0) internal successors, (366), 6 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:32,846 INFO L175 Difference]: Start difference. First operand has 75 places, 57 transitions, 310 flow. Second operand 5 states and 243 transitions. [2023-11-29 00:42:32,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 103 transitions, 738 flow [2023-11-29 00:42:32,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 103 transitions, 729 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-11-29 00:42:32,855 INFO L231 Difference]: Finished difference. Result has 80 places, 60 transitions, 351 flow [2023-11-29 00:42:32,855 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=351, PETRI_PLACES=80, PETRI_TRANSITIONS=60} [2023-11-29 00:42:32,856 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, 15 predicate places. [2023-11-29 00:42:32,856 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 60 transitions, 351 flow [2023-11-29 00:42:32,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 42.833333333333336) internal successors, (257), 6 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:32,856 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:42:32,857 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, 1, 1, 1, 1, 1, 1] [2023-11-29 00:42:32,864 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42b976be-4d73-4d24-bdbf-6a9117e8c02b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 00:42:33,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42b976be-4d73-4d24-bdbf-6a9117e8c02b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:42:33,058 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-11-29 00:42:33,058 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:42:33,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1039000878, now seen corresponding path program 2 times [2023-11-29 00:42:33,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:42:33,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273609761] [2023-11-29 00:42:33,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:42:33,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:42:33,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:33,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:42:33,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:42:33,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273609761] [2023-11-29 00:42:33,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273609761] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:42:33,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:42:33,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:42:33,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199045007] [2023-11-29 00:42:33,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:42:33,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:42:33,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:42:33,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:42:33,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:42:33,169 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 61 [2023-11-29 00:42:33,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 60 transitions, 351 flow. Second operand has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:33,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:42:33,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 61 [2023-11-29 00:42:33,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:42:33,607 INFO L124 PetriNetUnfolderBase]: 1515/2244 cut-off events. [2023-11-29 00:42:33,607 INFO L125 PetriNetUnfolderBase]: For 6322/6338 co-relation queries the response was YES. [2023-11-29 00:42:33,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9545 conditions, 2244 events. 1515/2244 cut-off events. For 6322/6338 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 10248 event pairs, 349 based on Foata normal form. 84/2316 useless extension candidates. Maximal degree in co-relation 9512. Up to 1174 conditions per place. [2023-11-29 00:42:33,631 INFO L140 encePairwiseOnDemand]: 56/61 looper letters, 111 selfloop transitions, 8 changer transitions 0/135 dead transitions. [2023-11-29 00:42:33,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 135 transitions, 1080 flow [2023-11-29 00:42:33,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:42:33,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 00:42:33,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 254 transitions. [2023-11-29 00:42:33,633 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8327868852459016 [2023-11-29 00:42:33,634 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 254 transitions. [2023-11-29 00:42:33,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 254 transitions. [2023-11-29 00:42:33,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:42:33,634 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 254 transitions. [2023-11-29 00:42:33,635 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 50.8) internal successors, (254), 5 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:33,636 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 61.0) internal successors, (366), 6 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:33,636 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 61.0) internal successors, (366), 6 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:33,636 INFO L175 Difference]: Start difference. First operand has 80 places, 60 transitions, 351 flow. Second operand 5 states and 254 transitions. [2023-11-29 00:42:33,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 135 transitions, 1080 flow [2023-11-29 00:42:33,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 135 transitions, 1022 flow, removed 20 selfloop flow, removed 2 redundant places. [2023-11-29 00:42:33,651 INFO L231 Difference]: Finished difference. Result has 84 places, 63 transitions, 381 flow [2023-11-29 00:42:33,651 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=331, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=381, PETRI_PLACES=84, PETRI_TRANSITIONS=63} [2023-11-29 00:42:33,651 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, 19 predicate places. [2023-11-29 00:42:33,652 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 63 transitions, 381 flow [2023-11-29 00:42:33,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:33,652 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:42:33,652 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, 1, 1, 1, 1, 1, 1] [2023-11-29 00:42:33,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 00:42:33,652 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-11-29 00:42:33,653 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:42:33,653 INFO L85 PathProgramCache]: Analyzing trace with hash -655486671, now seen corresponding path program 2 times [2023-11-29 00:42:33,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:42:33,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270694882] [2023-11-29 00:42:33,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:42:33,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:42:33,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:33,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:42:33,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:42:33,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270694882] [2023-11-29 00:42:33,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270694882] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:42:33,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:42:33,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:42:33,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123461400] [2023-11-29 00:42:33,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:42:33,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:42:33,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:42:33,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:42:33,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:42:33,782 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 61 [2023-11-29 00:42:33,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 63 transitions, 381 flow. Second operand has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:33,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:42:33,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 61 [2023-11-29 00:42:33,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:42:34,236 INFO L124 PetriNetUnfolderBase]: 1447/2154 cut-off events. [2023-11-29 00:42:34,236 INFO L125 PetriNetUnfolderBase]: For 6546/6562 co-relation queries the response was YES. [2023-11-29 00:42:34,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9706 conditions, 2154 events. 1447/2154 cut-off events. For 6546/6562 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 9813 event pairs, 375 based on Foata normal form. 72/2213 useless extension candidates. Maximal degree in co-relation 9671. Up to 1150 conditions per place. [2023-11-29 00:42:34,264 INFO L140 encePairwiseOnDemand]: 56/61 looper letters, 111 selfloop transitions, 8 changer transitions 0/135 dead transitions. [2023-11-29 00:42:34,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 135 transitions, 1073 flow [2023-11-29 00:42:34,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:42:34,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 00:42:34,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 251 transitions. [2023-11-29 00:42:34,266 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8229508196721311 [2023-11-29 00:42:34,266 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 251 transitions. [2023-11-29 00:42:34,266 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 251 transitions. [2023-11-29 00:42:34,267 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:42:34,267 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 251 transitions. [2023-11-29 00:42:34,268 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 50.2) internal successors, (251), 5 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:34,269 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 61.0) internal successors, (366), 6 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:34,269 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 61.0) internal successors, (366), 6 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:34,269 INFO L175 Difference]: Start difference. First operand has 84 places, 63 transitions, 381 flow. Second operand 5 states and 251 transitions. [2023-11-29 00:42:34,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 135 transitions, 1073 flow [2023-11-29 00:42:34,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 135 transitions, 1064 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-11-29 00:42:34,284 INFO L231 Difference]: Finished difference. Result has 89 places, 66 transitions, 429 flow [2023-11-29 00:42:34,284 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=429, PETRI_PLACES=89, PETRI_TRANSITIONS=66} [2023-11-29 00:42:34,285 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, 24 predicate places. [2023-11-29 00:42:34,285 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 66 transitions, 429 flow [2023-11-29 00:42:34,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:42:34,285 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:42:34,286 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, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:42:34,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 00:42:34,286 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-11-29 00:42:34,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:42:34,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1327899303, now seen corresponding path program 1 times [2023-11-29 00:42:34,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:42:34,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001285845] [2023-11-29 00:42:34,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:42:34,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:42:34,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:35,073 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:42:35,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:42:35,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001285845] [2023-11-29 00:42:35,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001285845] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:42:35,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490816080] [2023-11-29 00:42:35,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:42:35,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:42:35,074 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42b976be-4d73-4d24-bdbf-6a9117e8c02b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:42:35,075 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42b976be-4d73-4d24-bdbf-6a9117e8c02b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:42:35,078 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42b976be-4d73-4d24-bdbf-6a9117e8c02b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 00:42:38,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:38,325 INFO L262 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-29 00:42:38,328 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:43:43,658 WARN L293 SmtUtils]: Spent 9.20s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 00:45:14,414 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:45:14,415 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:45:53,411 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:45:53,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [490816080] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:45:53,411 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:45:53,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2023-11-29 00:45:53,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362037928] [2023-11-29 00:45:53,412 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:45:53,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-29 00:45:53,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:45:53,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-29 00:45:53,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=162, Unknown=19, NotChecked=0, Total=240 [2023-11-29 00:45:53,414 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 61 [2023-11-29 00:45:53,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 66 transitions, 429 flow. Second operand has 16 states, 16 states have (on average 40.4375) internal successors, (647), 16 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:45:53,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:45:53,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 61 [2023-11-29 00:45:53,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:45:57,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:46:03,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.84s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:46:06,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.14s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:46:25,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:46:29,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:46:34,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:46:37,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.35s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:46:41,466 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.71s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:46:45,593 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:46:49,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:46:59,458 WARN L293 SmtUtils]: Spent 5.58s on a formula simplification. DAG size of input: 37 DAG size of output: 32 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 00:47:09,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.17s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:47:16,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.95s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:47:20,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:47:22,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:47:36,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:47:58,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:48:01,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:48:05,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:48:07,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:48:08,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:48:10,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:48:14,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:48:19,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:48:23,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:48:25,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:48:32,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.89s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:48:32,631 INFO L124 PetriNetUnfolderBase]: 3502/5036 cut-off events. [2023-11-29 00:48:32,631 INFO L125 PetriNetUnfolderBase]: For 16408/16408 co-relation queries the response was YES. [2023-11-29 00:48:32,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24804 conditions, 5036 events. 3502/5036 cut-off events. For 16408/16408 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 25104 event pairs, 27 based on Foata normal form. 20/5051 useless extension candidates. Maximal degree in co-relation 24766. Up to 2063 conditions per place. [2023-11-29 00:48:32,700 INFO L140 encePairwiseOnDemand]: 53/61 looper letters, 241 selfloop transitions, 129 changer transitions 17/403 dead transitions. [2023-11-29 00:48:32,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 403 transitions, 3351 flow [2023-11-29 00:48:32,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-29 00:48:32,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-11-29 00:48:32,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 973 transitions. [2023-11-29 00:48:32,705 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8395168248490078 [2023-11-29 00:48:32,705 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 973 transitions. [2023-11-29 00:48:32,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 973 transitions. [2023-11-29 00:48:32,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:48:32,706 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 973 transitions. [2023-11-29 00:48:32,710 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 51.21052631578947) internal successors, (973), 19 states have internal predecessors, (973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:32,713 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 61.0) internal successors, (1220), 20 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:32,714 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 61.0) internal successors, (1220), 20 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:32,714 INFO L175 Difference]: Start difference. First operand has 89 places, 66 transitions, 429 flow. Second operand 19 states and 973 transitions. [2023-11-29 00:48:32,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 403 transitions, 3351 flow [2023-11-29 00:48:32,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 403 transitions, 3328 flow, removed 8 selfloop flow, removed 1 redundant places. [2023-11-29 00:48:32,770 INFO L231 Difference]: Finished difference. Result has 115 places, 194 transitions, 2098 flow [2023-11-29 00:48:32,771 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=2098, PETRI_PLACES=115, PETRI_TRANSITIONS=194} [2023-11-29 00:48:32,771 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, 50 predicate places. [2023-11-29 00:48:32,771 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 194 transitions, 2098 flow [2023-11-29 00:48:32,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 40.4375) internal successors, (647), 16 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:32,772 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:48:32,772 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, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:48:32,779 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42b976be-4d73-4d24-bdbf-6a9117e8c02b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 00:48:32,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42b976be-4d73-4d24-bdbf-6a9117e8c02b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-29 00:48:32,973 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-11-29 00:48:32,973 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:48:32,973 INFO L85 PathProgramCache]: Analyzing trace with hash 2074447737, now seen corresponding path program 1 times [2023-11-29 00:48:32,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:48:32,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133625153] [2023-11-29 00:48:32,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:48:32,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:48:33,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:48:33,698 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:48:33,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:48:33,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133625153] [2023-11-29 00:48:33,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133625153] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:48:33,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1899741600] [2023-11-29 00:48:33,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:48:33,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:48:33,699 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42b976be-4d73-4d24-bdbf-6a9117e8c02b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:48:33,700 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42b976be-4d73-4d24-bdbf-6a9117e8c02b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:48:33,700 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42b976be-4d73-4d24-bdbf-6a9117e8c02b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 00:48:40,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:48:40,092 INFO L262 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-29 00:48:40,094 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:50:02,808 WARN L293 SmtUtils]: Spent 8.42s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 00:50:33,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:50:33,248 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:51:13,635 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:51:13,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1899741600] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:51:13,635 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:51:13,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2023-11-29 00:51:13,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083119507] [2023-11-29 00:51:13,635 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:51:13,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-29 00:51:13,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:51:13,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-29 00:51:13,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=167, Unknown=19, NotChecked=0, Total=240 [2023-11-29 00:51:13,638 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 61 [2023-11-29 00:51:13,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 194 transitions, 2098 flow. Second operand has 16 states, 16 states have (on average 40.625) internal successors, (650), 16 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-11-29 00:51:13,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:51:13,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 61 [2023-11-29 00:51:13,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:51:17,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:51:22,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:51:50,842 WARN L293 SmtUtils]: Spent 16.57s on a formula simplification. DAG size of input: 64 DAG size of output: 57 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 00:51:54,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:51:59,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.72s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:52:03,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:52:05,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:52:10,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:52:14,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:52:33,326 WARN L293 SmtUtils]: Spent 13.19s on a formula simplification. DAG size of input: 74 DAG size of output: 52 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 00:52:37,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:52:41,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:52:43,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:52:44,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:52:45,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:52:49,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:52:50,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:52:54,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:52:58,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:53:03,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:53:05,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:53:09,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:53:22,834 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:53:25,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.65s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:53:29,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:53:33,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:53:37,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:53:40,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:53:42,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:53:45,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.37s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:53:49,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:53:53,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:53:58,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:54:02,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:54:03,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:54:08,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:54:12,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:54:16,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:54:19,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.55s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:54:23,781 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (* (div c_~x4~0 4294967296) 4294967296))) (let ((.cse0 (+ c_~x3~0 .cse2)) (.cse1 (* 4294967296 (div c_~x3~0 4294967296))) (.cse6 (mod c_~n~0 4294967296)) (.cse5 (mod (* 4294967295 (div (* (- 1) c_~x3~0) 4)) 4294967296)) (.cse4 (mod c_~x1~0 4294967296))) (and (or (< .cse0 (+ .cse1 c_~x4~0 1)) (< (+ 2 (* 4294967296 (div c_~n~0 4294967296)) c_~x4~0) (+ c_~n~0 .cse2))) (let ((.cse3 (+ .cse1 c_~x4~0))) (or (< .cse3 .cse0) (and (= .cse3 .cse0) (= (+ c_~x1~0 (* (div c_~x2~0 4294967296) 4294967296)) (+ (* 4294967296 (div c_~x1~0 4294967296)) c_~x2~0))))) (= .cse4 (mod c_~x2~0 4294967296)) (<= (+ .cse5 1) .cse6) (<= .cse6 (mod c_~x3~0 4294967296)) (= (mod (div c_~x4~0 4) 4294967296) .cse5) (<= 1 .cse4) (= (mod c_~x4~0 4) 0) (= (mod (* c_~x3~0 3) 4) 0)))) is different from false [2023-11-29 00:54:28,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:54:42,337 WARN L293 SmtUtils]: Spent 8.72s on a formula simplification. DAG size of input: 47 DAG size of output: 34 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 00:54:46,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:55:09,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:55:11,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:55:21,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:55:26,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.77s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:55:29,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:55:31,821 INFO L124 PetriNetUnfolderBase]: 3999/5942 cut-off events. [2023-11-29 00:55:31,821 INFO L125 PetriNetUnfolderBase]: For 28923/28932 co-relation queries the response was YES. [2023-11-29 00:55:31,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32813 conditions, 5942 events. 3999/5942 cut-off events. For 28923/28932 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 31959 event pairs, 303 based on Foata normal form. 7/5936 useless extension candidates. Maximal degree in co-relation 32765. Up to 4524 conditions per place. [2023-11-29 00:55:31,893 INFO L140 encePairwiseOnDemand]: 47/61 looper letters, 258 selfloop transitions, 72 changer transitions 12/358 dead transitions. [2023-11-29 00:55:31,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 358 transitions, 3995 flow [2023-11-29 00:55:31,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 00:55:31,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-29 00:55:31,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 629 transitions. [2023-11-29 00:55:31,898 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7931904161412359 [2023-11-29 00:55:31,899 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 629 transitions. [2023-11-29 00:55:31,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 629 transitions. [2023-11-29 00:55:31,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:55:31,900 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 629 transitions. [2023-11-29 00:55:31,902 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 48.38461538461539) internal successors, (629), 13 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:55:31,905 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 61.0) internal successors, (854), 14 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:55:31,906 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 61.0) internal successors, (854), 14 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:55:31,906 INFO L175 Difference]: Start difference. First operand has 115 places, 194 transitions, 2098 flow. Second operand 13 states and 629 transitions. [2023-11-29 00:55:31,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 358 transitions, 3995 flow [2023-11-29 00:55:32,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 358 transitions, 3594 flow, removed 197 selfloop flow, removed 1 redundant places. [2023-11-29 00:55:32,160 INFO L231 Difference]: Finished difference. Result has 134 places, 257 transitions, 2657 flow [2023-11-29 00:55:32,161 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=1717, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2657, PETRI_PLACES=134, PETRI_TRANSITIONS=257} [2023-11-29 00:55:32,161 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, 69 predicate places. [2023-11-29 00:55:32,161 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 257 transitions, 2657 flow [2023-11-29 00:55:32,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 40.625) internal successors, (650), 16 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-11-29 00:55:32,162 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:55:32,162 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, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:55:32,168 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42b976be-4d73-4d24-bdbf-6a9117e8c02b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 00:55:32,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42b976be-4d73-4d24-bdbf-6a9117e8c02b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:55:32,362 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-11-29 00:55:32,363 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:55:32,363 INFO L85 PathProgramCache]: Analyzing trace with hash -149718901, now seen corresponding path program 2 times [2023-11-29 00:55:32,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:55:32,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946013022] [2023-11-29 00:55:32,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:55:32,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:55:32,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:55:33,008 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:55:33,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:55:33,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946013022] [2023-11-29 00:55:33,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946013022] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:55:33,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [78471299] [2023-11-29 00:55:33,009 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 00:55:33,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:55:33,009 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42b976be-4d73-4d24-bdbf-6a9117e8c02b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:55:33,010 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42b976be-4d73-4d24-bdbf-6a9117e8c02b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:55:33,013 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42b976be-4d73-4d24-bdbf-6a9117e8c02b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 00:55:37,621 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 00:55:37,622 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:55:37,626 INFO L262 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-29 00:55:37,628 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:56:21,933 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:56:21,933 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:56:32,265 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:56:32,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [78471299] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:56:32,266 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:56:32,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2023-11-29 00:56:32,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406433119] [2023-11-29 00:56:32,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:56:32,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-29 00:56:32,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:56:32,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-29 00:56:32,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=167, Unknown=7, NotChecked=0, Total=240 [2023-11-29 00:56:32,269 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 61 [2023-11-29 00:56:32,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 257 transitions, 2657 flow. Second operand has 16 states, 16 states have (on average 40.625) internal successors, (650), 16 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-11-29 00:56:32,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:56:32,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 61 [2023-11-29 00:56:32,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:56:36,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:56:58,469 WARN L293 SmtUtils]: Spent 8.84s on a formula simplification. DAG size of input: 59 DAG size of output: 44 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 00:57:02,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:57:06,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:57:10,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:57:15,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:57:19,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []