./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix018_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 9bd2c7ff 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_a7f7c7aa-98bf-406b-a46f-01cb9ed83d5e/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7f7c7aa-98bf-406b-a46f-01cb9ed83d5e/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7f7c7aa-98bf-406b-a46f-01cb9ed83d5e/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7f7c7aa-98bf-406b-a46f-01cb9ed83d5e/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix018_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7f7c7aa-98bf-406b-a46f-01cb9ed83d5e/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7f7c7aa-98bf-406b-a46f-01cb9ed83d5e/bin/uautomizer-verify-uCwYo4JHxu --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 5a744aa24a15b244d86986861038a45981c329f5578e2da992d82373e2f73c5a --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:58:50,770 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:58:50,850 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7f7c7aa-98bf-406b-a46f-01cb9ed83d5e/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-19 07:58:50,855 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:58:50,856 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:58:50,898 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:58:50,899 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:58:50,899 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:58:50,900 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:58:50,901 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:58:50,902 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:58:50,902 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:58:50,903 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:58:50,904 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:58:50,904 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:58:50,905 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:58:50,906 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:58:50,909 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:58:50,909 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-19 07:58:50,910 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-19 07:58:50,910 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-19 07:58:50,911 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:58:50,912 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-19 07:58:50,912 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 07:58:50,913 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:58:50,913 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:58:50,914 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:58:50,914 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:58:50,915 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:58:50,915 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:58:50,916 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:58:50,917 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:58:50,917 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:58:50,918 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:58:50,918 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:58:50,919 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:58:50,919 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:58:50,920 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:58:50,920 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_a7f7c7aa-98bf-406b-a46f-01cb9ed83d5e/bin/uautomizer-verify-uCwYo4JHxu/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_a7f7c7aa-98bf-406b-a46f-01cb9ed83d5e/bin/uautomizer-verify-uCwYo4JHxu 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 -> 5a744aa24a15b244d86986861038a45981c329f5578e2da992d82373e2f73c5a [2023-11-19 07:58:51,197 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:58:51,236 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:58:51,239 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:58:51,241 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:58:51,242 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:58:51,244 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7f7c7aa-98bf-406b-a46f-01cb9ed83d5e/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/pthread-wmm/mix018_power.oepc_pso.oepc_rmo.oepc.i [2023-11-19 07:58:54,380 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:58:54,771 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:58:54,772 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7f7c7aa-98bf-406b-a46f-01cb9ed83d5e/sv-benchmarks/c/pthread-wmm/mix018_power.oepc_pso.oepc_rmo.oepc.i [2023-11-19 07:58:54,800 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7f7c7aa-98bf-406b-a46f-01cb9ed83d5e/bin/uautomizer-verify-uCwYo4JHxu/data/924f73755/a4e38a97a3964c71adc3fc98f7ed4f17/FLAGf27d27478 [2023-11-19 07:58:54,819 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7f7c7aa-98bf-406b-a46f-01cb9ed83d5e/bin/uautomizer-verify-uCwYo4JHxu/data/924f73755/a4e38a97a3964c71adc3fc98f7ed4f17 [2023-11-19 07:58:54,826 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:58:54,830 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:58:54,833 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:58:54,833 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:58:54,838 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:58:54,841 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:58:54" (1/1) ... [2023-11-19 07:58:54,842 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ce621d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:54, skipping insertion in model container [2023-11-19 07:58:54,842 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:58:54" (1/1) ... [2023-11-19 07:58:54,910 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:58:55,433 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:58:55,454 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:58:55,558 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:58:55,617 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:58:55,617 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:58:55,626 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:58:55,627 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:55 WrapperNode [2023-11-19 07:58:55,627 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:58:55,628 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:58:55,629 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:58:55,629 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:58:55,638 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:55" (1/1) ... [2023-11-19 07:58:55,678 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:55" (1/1) ... [2023-11-19 07:58:55,735 INFO L138 Inliner]: procedures = 177, calls = 70, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 150 [2023-11-19 07:58:55,735 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:58:55,736 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:58:55,736 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:58:55,737 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:58:55,747 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:55" (1/1) ... [2023-11-19 07:58:55,747 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:55" (1/1) ... [2023-11-19 07:58:55,763 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:55" (1/1) ... [2023-11-19 07:58:55,767 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:55" (1/1) ... [2023-11-19 07:58:55,777 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:55" (1/1) ... [2023-11-19 07:58:55,795 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:55" (1/1) ... [2023-11-19 07:58:55,798 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:55" (1/1) ... [2023-11-19 07:58:55,804 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:55" (1/1) ... [2023-11-19 07:58:55,808 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:58:55,814 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:58:55,815 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:58:55,815 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:58:55,816 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:55" (1/1) ... [2023-11-19 07:58:55,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:58:55,836 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7f7c7aa-98bf-406b-a46f-01cb9ed83d5e/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:58:55,859 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7f7c7aa-98bf-406b-a46f-01cb9ed83d5e/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:58:55,881 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7f7c7aa-98bf-406b-a46f-01cb9ed83d5e/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:58:55,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 07:58:55,901 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-19 07:58:55,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:58:55,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 07:58:55,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 07:58:55,902 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-19 07:58:55,903 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-19 07:58:55,903 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-19 07:58:55,903 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-19 07:58:55,903 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-19 07:58:55,903 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-19 07:58:55,904 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-19 07:58:55,904 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-19 07:58:55,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:58:55,904 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-19 07:58:55,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:58:55,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:58:55,906 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-19 07:58:56,060 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:58:56,063 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:58:56,642 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:58:56,849 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:58:56,850 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 07:58:56,857 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:58:56 BoogieIcfgContainer [2023-11-19 07:58:56,858 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:58:56,863 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:58:56,863 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:58:56,866 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:58:56,867 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:58:54" (1/3) ... [2023-11-19 07:58:56,868 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@efb61f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:58:56, skipping insertion in model container [2023-11-19 07:58:56,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:55" (2/3) ... [2023-11-19 07:58:56,871 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@efb61f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:58:56, skipping insertion in model container [2023-11-19 07:58:56,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:58:56" (3/3) ... [2023-11-19 07:58:56,873 INFO L112 eAbstractionObserver]: Analyzing ICFG mix018_power.oepc_pso.oepc_rmo.oepc.i [2023-11-19 07:58:56,897 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:58:56,899 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-19 07:58:56,899 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 07:58:57,001 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 07:58:57,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 152 transitions, 320 flow [2023-11-19 07:58:57,127 INFO L124 PetriNetUnfolderBase]: 4/148 cut-off events. [2023-11-19 07:58:57,128 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:58:57,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 148 events. 4/148 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 120 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 107. Up to 2 conditions per place. [2023-11-19 07:58:57,135 INFO L82 GeneralOperation]: Start removeDead. Operand has 161 places, 152 transitions, 320 flow [2023-11-19 07:58:57,141 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 157 places, 148 transitions, 308 flow [2023-11-19 07:58:57,145 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 07:58:57,156 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 157 places, 148 transitions, 308 flow [2023-11-19 07:58:57,159 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 157 places, 148 transitions, 308 flow [2023-11-19 07:58:57,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 148 transitions, 308 flow [2023-11-19 07:58:57,220 INFO L124 PetriNetUnfolderBase]: 4/148 cut-off events. [2023-11-19 07:58:57,222 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:58:57,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 148 events. 4/148 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 120 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 107. Up to 2 conditions per place. [2023-11-19 07:58:57,231 INFO L119 LiptonReduction]: Number of co-enabled transitions 4248 [2023-11-19 07:59:02,980 INFO L134 LiptonReduction]: Checked pairs total: 11306 [2023-11-19 07:59:02,980 INFO L136 LiptonReduction]: Total number of compositions: 140 [2023-11-19 07:59:03,017 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:59:03,029 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;@5b87533f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:59:03,029 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-19 07:59:03,031 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 07:59:03,032 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-19 07:59:03,032 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:59:03,032 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:59:03,033 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-19 07:59:03,034 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:59:03,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:59:03,041 INFO L85 PathProgramCache]: Analyzing trace with hash 653, now seen corresponding path program 1 times [2023-11-19 07:59:03,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:59:03,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430147237] [2023-11-19 07:59:03,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:59:03,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:59:03,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:03,219 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-19 07:59:03,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:59:03,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430147237] [2023-11-19 07:59:03,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430147237] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:59:03,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:59:03,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-19 07:59:03,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102502071] [2023-11-19 07:59:03,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:59:03,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 07:59:03,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:59:03,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 07:59:03,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 07:59:03,277 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 292 [2023-11-19 07:59:03,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 94 flow. Second operand has 2 states, 2 states have (on average 135.5) internal successors, (271), 2 states have internal predecessors, (271), 0 states have call successors, (0), 0 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-19 07:59:03,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:59:03,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 292 [2023-11-19 07:59:03,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:59:05,745 INFO L124 PetriNetUnfolderBase]: 8719/11811 cut-off events. [2023-11-19 07:59:05,746 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2023-11-19 07:59:05,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23759 conditions, 11811 events. 8719/11811 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 61281 event pairs, 8719 based on Foata normal form. 0/10304 useless extension candidates. Maximal degree in co-relation 23747. Up to 11731 conditions per place. [2023-11-19 07:59:05,878 INFO L140 encePairwiseOnDemand]: 283/292 looper letters, 28 selfloop transitions, 0 changer transitions 0/32 dead transitions. [2023-11-19 07:59:05,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 32 transitions, 132 flow [2023-11-19 07:59:05,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 07:59:05,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-19 07:59:05,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 307 transitions. [2023-11-19 07:59:05,902 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5256849315068494 [2023-11-19 07:59:05,903 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 307 transitions. [2023-11-19 07:59:05,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 307 transitions. [2023-11-19 07:59:05,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:59:05,912 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 307 transitions. [2023-11-19 07:59:05,920 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 153.5) internal successors, (307), 2 states have internal predecessors, (307), 0 states have call successors, (0), 0 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-19 07:59:05,925 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 292.0) internal successors, (876), 3 states have internal predecessors, (876), 0 states have call successors, (0), 0 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-19 07:59:05,927 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 292.0) internal successors, (876), 3 states have internal predecessors, (876), 0 states have call successors, (0), 0 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-19 07:59:05,929 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 94 flow. Second operand 2 states and 307 transitions. [2023-11-19 07:59:05,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 32 transitions, 132 flow [2023-11-19 07:59:05,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 32 transitions, 128 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-19 07:59:05,943 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 72 flow [2023-11-19 07:59:05,946 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=292, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=72, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2023-11-19 07:59:05,951 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -11 predicate places. [2023-11-19 07:59:05,952 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 72 flow [2023-11-19 07:59:05,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 135.5) internal successors, (271), 2 states have internal predecessors, (271), 0 states have call successors, (0), 0 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-19 07:59:05,953 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:59:05,953 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-19 07:59:05,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:59:05,954 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:59:05,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:59:05,954 INFO L85 PathProgramCache]: Analyzing trace with hash 642049, now seen corresponding path program 1 times [2023-11-19 07:59:05,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:59:05,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761294972] [2023-11-19 07:59:05,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:59:05,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:59:06,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:06,310 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-19 07:59:06,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:59:06,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761294972] [2023-11-19 07:59:06,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761294972] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:59:06,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:59:06,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:59:06,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055679847] [2023-11-19 07:59:06,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:59:06,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:59:06,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:59:06,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:59:06,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:59:06,319 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 292 [2023-11-19 07:59:06,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 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-19 07:59:06,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:59:06,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 292 [2023-11-19 07:59:06,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:59:08,187 INFO L124 PetriNetUnfolderBase]: 6855/9882 cut-off events. [2023-11-19 07:59:08,188 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:59:08,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19319 conditions, 9882 events. 6855/9882 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 468. Compared 59731 event pairs, 1263 based on Foata normal form. 0/9221 useless extension candidates. Maximal degree in co-relation 19316. Up to 7399 conditions per place. [2023-11-19 07:59:08,350 INFO L140 encePairwiseOnDemand]: 289/292 looper letters, 45 selfloop transitions, 2 changer transitions 2/53 dead transitions. [2023-11-19 07:59:08,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 53 transitions, 218 flow [2023-11-19 07:59:08,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:59:08,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:59:08,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 452 transitions. [2023-11-19 07:59:08,357 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5159817351598174 [2023-11-19 07:59:08,358 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 452 transitions. [2023-11-19 07:59:08,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 452 transitions. [2023-11-19 07:59:08,358 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:59:08,359 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 452 transitions. [2023-11-19 07:59:08,361 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 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-19 07:59:08,367 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 292.0) internal successors, (1168), 4 states have internal predecessors, (1168), 0 states have call successors, (0), 0 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-19 07:59:08,371 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 292.0) internal successors, (1168), 4 states have internal predecessors, (1168), 0 states have call successors, (0), 0 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-19 07:59:08,372 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 72 flow. Second operand 3 states and 452 transitions. [2023-11-19 07:59:08,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 53 transitions, 218 flow [2023-11-19 07:59:08,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 53 transitions, 218 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 07:59:08,376 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 72 flow [2023-11-19 07:59:08,377 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=292, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2023-11-19 07:59:08,379 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -10 predicate places. [2023-11-19 07:59:08,379 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 72 flow [2023-11-19 07:59:08,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 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-19 07:59:08,387 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:59:08,388 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:59:08,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:59:08,389 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:59:08,390 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:59:08,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1392732217, now seen corresponding path program 1 times [2023-11-19 07:59:08,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:59:08,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081800327] [2023-11-19 07:59:08,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:59:08,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:59:08,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:08,873 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-19 07:59:08,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:59:08,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081800327] [2023-11-19 07:59:08,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081800327] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:59:08,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:59:08,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:59:08,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912324870] [2023-11-19 07:59:08,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:59:08,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:59:08,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:59:08,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:59:08,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:59:08,910 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 292 [2023-11-19 07:59:08,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 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-19 07:59:08,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:59:08,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 292 [2023-11-19 07:59:08,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:59:13,356 INFO L124 PetriNetUnfolderBase]: 23689/31854 cut-off events. [2023-11-19 07:59:13,356 INFO L125 PetriNetUnfolderBase]: For 1249/1249 co-relation queries the response was YES. [2023-11-19 07:59:13,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65437 conditions, 31854 events. 23689/31854 cut-off events. For 1249/1249 co-relation queries the response was YES. Maximal size of possible extension queue 987. Compared 172120 event pairs, 8655 based on Foata normal form. 0/31124 useless extension candidates. Maximal degree in co-relation 65433. Up to 20183 conditions per place. [2023-11-19 07:59:13,556 INFO L140 encePairwiseOnDemand]: 283/292 looper letters, 47 selfloop transitions, 8 changer transitions 0/55 dead transitions. [2023-11-19 07:59:13,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 55 transitions, 238 flow [2023-11-19 07:59:13,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:59:13,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:59:13,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 431 transitions. [2023-11-19 07:59:13,560 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4920091324200913 [2023-11-19 07:59:13,560 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 431 transitions. [2023-11-19 07:59:13,561 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 431 transitions. [2023-11-19 07:59:13,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:59:13,561 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 431 transitions. [2023-11-19 07:59:13,563 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 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-19 07:59:13,566 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 292.0) internal successors, (1168), 4 states have internal predecessors, (1168), 0 states have call successors, (0), 0 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-19 07:59:13,568 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 292.0) internal successors, (1168), 4 states have internal predecessors, (1168), 0 states have call successors, (0), 0 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-19 07:59:13,568 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 72 flow. Second operand 3 states and 431 transitions. [2023-11-19 07:59:13,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 55 transitions, 238 flow [2023-11-19 07:59:13,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 55 transitions, 232 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:59:13,572 INFO L231 Difference]: Finished difference. Result has 44 places, 37 transitions, 130 flow [2023-11-19 07:59:13,572 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=292, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=44, PETRI_TRANSITIONS=37} [2023-11-19 07:59:13,574 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -9 predicate places. [2023-11-19 07:59:13,575 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 130 flow [2023-11-19 07:59:13,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 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-19 07:59:13,575 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:59:13,576 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:59:13,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:59:13,581 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:59:13,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:59:13,582 INFO L85 PathProgramCache]: Analyzing trace with hash -225028574, now seen corresponding path program 1 times [2023-11-19 07:59:13,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:59:13,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727126486] [2023-11-19 07:59:13,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:59:13,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:59:13,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:13,843 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-19 07:59:13,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:59:13,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727126486] [2023-11-19 07:59:13,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727126486] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:59:13,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:59:13,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:59:13,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504020133] [2023-11-19 07:59:13,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:59:13,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:59:13,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:59:13,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:59:13,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:59:13,852 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 292 [2023-11-19 07:59:13,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 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-19 07:59:13,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:59:13,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 292 [2023-11-19 07:59:13,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:59:16,971 INFO L124 PetriNetUnfolderBase]: 18255/25303 cut-off events. [2023-11-19 07:59:16,971 INFO L125 PetriNetUnfolderBase]: For 7585/7679 co-relation queries the response was YES. [2023-11-19 07:59:17,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59896 conditions, 25303 events. 18255/25303 cut-off events. For 7585/7679 co-relation queries the response was YES. Maximal size of possible extension queue 994. Compared 146468 event pairs, 5908 based on Foata normal form. 178/24921 useless extension candidates. Maximal degree in co-relation 59891. Up to 17227 conditions per place. [2023-11-19 07:59:17,137 INFO L140 encePairwiseOnDemand]: 289/292 looper letters, 43 selfloop transitions, 3 changer transitions 0/52 dead transitions. [2023-11-19 07:59:17,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 52 transitions, 264 flow [2023-11-19 07:59:17,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:59:17,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:59:17,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 440 transitions. [2023-11-19 07:59:17,141 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.502283105022831 [2023-11-19 07:59:17,141 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 440 transitions. [2023-11-19 07:59:17,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 440 transitions. [2023-11-19 07:59:17,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:59:17,142 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 440 transitions. [2023-11-19 07:59:17,144 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.66666666666666) internal successors, (440), 3 states have internal predecessors, (440), 0 states have call successors, (0), 0 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-19 07:59:17,147 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 292.0) internal successors, (1168), 4 states have internal predecessors, (1168), 0 states have call successors, (0), 0 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-19 07:59:17,148 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 292.0) internal successors, (1168), 4 states have internal predecessors, (1168), 0 states have call successors, (0), 0 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-19 07:59:17,148 INFO L175 Difference]: Start difference. First operand has 44 places, 37 transitions, 130 flow. Second operand 3 states and 440 transitions. [2023-11-19 07:59:17,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 52 transitions, 264 flow [2023-11-19 07:59:17,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 52 transitions, 244 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:59:17,255 INFO L231 Difference]: Finished difference. Result has 45 places, 37 transitions, 125 flow [2023-11-19 07:59:17,256 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=292, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=125, PETRI_PLACES=45, PETRI_TRANSITIONS=37} [2023-11-19 07:59:17,257 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -8 predicate places. [2023-11-19 07:59:17,258 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 37 transitions, 125 flow [2023-11-19 07:59:17,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 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-19 07:59:17,259 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:59:17,259 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:59:17,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:59:17,259 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:59:17,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:59:17,260 INFO L85 PathProgramCache]: Analyzing trace with hash -225024839, now seen corresponding path program 1 times [2023-11-19 07:59:17,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:59:17,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835377307] [2023-11-19 07:59:17,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:59:17,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:59:17,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:18,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-19 07:59:18,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:59:18,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835377307] [2023-11-19 07:59:18,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835377307] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:59:18,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:59:18,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:59:18,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086641701] [2023-11-19 07:59:18,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:59:18,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:59:18,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:59:18,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:59:18,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:59:18,864 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 292 [2023-11-19 07:59:18,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 37 transitions, 125 flow. Second operand has 7 states, 7 states have (on average 118.71428571428571) internal successors, (831), 7 states have internal predecessors, (831), 0 states have call successors, (0), 0 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-19 07:59:18,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:59:18,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 292 [2023-11-19 07:59:18,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:59:22,080 INFO L124 PetriNetUnfolderBase]: 18057/25406 cut-off events. [2023-11-19 07:59:22,080 INFO L125 PetriNetUnfolderBase]: For 5648/5650 co-relation queries the response was YES. [2023-11-19 07:59:22,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59186 conditions, 25406 events. 18057/25406 cut-off events. For 5648/5650 co-relation queries the response was YES. Maximal size of possible extension queue 1021. Compared 151973 event pairs, 3230 based on Foata normal form. 1030/25903 useless extension candidates. Maximal degree in co-relation 59180. Up to 16459 conditions per place. [2023-11-19 07:59:22,211 INFO L140 encePairwiseOnDemand]: 285/292 looper letters, 56 selfloop transitions, 6 changer transitions 19/87 dead transitions. [2023-11-19 07:59:22,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 87 transitions, 419 flow [2023-11-19 07:59:22,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:59:22,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-19 07:59:22,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 891 transitions. [2023-11-19 07:59:22,216 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43590998043052837 [2023-11-19 07:59:22,216 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 891 transitions. [2023-11-19 07:59:22,216 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 891 transitions. [2023-11-19 07:59:22,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:59:22,217 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 891 transitions. [2023-11-19 07:59:22,220 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 127.28571428571429) internal successors, (891), 7 states have internal predecessors, (891), 0 states have call successors, (0), 0 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-19 07:59:22,225 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 292.0) internal successors, (2336), 8 states have internal predecessors, (2336), 0 states have call successors, (0), 0 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-19 07:59:22,227 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 292.0) internal successors, (2336), 8 states have internal predecessors, (2336), 0 states have call successors, (0), 0 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-19 07:59:22,227 INFO L175 Difference]: Start difference. First operand has 45 places, 37 transitions, 125 flow. Second operand 7 states and 891 transitions. [2023-11-19 07:59:22,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 87 transitions, 419 flow [2023-11-19 07:59:22,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 87 transitions, 409 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:59:22,276 INFO L231 Difference]: Finished difference. Result has 51 places, 37 transitions, 140 flow [2023-11-19 07:59:22,276 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=292, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=140, PETRI_PLACES=51, PETRI_TRANSITIONS=37} [2023-11-19 07:59:22,277 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -2 predicate places. [2023-11-19 07:59:22,277 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 37 transitions, 140 flow [2023-11-19 07:59:22,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 118.71428571428571) internal successors, (831), 7 states have internal predecessors, (831), 0 states have call successors, (0), 0 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-19 07:59:22,278 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:59:22,278 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:59:22,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 07:59:22,279 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:59:22,279 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:59:22,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1530762104, now seen corresponding path program 1 times [2023-11-19 07:59:22,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:59:22,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411591821] [2023-11-19 07:59:22,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:59:22,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:59:22,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:22,440 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-19 07:59:22,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:59:22,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411591821] [2023-11-19 07:59:22,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411591821] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:59:22,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:59:22,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:59:22,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110730929] [2023-11-19 07:59:22,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:59:22,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:59:22,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:59:22,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:59:22,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:59:22,460 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 292 [2023-11-19 07:59:22,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 37 transitions, 140 flow. Second operand has 4 states, 4 states have (on average 128.25) internal successors, (513), 4 states have internal predecessors, (513), 0 states have call successors, (0), 0 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-19 07:59:22,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:59:22,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 292 [2023-11-19 07:59:22,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:59:25,744 INFO L124 PetriNetUnfolderBase]: 19110/25827 cut-off events. [2023-11-19 07:59:25,744 INFO L125 PetriNetUnfolderBase]: For 8080/8080 co-relation queries the response was YES. [2023-11-19 07:59:25,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64339 conditions, 25827 events. 19110/25827 cut-off events. For 8080/8080 co-relation queries the response was YES. Maximal size of possible extension queue 777. Compared 138028 event pairs, 3881 based on Foata normal form. 40/25867 useless extension candidates. Maximal degree in co-relation 64331. Up to 15819 conditions per place. [2023-11-19 07:59:25,884 INFO L140 encePairwiseOnDemand]: 283/292 looper letters, 70 selfloop transitions, 12 changer transitions 0/82 dead transitions. [2023-11-19 07:59:25,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 82 transitions, 452 flow [2023-11-19 07:59:25,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:59:25,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 07:59:25,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 578 transitions. [2023-11-19 07:59:25,889 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4948630136986301 [2023-11-19 07:59:25,889 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 578 transitions. [2023-11-19 07:59:25,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 578 transitions. [2023-11-19 07:59:25,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:59:25,890 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 578 transitions. [2023-11-19 07:59:25,893 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 144.5) internal successors, (578), 4 states have internal predecessors, (578), 0 states have call successors, (0), 0 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-19 07:59:25,899 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 292.0) internal successors, (1460), 5 states have internal predecessors, (1460), 0 states have call successors, (0), 0 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-19 07:59:25,900 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 292.0) internal successors, (1460), 5 states have internal predecessors, (1460), 0 states have call successors, (0), 0 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-19 07:59:25,900 INFO L175 Difference]: Start difference. First operand has 51 places, 37 transitions, 140 flow. Second operand 4 states and 578 transitions. [2023-11-19 07:59:25,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 82 transitions, 452 flow [2023-11-19 07:59:26,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 82 transitions, 420 flow, removed 3 selfloop flow, removed 6 redundant places. [2023-11-19 07:59:26,095 INFO L231 Difference]: Finished difference. Result has 50 places, 45 transitions, 224 flow [2023-11-19 07:59:26,096 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=292, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=224, PETRI_PLACES=50, PETRI_TRANSITIONS=45} [2023-11-19 07:59:26,096 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -3 predicate places. [2023-11-19 07:59:26,097 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 45 transitions, 224 flow [2023-11-19 07:59:26,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 128.25) internal successors, (513), 4 states have internal predecessors, (513), 0 states have call successors, (0), 0 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-19 07:59:26,097 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:59:26,098 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:59:26,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 07:59:26,098 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:59:26,099 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:59:26,099 INFO L85 PathProgramCache]: Analyzing trace with hash 209004481, now seen corresponding path program 1 times [2023-11-19 07:59:26,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:59:26,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185726345] [2023-11-19 07:59:26,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:59:26,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:59:26,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:26,281 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-19 07:59:26,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:59:26,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185726345] [2023-11-19 07:59:26,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185726345] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:59:26,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:59:26,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:59:26,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259322074] [2023-11-19 07:59:26,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:59:26,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:59:26,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:59:26,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:59:26,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:59:26,305 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 292 [2023-11-19 07:59:26,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 45 transitions, 224 flow. Second operand has 4 states, 4 states have (on average 128.25) internal successors, (513), 4 states have internal predecessors, (513), 0 states have call successors, (0), 0 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-19 07:59:26,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:59:26,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 292 [2023-11-19 07:59:26,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:59:28,865 INFO L124 PetriNetUnfolderBase]: 10976/16093 cut-off events. [2023-11-19 07:59:28,865 INFO L125 PetriNetUnfolderBase]: For 11389/12010 co-relation queries the response was YES. [2023-11-19 07:59:28,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40508 conditions, 16093 events. 10976/16093 cut-off events. For 11389/12010 co-relation queries the response was YES. Maximal size of possible extension queue 724. Compared 99822 event pairs, 2077 based on Foata normal form. 1184/16921 useless extension candidates. Maximal degree in co-relation 40499. Up to 11118 conditions per place. [2023-11-19 07:59:28,948 INFO L140 encePairwiseOnDemand]: 285/292 looper letters, 78 selfloop transitions, 10 changer transitions 2/102 dead transitions. [2023-11-19 07:59:28,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 102 transitions, 609 flow [2023-11-19 07:59:28,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:59:28,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 07:59:28,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 699 transitions. [2023-11-19 07:59:28,951 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47876712328767124 [2023-11-19 07:59:28,952 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 699 transitions. [2023-11-19 07:59:28,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 699 transitions. [2023-11-19 07:59:28,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:59:28,953 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 699 transitions. [2023-11-19 07:59:28,955 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 139.8) internal successors, (699), 5 states have internal predecessors, (699), 0 states have call successors, (0), 0 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-19 07:59:28,958 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 292.0) internal successors, (1752), 6 states have internal predecessors, (1752), 0 states have call successors, (0), 0 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-19 07:59:28,959 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 292.0) internal successors, (1752), 6 states have internal predecessors, (1752), 0 states have call successors, (0), 0 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-19 07:59:28,960 INFO L175 Difference]: Start difference. First operand has 50 places, 45 transitions, 224 flow. Second operand 5 states and 699 transitions. [2023-11-19 07:59:28,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 102 transitions, 609 flow [2023-11-19 07:59:29,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 102 transitions, 609 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 07:59:29,004 INFO L231 Difference]: Finished difference. Result has 57 places, 54 transitions, 299 flow [2023-11-19 07:59:29,004 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=292, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=299, PETRI_PLACES=57, PETRI_TRANSITIONS=54} [2023-11-19 07:59:29,005 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 4 predicate places. [2023-11-19 07:59:29,005 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 54 transitions, 299 flow [2023-11-19 07:59:29,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 128.25) internal successors, (513), 4 states have internal predecessors, (513), 0 states have call successors, (0), 0 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-19 07:59:29,006 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:59:29,006 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:59:29,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 07:59:29,007 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:59:29,007 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:59:29,007 INFO L85 PathProgramCache]: Analyzing trace with hash 817073992, now seen corresponding path program 1 times [2023-11-19 07:59:29,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:59:29,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887242529] [2023-11-19 07:59:29,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:59:29,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:59:29,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:29,345 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-19 07:59:29,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:59:29,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887242529] [2023-11-19 07:59:29,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887242529] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:59:29,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:59:29,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:59:29,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597884017] [2023-11-19 07:59:29,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:59:29,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:59:29,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:59:29,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:59:29,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:59:29,365 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 292 [2023-11-19 07:59:29,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 54 transitions, 299 flow. Second operand has 5 states, 5 states have (on average 128.2) internal successors, (641), 5 states have internal predecessors, (641), 0 states have call successors, (0), 0 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-19 07:59:29,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:59:29,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 292 [2023-11-19 07:59:29,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:59:30,901 INFO L124 PetriNetUnfolderBase]: 7323/11154 cut-off events. [2023-11-19 07:59:30,901 INFO L125 PetriNetUnfolderBase]: For 11574/11973 co-relation queries the response was YES. [2023-11-19 07:59:30,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34620 conditions, 11154 events. 7323/11154 cut-off events. For 11574/11973 co-relation queries the response was YES. Maximal size of possible extension queue 510. Compared 70136 event pairs, 958 based on Foata normal form. 768/11665 useless extension candidates. Maximal degree in co-relation 34607. Up to 3332 conditions per place. [2023-11-19 07:59:30,978 INFO L140 encePairwiseOnDemand]: 285/292 looper letters, 106 selfloop transitions, 19 changer transitions 1/138 dead transitions. [2023-11-19 07:59:30,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 138 transitions, 909 flow [2023-11-19 07:59:30,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:59:30,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-19 07:59:30,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 980 transitions. [2023-11-19 07:59:30,983 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4794520547945205 [2023-11-19 07:59:30,984 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 980 transitions. [2023-11-19 07:59:30,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 980 transitions. [2023-11-19 07:59:30,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:59:30,985 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 980 transitions. [2023-11-19 07:59:30,989 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 0 states have call successors, (0), 0 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-19 07:59:30,994 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 292.0) internal successors, (2336), 8 states have internal predecessors, (2336), 0 states have call successors, (0), 0 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-19 07:59:30,996 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 292.0) internal successors, (2336), 8 states have internal predecessors, (2336), 0 states have call successors, (0), 0 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-19 07:59:30,996 INFO L175 Difference]: Start difference. First operand has 57 places, 54 transitions, 299 flow. Second operand 7 states and 980 transitions. [2023-11-19 07:59:30,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 138 transitions, 909 flow [2023-11-19 07:59:31,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 138 transitions, 904 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 07:59:31,084 INFO L231 Difference]: Finished difference. Result has 65 places, 62 transitions, 422 flow [2023-11-19 07:59:31,084 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=292, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=422, PETRI_PLACES=65, PETRI_TRANSITIONS=62} [2023-11-19 07:59:31,088 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 12 predicate places. [2023-11-19 07:59:31,088 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 62 transitions, 422 flow [2023-11-19 07:59:31,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 128.2) internal successors, (641), 5 states have internal predecessors, (641), 0 states have call successors, (0), 0 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-19 07:59:31,089 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:59:31,089 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] [2023-11-19 07:59:31,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 07:59:31,090 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:59:31,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:59:31,090 INFO L85 PathProgramCache]: Analyzing trace with hash 204340367, now seen corresponding path program 1 times [2023-11-19 07:59:31,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:59:31,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932904185] [2023-11-19 07:59:31,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:59:31,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:59:31,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:31,486 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-19 07:59:31,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:59:31,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932904185] [2023-11-19 07:59:31,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932904185] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:59:31,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:59:31,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:59:31,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836765304] [2023-11-19 07:59:31,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:59:31,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:59:31,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:59:31,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:59:31,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:59:31,513 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 292 [2023-11-19 07:59:31,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 62 transitions, 422 flow. Second operand has 6 states, 6 states have (on average 128.0) internal successors, (768), 6 states have internal predecessors, (768), 0 states have call successors, (0), 0 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-19 07:59:31,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:59:31,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 292 [2023-11-19 07:59:31,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:59:33,343 INFO L124 PetriNetUnfolderBase]: 6290/9554 cut-off events. [2023-11-19 07:59:33,344 INFO L125 PetriNetUnfolderBase]: For 16351/16666 co-relation queries the response was YES. [2023-11-19 07:59:33,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34196 conditions, 9554 events. 6290/9554 cut-off events. For 16351/16666 co-relation queries the response was YES. Maximal size of possible extension queue 504. Compared 59679 event pairs, 727 based on Foata normal form. 311/9621 useless extension candidates. Maximal degree in co-relation 34180. Up to 3018 conditions per place. [2023-11-19 07:59:33,448 INFO L140 encePairwiseOnDemand]: 285/292 looper letters, 118 selfloop transitions, 28 changer transitions 11/169 dead transitions. [2023-11-19 07:59:33,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 169 transitions, 1221 flow [2023-11-19 07:59:33,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-19 07:59:33,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-19 07:59:33,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1259 transitions. [2023-11-19 07:59:33,454 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4790715372907154 [2023-11-19 07:59:33,455 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1259 transitions. [2023-11-19 07:59:33,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1259 transitions. [2023-11-19 07:59:33,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:59:33,456 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1259 transitions. [2023-11-19 07:59:33,461 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 139.88888888888889) internal successors, (1259), 9 states have internal predecessors, (1259), 0 states have call successors, (0), 0 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-19 07:59:33,467 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 292.0) internal successors, (2920), 10 states have internal predecessors, (2920), 0 states have call successors, (0), 0 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-19 07:59:33,468 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 292.0) internal successors, (2920), 10 states have internal predecessors, (2920), 0 states have call successors, (0), 0 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-19 07:59:33,468 INFO L175 Difference]: Start difference. First operand has 65 places, 62 transitions, 422 flow. Second operand 9 states and 1259 transitions. [2023-11-19 07:59:33,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 169 transitions, 1221 flow [2023-11-19 07:59:34,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 169 transitions, 1141 flow, removed 17 selfloop flow, removed 4 redundant places. [2023-11-19 07:59:34,377 INFO L231 Difference]: Finished difference. Result has 72 places, 70 transitions, 532 flow [2023-11-19 07:59:34,378 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=292, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=532, PETRI_PLACES=72, PETRI_TRANSITIONS=70} [2023-11-19 07:59:34,378 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 19 predicate places. [2023-11-19 07:59:34,379 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 70 transitions, 532 flow [2023-11-19 07:59:34,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 128.0) internal successors, (768), 6 states have internal predecessors, (768), 0 states have call successors, (0), 0 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-19 07:59:34,379 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:59:34,380 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] [2023-11-19 07:59:34,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 07:59:34,380 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:59:34,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:59:34,381 INFO L85 PathProgramCache]: Analyzing trace with hash 901439543, now seen corresponding path program 1 times [2023-11-19 07:59:34,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:59:34,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306230438] [2023-11-19 07:59:34,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:59:34,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:59:34,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:35,469 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-19 07:59:35,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:59:35,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306230438] [2023-11-19 07:59:35,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306230438] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:59:35,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:59:35,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:59:35,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116470394] [2023-11-19 07:59:35,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:59:35,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:59:35,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:59:35,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:59:35,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:59:35,523 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 292 [2023-11-19 07:59:35,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 70 transitions, 532 flow. Second operand has 7 states, 7 states have (on average 133.0) internal successors, (931), 7 states have internal predecessors, (931), 0 states have call successors, (0), 0 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-19 07:59:35,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:59:35,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 292 [2023-11-19 07:59:35,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:59:37,364 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([470] L826-->L842: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_56 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_58 256) 0))) (let ((.cse8 (not .cse4)) (.cse12 (= (mod v_~a$w_buff0_used~0_140 256) 0)) (.cse9 (and .cse4 (= (mod v_~a$w_buff1_used~0_131 256) 0))) (.cse6 (and .cse4 .cse11))) (let ((.cse2 (or .cse12 .cse9 .cse6)) (.cse3 (and .cse8 (not .cse12)))) (let ((.cse1 (ite .cse2 v_~a~0_92 (ite .cse3 v_~a$w_buff0~0_51 v_~a$w_buff1~0_48))) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse5 (= (mod v_~a$w_buff1_used~0_130 256) 0)) (.cse7 (= (mod v_~a$w_buff0_used~0_139 256) 0))) (and (= v_~a~0_90 (ite .cse0 v_~a$mem_tmp~0_24 .cse1)) (= v_~a$w_buff0_used~0_139 (ite .cse0 v_~a$w_buff0_used~0_140 (ite .cse2 v_~a$w_buff0_used~0_140 (ite .cse3 0 v_~a$w_buff0_used~0_140)))) (= v_~a$w_buff1~0_48 v_~a$w_buff1~0_47) (= v_~a$r_buff0_thd4~0_57 (ite .cse0 v_~a$r_buff0_thd4~0_58 (ite (or (and .cse4 .cse5) .cse6 .cse7) v_~a$r_buff0_thd4~0_58 (ite (and (not .cse7) .cse8) 0 v_~a$r_buff0_thd4~0_58)))) (= v_~a~0_92 v_~a$mem_tmp~0_24) (= v_~a$w_buff1_used~0_130 (ite .cse0 v_~a$w_buff1_used~0_131 (ite (or .cse9 .cse6 .cse7) v_~a$w_buff1_used~0_131 0))) (= v_~a$w_buff0~0_51 v_~a$w_buff0~0_50) (= .cse1 v_~__unbuffered_p3_EBX~0_14) (= v_~a$flush_delayed~0_35 0) (= (ite .cse0 v_~a$r_buff1_thd4~0_56 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_57 256) 0))) (or (and .cse10 .cse5) (and .cse10 .cse11) .cse7)) v_~a$r_buff1_thd4~0_56 0)) v_~a$r_buff1_thd4~0_55)))))) InVars {~a~0=v_~a~0_92, ~a$w_buff1~0=v_~a$w_buff1~0_48, ~a$w_buff0~0=v_~a$w_buff0~0_51, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_140, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_131, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_58} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_55, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_139, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_57, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_90, ~a$mem_tmp~0=v_~a$mem_tmp~0_24, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~a$w_buff1~0=v_~a$w_buff1~0_47, ~a$flush_delayed~0=v_~a$flush_delayed~0_35, ~a$w_buff0~0=v_~a$w_buff0~0_50, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_130, ~weak$$choice2~0=v_~weak$$choice2~0_34, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][85], [114#L806true, 247#(and (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd2~0 0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~a~0 0)) (= ~a~0 ~a$w_buff0~0)), Black: 194#(= ~x~0 0), Black: 195#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 164#true, 213#(<= ~__unbuffered_cnt~0 1), 131#P0EXITtrue, 192#true, Black: 205#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 202#(= ~__unbuffered_cnt~0 0), Black: 203#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), 61#L842true, 39#L873-3true, Black: 214#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), P2Thread1of1ForFork0InUse, 226#(<= ~__unbuffered_cnt~0 1), Black: 218#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), P0Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, Black: 227#(<= ~__unbuffered_cnt~0 2), Black: 234#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 228#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), Black: 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 40#L793true, Black: 179#(= ~__unbuffered_p3_EAX~0 0), Black: 187#(and (not (= |ULTIMATE.start_main_~#t468~0#1.base| |ULTIMATE.start_main_~#t465~0#1.base|)) (not (= |ULTIMATE.start_main_~#t467~0#1.base| |ULTIMATE.start_main_~#t465~0#1.base|)) (not (= |ULTIMATE.start_main_~#t466~0#1.base| |ULTIMATE.start_main_~#t465~0#1.base|)) (not (= |ULTIMATE.start_main_~#t468~0#1.base| |ULTIMATE.start_main_~#t466~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t465~0#1.base| 0) |ULTIMATE.start_main_~#t467~0#1.base| 0) |ULTIMATE.start_main_~#t468~0#1.base| 0) |ULTIMATE.start_main_~#t466~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t467~0#1.base| |ULTIMATE.start_main_~#t466~0#1.base|)) (not (= |ULTIMATE.start_main_~#t468~0#1.base| |ULTIMATE.start_main_~#t467~0#1.base|)))]) [2023-11-19 07:59:37,364 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is not cut-off event [2023-11-19 07:59:37,364 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-11-19 07:59:37,364 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-11-19 07:59:37,365 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-11-19 07:59:37,671 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([470] L826-->L842: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_56 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_58 256) 0))) (let ((.cse8 (not .cse4)) (.cse12 (= (mod v_~a$w_buff0_used~0_140 256) 0)) (.cse9 (and .cse4 (= (mod v_~a$w_buff1_used~0_131 256) 0))) (.cse6 (and .cse4 .cse11))) (let ((.cse2 (or .cse12 .cse9 .cse6)) (.cse3 (and .cse8 (not .cse12)))) (let ((.cse1 (ite .cse2 v_~a~0_92 (ite .cse3 v_~a$w_buff0~0_51 v_~a$w_buff1~0_48))) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse5 (= (mod v_~a$w_buff1_used~0_130 256) 0)) (.cse7 (= (mod v_~a$w_buff0_used~0_139 256) 0))) (and (= v_~a~0_90 (ite .cse0 v_~a$mem_tmp~0_24 .cse1)) (= v_~a$w_buff0_used~0_139 (ite .cse0 v_~a$w_buff0_used~0_140 (ite .cse2 v_~a$w_buff0_used~0_140 (ite .cse3 0 v_~a$w_buff0_used~0_140)))) (= v_~a$w_buff1~0_48 v_~a$w_buff1~0_47) (= v_~a$r_buff0_thd4~0_57 (ite .cse0 v_~a$r_buff0_thd4~0_58 (ite (or (and .cse4 .cse5) .cse6 .cse7) v_~a$r_buff0_thd4~0_58 (ite (and (not .cse7) .cse8) 0 v_~a$r_buff0_thd4~0_58)))) (= v_~a~0_92 v_~a$mem_tmp~0_24) (= v_~a$w_buff1_used~0_130 (ite .cse0 v_~a$w_buff1_used~0_131 (ite (or .cse9 .cse6 .cse7) v_~a$w_buff1_used~0_131 0))) (= v_~a$w_buff0~0_51 v_~a$w_buff0~0_50) (= .cse1 v_~__unbuffered_p3_EBX~0_14) (= v_~a$flush_delayed~0_35 0) (= (ite .cse0 v_~a$r_buff1_thd4~0_56 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_57 256) 0))) (or (and .cse10 .cse5) (and .cse10 .cse11) .cse7)) v_~a$r_buff1_thd4~0_56 0)) v_~a$r_buff1_thd4~0_55)))))) InVars {~a~0=v_~a~0_92, ~a$w_buff1~0=v_~a$w_buff1~0_48, ~a$w_buff0~0=v_~a$w_buff0~0_51, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_140, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_131, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_58} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_55, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_139, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_57, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_90, ~a$mem_tmp~0=v_~a$mem_tmp~0_24, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~a$w_buff1~0=v_~a$w_buff1~0_47, ~a$flush_delayed~0=v_~a$flush_delayed~0_35, ~a$w_buff0~0=v_~a$w_buff0~0_50, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_130, ~weak$$choice2~0=v_~weak$$choice2~0_34, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][85], [114#L806true, 247#(and (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd2~0 0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~a~0 0)) (= ~a~0 ~a$w_buff0~0)), Black: 194#(= ~x~0 0), Black: 195#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 164#true, 131#P0EXITtrue, 192#true, Black: 205#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 202#(= ~__unbuffered_cnt~0 0), Black: 203#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), 61#L842true, 39#L873-3true, Black: 214#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), P2Thread1of1ForFork0InUse, Black: 213#(<= ~__unbuffered_cnt~0 1), Black: 218#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), P0Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, 117#P1EXITtrue, Black: 234#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 228#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), Black: 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 227#(<= ~__unbuffered_cnt~0 2), Black: 179#(= ~__unbuffered_p3_EAX~0 0), Black: 187#(and (not (= |ULTIMATE.start_main_~#t468~0#1.base| |ULTIMATE.start_main_~#t465~0#1.base|)) (not (= |ULTIMATE.start_main_~#t467~0#1.base| |ULTIMATE.start_main_~#t465~0#1.base|)) (not (= |ULTIMATE.start_main_~#t466~0#1.base| |ULTIMATE.start_main_~#t465~0#1.base|)) (not (= |ULTIMATE.start_main_~#t468~0#1.base| |ULTIMATE.start_main_~#t466~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t465~0#1.base| 0) |ULTIMATE.start_main_~#t467~0#1.base| 0) |ULTIMATE.start_main_~#t468~0#1.base| 0) |ULTIMATE.start_main_~#t466~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t467~0#1.base| |ULTIMATE.start_main_~#t466~0#1.base|)) (not (= |ULTIMATE.start_main_~#t468~0#1.base| |ULTIMATE.start_main_~#t467~0#1.base|)))]) [2023-11-19 07:59:37,671 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is not cut-off event [2023-11-19 07:59:37,671 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2023-11-19 07:59:37,671 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2023-11-19 07:59:37,671 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2023-11-19 07:59:37,672 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([470] L826-->L842: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_56 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_58 256) 0))) (let ((.cse8 (not .cse4)) (.cse12 (= (mod v_~a$w_buff0_used~0_140 256) 0)) (.cse9 (and .cse4 (= (mod v_~a$w_buff1_used~0_131 256) 0))) (.cse6 (and .cse4 .cse11))) (let ((.cse2 (or .cse12 .cse9 .cse6)) (.cse3 (and .cse8 (not .cse12)))) (let ((.cse1 (ite .cse2 v_~a~0_92 (ite .cse3 v_~a$w_buff0~0_51 v_~a$w_buff1~0_48))) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse5 (= (mod v_~a$w_buff1_used~0_130 256) 0)) (.cse7 (= (mod v_~a$w_buff0_used~0_139 256) 0))) (and (= v_~a~0_90 (ite .cse0 v_~a$mem_tmp~0_24 .cse1)) (= v_~a$w_buff0_used~0_139 (ite .cse0 v_~a$w_buff0_used~0_140 (ite .cse2 v_~a$w_buff0_used~0_140 (ite .cse3 0 v_~a$w_buff0_used~0_140)))) (= v_~a$w_buff1~0_48 v_~a$w_buff1~0_47) (= v_~a$r_buff0_thd4~0_57 (ite .cse0 v_~a$r_buff0_thd4~0_58 (ite (or (and .cse4 .cse5) .cse6 .cse7) v_~a$r_buff0_thd4~0_58 (ite (and (not .cse7) .cse8) 0 v_~a$r_buff0_thd4~0_58)))) (= v_~a~0_92 v_~a$mem_tmp~0_24) (= v_~a$w_buff1_used~0_130 (ite .cse0 v_~a$w_buff1_used~0_131 (ite (or .cse9 .cse6 .cse7) v_~a$w_buff1_used~0_131 0))) (= v_~a$w_buff0~0_51 v_~a$w_buff0~0_50) (= .cse1 v_~__unbuffered_p3_EBX~0_14) (= v_~a$flush_delayed~0_35 0) (= (ite .cse0 v_~a$r_buff1_thd4~0_56 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_57 256) 0))) (or (and .cse10 .cse5) (and .cse10 .cse11) .cse7)) v_~a$r_buff1_thd4~0_56 0)) v_~a$r_buff1_thd4~0_55)))))) InVars {~a~0=v_~a~0_92, ~a$w_buff1~0=v_~a$w_buff1~0_48, ~a$w_buff0~0=v_~a$w_buff0~0_51, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_140, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_131, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_58} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_55, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_139, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_57, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_90, ~a$mem_tmp~0=v_~a$mem_tmp~0_24, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~a$w_buff1~0=v_~a$w_buff1~0_47, ~a$flush_delayed~0=v_~a$flush_delayed~0_35, ~a$w_buff0~0=v_~a$w_buff0~0_50, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_130, ~weak$$choice2~0=v_~weak$$choice2~0_34, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][85], [114#L806true, 247#(and (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd2~0 0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~a~0 0)) (= ~a~0 ~a$w_buff0~0)), Black: 194#(= ~x~0 0), Black: 195#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 164#true, 131#P0EXITtrue, 192#true, 218#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 205#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 202#(= ~__unbuffered_cnt~0 0), Black: 203#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), 61#L842true, Black: 214#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), P2Thread1of1ForFork0InUse, Black: 213#(<= ~__unbuffered_cnt~0 1), P0Thread1of1ForFork3InUse, 232#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), P3Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, 71#L3true, Black: 227#(<= ~__unbuffered_cnt~0 2), Black: 234#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 228#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), Black: 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 40#L793true, Black: 179#(= ~__unbuffered_p3_EAX~0 0), Black: 187#(and (not (= |ULTIMATE.start_main_~#t468~0#1.base| |ULTIMATE.start_main_~#t465~0#1.base|)) (not (= |ULTIMATE.start_main_~#t467~0#1.base| |ULTIMATE.start_main_~#t465~0#1.base|)) (not (= |ULTIMATE.start_main_~#t466~0#1.base| |ULTIMATE.start_main_~#t465~0#1.base|)) (not (= |ULTIMATE.start_main_~#t468~0#1.base| |ULTIMATE.start_main_~#t466~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t465~0#1.base| 0) |ULTIMATE.start_main_~#t467~0#1.base| 0) |ULTIMATE.start_main_~#t468~0#1.base| 0) |ULTIMATE.start_main_~#t466~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t467~0#1.base| |ULTIMATE.start_main_~#t466~0#1.base|)) (not (= |ULTIMATE.start_main_~#t468~0#1.base| |ULTIMATE.start_main_~#t467~0#1.base|)))]) [2023-11-19 07:59:37,672 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is not cut-off event [2023-11-19 07:59:37,672 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2023-11-19 07:59:37,673 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2023-11-19 07:59:37,673 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2023-11-19 07:59:37,937 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([470] L826-->L842: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_56 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_58 256) 0))) (let ((.cse8 (not .cse4)) (.cse12 (= (mod v_~a$w_buff0_used~0_140 256) 0)) (.cse9 (and .cse4 (= (mod v_~a$w_buff1_used~0_131 256) 0))) (.cse6 (and .cse4 .cse11))) (let ((.cse2 (or .cse12 .cse9 .cse6)) (.cse3 (and .cse8 (not .cse12)))) (let ((.cse1 (ite .cse2 v_~a~0_92 (ite .cse3 v_~a$w_buff0~0_51 v_~a$w_buff1~0_48))) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse5 (= (mod v_~a$w_buff1_used~0_130 256) 0)) (.cse7 (= (mod v_~a$w_buff0_used~0_139 256) 0))) (and (= v_~a~0_90 (ite .cse0 v_~a$mem_tmp~0_24 .cse1)) (= v_~a$w_buff0_used~0_139 (ite .cse0 v_~a$w_buff0_used~0_140 (ite .cse2 v_~a$w_buff0_used~0_140 (ite .cse3 0 v_~a$w_buff0_used~0_140)))) (= v_~a$w_buff1~0_48 v_~a$w_buff1~0_47) (= v_~a$r_buff0_thd4~0_57 (ite .cse0 v_~a$r_buff0_thd4~0_58 (ite (or (and .cse4 .cse5) .cse6 .cse7) v_~a$r_buff0_thd4~0_58 (ite (and (not .cse7) .cse8) 0 v_~a$r_buff0_thd4~0_58)))) (= v_~a~0_92 v_~a$mem_tmp~0_24) (= v_~a$w_buff1_used~0_130 (ite .cse0 v_~a$w_buff1_used~0_131 (ite (or .cse9 .cse6 .cse7) v_~a$w_buff1_used~0_131 0))) (= v_~a$w_buff0~0_51 v_~a$w_buff0~0_50) (= .cse1 v_~__unbuffered_p3_EBX~0_14) (= v_~a$flush_delayed~0_35 0) (= (ite .cse0 v_~a$r_buff1_thd4~0_56 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_57 256) 0))) (or (and .cse10 .cse5) (and .cse10 .cse11) .cse7)) v_~a$r_buff1_thd4~0_56 0)) v_~a$r_buff1_thd4~0_55)))))) InVars {~a~0=v_~a~0_92, ~a$w_buff1~0=v_~a$w_buff1~0_48, ~a$w_buff0~0=v_~a$w_buff0~0_51, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_140, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_131, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_58} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_55, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_139, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_57, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_90, ~a$mem_tmp~0=v_~a$mem_tmp~0_24, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~a$w_buff1~0=v_~a$w_buff1~0_47, ~a$flush_delayed~0=v_~a$flush_delayed~0_35, ~a$w_buff0~0=v_~a$w_buff0~0_50, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_130, ~weak$$choice2~0=v_~weak$$choice2~0_34, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][85], [114#L806true, 247#(and (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd2~0 0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~a~0 0)) (= ~a~0 ~a$w_buff0~0)), Black: 194#(= ~x~0 0), Black: 195#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 164#true, 131#P0EXITtrue, 192#true, Black: 205#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 202#(= ~__unbuffered_cnt~0 0), Black: 203#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), 61#L842true, Black: 214#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), P2Thread1of1ForFork0InUse, Black: 213#(<= ~__unbuffered_cnt~0 1), Black: 218#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), P0Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, 234#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), 71#L3true, 117#P1EXITtrue, Black: 227#(<= ~__unbuffered_cnt~0 2), Black: 228#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), Black: 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 179#(= ~__unbuffered_p3_EAX~0 0), Black: 187#(and (not (= |ULTIMATE.start_main_~#t468~0#1.base| |ULTIMATE.start_main_~#t465~0#1.base|)) (not (= |ULTIMATE.start_main_~#t467~0#1.base| |ULTIMATE.start_main_~#t465~0#1.base|)) (not (= |ULTIMATE.start_main_~#t466~0#1.base| |ULTIMATE.start_main_~#t465~0#1.base|)) (not (= |ULTIMATE.start_main_~#t468~0#1.base| |ULTIMATE.start_main_~#t466~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t465~0#1.base| 0) |ULTIMATE.start_main_~#t467~0#1.base| 0) |ULTIMATE.start_main_~#t468~0#1.base| 0) |ULTIMATE.start_main_~#t466~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t467~0#1.base| |ULTIMATE.start_main_~#t466~0#1.base|)) (not (= |ULTIMATE.start_main_~#t468~0#1.base| |ULTIMATE.start_main_~#t467~0#1.base|)))]) [2023-11-19 07:59:37,937 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is not cut-off event [2023-11-19 07:59:37,937 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2023-11-19 07:59:37,937 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2023-11-19 07:59:37,937 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2023-11-19 07:59:37,939 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([470] L826-->L842: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_56 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_58 256) 0))) (let ((.cse8 (not .cse4)) (.cse12 (= (mod v_~a$w_buff0_used~0_140 256) 0)) (.cse9 (and .cse4 (= (mod v_~a$w_buff1_used~0_131 256) 0))) (.cse6 (and .cse4 .cse11))) (let ((.cse2 (or .cse12 .cse9 .cse6)) (.cse3 (and .cse8 (not .cse12)))) (let ((.cse1 (ite .cse2 v_~a~0_92 (ite .cse3 v_~a$w_buff0~0_51 v_~a$w_buff1~0_48))) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse5 (= (mod v_~a$w_buff1_used~0_130 256) 0)) (.cse7 (= (mod v_~a$w_buff0_used~0_139 256) 0))) (and (= v_~a~0_90 (ite .cse0 v_~a$mem_tmp~0_24 .cse1)) (= v_~a$w_buff0_used~0_139 (ite .cse0 v_~a$w_buff0_used~0_140 (ite .cse2 v_~a$w_buff0_used~0_140 (ite .cse3 0 v_~a$w_buff0_used~0_140)))) (= v_~a$w_buff1~0_48 v_~a$w_buff1~0_47) (= v_~a$r_buff0_thd4~0_57 (ite .cse0 v_~a$r_buff0_thd4~0_58 (ite (or (and .cse4 .cse5) .cse6 .cse7) v_~a$r_buff0_thd4~0_58 (ite (and (not .cse7) .cse8) 0 v_~a$r_buff0_thd4~0_58)))) (= v_~a~0_92 v_~a$mem_tmp~0_24) (= v_~a$w_buff1_used~0_130 (ite .cse0 v_~a$w_buff1_used~0_131 (ite (or .cse9 .cse6 .cse7) v_~a$w_buff1_used~0_131 0))) (= v_~a$w_buff0~0_51 v_~a$w_buff0~0_50) (= .cse1 v_~__unbuffered_p3_EBX~0_14) (= v_~a$flush_delayed~0_35 0) (= (ite .cse0 v_~a$r_buff1_thd4~0_56 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_57 256) 0))) (or (and .cse10 .cse5) (and .cse10 .cse11) .cse7)) v_~a$r_buff1_thd4~0_56 0)) v_~a$r_buff1_thd4~0_55)))))) InVars {~a~0=v_~a~0_92, ~a$w_buff1~0=v_~a$w_buff1~0_48, ~a$w_buff0~0=v_~a$w_buff0~0_51, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_140, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_131, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_58} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_55, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_139, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_57, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_90, ~a$mem_tmp~0=v_~a$mem_tmp~0_24, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~a$w_buff1~0=v_~a$w_buff1~0_47, ~a$flush_delayed~0=v_~a$flush_delayed~0_35, ~a$w_buff0~0=v_~a$w_buff0~0_50, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_130, ~weak$$choice2~0=v_~weak$$choice2~0_34, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][85], [114#L806true, 247#(and (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd2~0 0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~a~0 0)) (= ~a~0 ~a$w_buff0~0)), Black: 194#(= ~x~0 0), Black: 195#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 164#true, 131#P0EXITtrue, 192#true, Black: 205#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), 214#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), Black: 202#(= ~__unbuffered_cnt~0 0), Black: 203#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), 61#L842true, P2Thread1of1ForFork0InUse, Black: 213#(<= ~__unbuffered_cnt~0 1), P0Thread1of1ForFork3InUse, Black: 218#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), P3Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, 234#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), 117#P1EXITtrue, 71#L3true, Black: 227#(<= ~__unbuffered_cnt~0 2), Black: 228#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), Black: 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 179#(= ~__unbuffered_p3_EAX~0 0), Black: 187#(and (not (= |ULTIMATE.start_main_~#t468~0#1.base| |ULTIMATE.start_main_~#t465~0#1.base|)) (not (= |ULTIMATE.start_main_~#t467~0#1.base| |ULTIMATE.start_main_~#t465~0#1.base|)) (not (= |ULTIMATE.start_main_~#t466~0#1.base| |ULTIMATE.start_main_~#t465~0#1.base|)) (not (= |ULTIMATE.start_main_~#t468~0#1.base| |ULTIMATE.start_main_~#t466~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t465~0#1.base| 0) |ULTIMATE.start_main_~#t467~0#1.base| 0) |ULTIMATE.start_main_~#t468~0#1.base| 0) |ULTIMATE.start_main_~#t466~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t467~0#1.base| |ULTIMATE.start_main_~#t466~0#1.base|)) (not (= |ULTIMATE.start_main_~#t468~0#1.base| |ULTIMATE.start_main_~#t467~0#1.base|)))]) [2023-11-19 07:59:37,939 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is not cut-off event [2023-11-19 07:59:37,939 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2023-11-19 07:59:37,940 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2023-11-19 07:59:37,940 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2023-11-19 07:59:38,510 INFO L124 PetriNetUnfolderBase]: 11199/17626 cut-off events. [2023-11-19 07:59:38,510 INFO L125 PetriNetUnfolderBase]: For 44925/45497 co-relation queries the response was YES. [2023-11-19 07:59:38,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66085 conditions, 17626 events. 11199/17626 cut-off events. For 44925/45497 co-relation queries the response was YES. Maximal size of possible extension queue 972. Compared 126527 event pairs, 1228 based on Foata normal form. 191/17507 useless extension candidates. Maximal degree in co-relation 66066. Up to 7909 conditions per place. [2023-11-19 07:59:38,657 INFO L140 encePairwiseOnDemand]: 283/292 looper letters, 236 selfloop transitions, 15 changer transitions 18/281 dead transitions. [2023-11-19 07:59:38,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 281 transitions, 2806 flow [2023-11-19 07:59:38,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:59:38,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-19 07:59:38,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1023 transitions. [2023-11-19 07:59:38,662 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5004892367906066 [2023-11-19 07:59:38,662 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1023 transitions. [2023-11-19 07:59:38,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1023 transitions. [2023-11-19 07:59:38,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:59:38,664 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1023 transitions. [2023-11-19 07:59:38,667 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 146.14285714285714) internal successors, (1023), 7 states have internal predecessors, (1023), 0 states have call successors, (0), 0 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-19 07:59:38,672 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 292.0) internal successors, (2336), 8 states have internal predecessors, (2336), 0 states have call successors, (0), 0 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-19 07:59:38,673 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 292.0) internal successors, (2336), 8 states have internal predecessors, (2336), 0 states have call successors, (0), 0 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-19 07:59:38,673 INFO L175 Difference]: Start difference. First operand has 72 places, 70 transitions, 532 flow. Second operand 7 states and 1023 transitions. [2023-11-19 07:59:38,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 281 transitions, 2806 flow