./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix001.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_747f0cbf-672f-4579-b731-985cc1384ef3/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_747f0cbf-672f-4579-b731-985cc1384ef3/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_747f0cbf-672f-4579-b731-985cc1384ef3/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_747f0cbf-672f-4579-b731-985cc1384ef3/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix001.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_747f0cbf-672f-4579-b731-985cc1384ef3/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_747f0cbf-672f-4579-b731-985cc1384ef3/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 54b7204af3591799bdde98d626e5c17b99e9c1ebc668ecbb3e0b1bb3bb8aa3c2 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 08:06:24,035 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 08:06:24,100 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_747f0cbf-672f-4579-b731-985cc1384ef3/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-19 08:06:24,105 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 08:06:24,106 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 08:06:24,132 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 08:06:24,133 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 08:06:24,133 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 08:06:24,134 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 08:06:24,135 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 08:06:24,136 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 08:06:24,136 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 08:06:24,137 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 08:06:24,137 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 08:06:24,138 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 08:06:24,138 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 08:06:24,139 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 08:06:24,139 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 08:06:24,140 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-19 08:06:24,141 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-19 08:06:24,141 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-19 08:06:24,142 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 08:06:24,142 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-19 08:06:24,143 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 08:06:24,143 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 08:06:24,143 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 08:06:24,144 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 08:06:24,144 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 08:06:24,145 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 08:06:24,145 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 08:06:24,146 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 08:06:24,146 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 08:06:24,146 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 08:06:24,147 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 08:06:24,147 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 08:06:24,147 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 08:06:24,148 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 08:06:24,148 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 08:06:24,148 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_747f0cbf-672f-4579-b731-985cc1384ef3/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_747f0cbf-672f-4579-b731-985cc1384ef3/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 -> 54b7204af3591799bdde98d626e5c17b99e9c1ebc668ecbb3e0b1bb3bb8aa3c2 [2023-11-19 08:06:24,444 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 08:06:24,475 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 08:06:24,478 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 08:06:24,479 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 08:06:24,480 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 08:06:24,481 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_747f0cbf-672f-4579-b731-985cc1384ef3/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/pthread-wmm/mix001.oepc.i [2023-11-19 08:06:27,582 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 08:06:27,934 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 08:06:27,935 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_747f0cbf-672f-4579-b731-985cc1384ef3/sv-benchmarks/c/pthread-wmm/mix001.oepc.i [2023-11-19 08:06:27,956 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_747f0cbf-672f-4579-b731-985cc1384ef3/bin/uautomizer-verify-uCwYo4JHxu/data/60fe8924d/39bcb8783ca4461393befbacbd104f66/FLAGd5b9b9d79 [2023-11-19 08:06:27,974 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_747f0cbf-672f-4579-b731-985cc1384ef3/bin/uautomizer-verify-uCwYo4JHxu/data/60fe8924d/39bcb8783ca4461393befbacbd104f66 [2023-11-19 08:06:27,977 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 08:06:27,979 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 08:06:27,981 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 08:06:27,981 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 08:06:27,988 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 08:06:27,989 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:06:27" (1/1) ... [2023-11-19 08:06:27,991 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5832b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:06:27, skipping insertion in model container [2023-11-19 08:06:27,991 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:06:27" (1/1) ... [2023-11-19 08:06:28,046 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 08:06:28,553 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 08:06:28,567 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 08:06:28,639 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 08:06:28,682 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 08:06:28,682 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 08:06:28,691 INFO L206 MainTranslator]: Completed translation [2023-11-19 08:06:28,692 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:06:28 WrapperNode [2023-11-19 08:06:28,692 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 08:06:28,693 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 08:06:28,693 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 08:06:28,694 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 08:06:28,702 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:06:28" (1/1) ... [2023-11-19 08:06:28,721 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:06:28" (1/1) ... [2023-11-19 08:06:28,753 INFO L138 Inliner]: procedures = 176, calls = 61, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 157 [2023-11-19 08:06:28,754 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 08:06:28,754 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 08:06:28,755 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 08:06:28,755 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 08:06:28,765 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:06:28" (1/1) ... [2023-11-19 08:06:28,765 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:06:28" (1/1) ... [2023-11-19 08:06:28,769 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:06:28" (1/1) ... [2023-11-19 08:06:28,770 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:06:28" (1/1) ... [2023-11-19 08:06:28,780 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:06:28" (1/1) ... [2023-11-19 08:06:28,783 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:06:28" (1/1) ... [2023-11-19 08:06:28,786 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:06:28" (1/1) ... [2023-11-19 08:06:28,788 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:06:28" (1/1) ... [2023-11-19 08:06:28,793 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 08:06:28,801 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 08:06:28,801 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 08:06:28,802 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 08:06:28,803 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:06:28" (1/1) ... [2023-11-19 08:06:28,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 08:06:28,824 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_747f0cbf-672f-4579-b731-985cc1384ef3/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:06:28,839 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_747f0cbf-672f-4579-b731-985cc1384ef3/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 08:06:28,865 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_747f0cbf-672f-4579-b731-985cc1384ef3/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 08:06:28,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 08:06:28,935 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-19 08:06:28,936 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 08:06:28,937 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 08:06:28,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 08:06:28,937 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-19 08:06:28,938 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-19 08:06:28,938 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-19 08:06:28,938 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-19 08:06:28,938 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-19 08:06:28,939 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-19 08:06:28,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 08:06:28,939 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-19 08:06:28,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 08:06:28,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 08:06:28,943 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 08:06:29,155 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 08:06:29,158 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 08:06:29,580 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 08:06:29,890 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 08:06:29,890 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 08:06:29,897 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:06:29 BoogieIcfgContainer [2023-11-19 08:06:29,898 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 08:06:29,902 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 08:06:29,903 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 08:06:29,907 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 08:06:29,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:06:27" (1/3) ... [2023-11-19 08:06:29,908 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1907e122 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:06:29, skipping insertion in model container [2023-11-19 08:06:29,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:06:28" (2/3) ... [2023-11-19 08:06:29,910 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1907e122 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:06:29, skipping insertion in model container [2023-11-19 08:06:29,910 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:06:29" (3/3) ... [2023-11-19 08:06:29,912 INFO L112 eAbstractionObserver]: Analyzing ICFG mix001.oepc.i [2023-11-19 08:06:29,933 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 08:06:29,934 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-19 08:06:29,934 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 08:06:30,022 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 08:06:30,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 134 transitions, 280 flow [2023-11-19 08:06:30,212 INFO L124 PetriNetUnfolderBase]: 4/131 cut-off events. [2023-11-19 08:06:30,212 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:06:30,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 131 events. 4/131 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 104 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2023-11-19 08:06:30,221 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 134 transitions, 280 flow [2023-11-19 08:06:30,234 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 131 transitions, 271 flow [2023-11-19 08:06:30,238 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 08:06:30,256 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 131 transitions, 271 flow [2023-11-19 08:06:30,261 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 131 transitions, 271 flow [2023-11-19 08:06:30,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 131 transitions, 271 flow [2023-11-19 08:06:30,336 INFO L124 PetriNetUnfolderBase]: 4/131 cut-off events. [2023-11-19 08:06:30,336 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:06:30,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 131 events. 4/131 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 104 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2023-11-19 08:06:30,341 INFO L119 LiptonReduction]: Number of co-enabled transitions 3084 [2023-11-19 08:06:35,804 INFO L134 LiptonReduction]: Checked pairs total: 8799 [2023-11-19 08:06:35,804 INFO L136 LiptonReduction]: Total number of compositions: 129 [2023-11-19 08:06:35,834 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 08:06:35,842 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;@6ef8a4ca, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 08:06:35,843 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-19 08:06:35,846 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 08:06:35,847 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-11-19 08:06:35,847 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:06:35,847 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:06:35,848 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-19 08:06:35,848 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 08:06:35,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:06:35,853 INFO L85 PathProgramCache]: Analyzing trace with hash 624, now seen corresponding path program 1 times [2023-11-19 08:06:35,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:06:35,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727356170] [2023-11-19 08:06:35,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:06:35,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:06:35,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:06:36,028 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 08:06:36,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:06:36,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727356170] [2023-11-19 08:06:36,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727356170] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:06:36,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:06:36,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-19 08:06:36,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225213967] [2023-11-19 08:06:36,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:06:36,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 08:06:36,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:06:36,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 08:06:36,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 08:06:36,079 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 263 [2023-11-19 08:06:36,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 35 transitions, 79 flow. Second operand has 2 states, 2 states have (on average 118.5) internal successors, (237), 2 states have internal predecessors, (237), 0 states have call successors, (0), 0 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 08:06:36,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:06:36,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 263 [2023-11-19 08:06:36,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:06:36,747 INFO L124 PetriNetUnfolderBase]: 1969/2910 cut-off events. [2023-11-19 08:06:36,747 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2023-11-19 08:06:36,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5847 conditions, 2910 events. 1969/2910 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 14594 event pairs, 1969 based on Foata normal form. 0/2483 useless extension candidates. Maximal degree in co-relation 5836. Up to 2871 conditions per place. [2023-11-19 08:06:36,776 INFO L140 encePairwiseOnDemand]: 256/263 looper letters, 24 selfloop transitions, 0 changer transitions 0/28 dead transitions. [2023-11-19 08:06:36,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 28 transitions, 113 flow [2023-11-19 08:06:36,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 08:06:36,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-19 08:06:36,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 267 transitions. [2023-11-19 08:06:36,792 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5076045627376425 [2023-11-19 08:06:36,793 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 267 transitions. [2023-11-19 08:06:36,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 267 transitions. [2023-11-19 08:06:36,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:06:36,798 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 267 transitions. [2023-11-19 08:06:36,801 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 133.5) internal successors, (267), 2 states have internal predecessors, (267), 0 states have call successors, (0), 0 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 08:06:36,807 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 263.0) internal successors, (789), 3 states have internal predecessors, (789), 0 states have call successors, (0), 0 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 08:06:36,808 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 263.0) internal successors, (789), 3 states have internal predecessors, (789), 0 states have call successors, (0), 0 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 08:06:36,810 INFO L175 Difference]: Start difference. First operand has 44 places, 35 transitions, 79 flow. Second operand 2 states and 267 transitions. [2023-11-19 08:06:36,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 28 transitions, 113 flow [2023-11-19 08:06:36,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 28 transitions, 110 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-19 08:06:36,815 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 62 flow [2023-11-19 08:06:36,817 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=62, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2023-11-19 08:06:36,821 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -8 predicate places. [2023-11-19 08:06:36,821 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 62 flow [2023-11-19 08:06:36,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 118.5) internal successors, (237), 2 states have internal predecessors, (237), 0 states have call successors, (0), 0 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 08:06:36,822 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:06:36,822 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-19 08:06:36,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 08:06:36,823 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 08:06:36,823 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:06:36,823 INFO L85 PathProgramCache]: Analyzing trace with hash 613510, now seen corresponding path program 1 times [2023-11-19 08:06:36,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:06:36,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566645384] [2023-11-19 08:06:36,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:06:36,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:06:36,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:06:37,136 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 08:06:37,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:06:37,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566645384] [2023-11-19 08:06:37,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566645384] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:06:37,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:06:37,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 08:06:37,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591660756] [2023-11-19 08:06:37,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:06:37,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 08:06:37,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:06:37,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 08:06:37,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 08:06:37,142 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 263 [2023-11-19 08:06:37,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 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 08:06:37,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:06:37,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 263 [2023-11-19 08:06:37,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:06:37,629 INFO L124 PetriNetUnfolderBase]: 1616/2410 cut-off events. [2023-11-19 08:06:37,629 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:06:37,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4832 conditions, 2410 events. 1616/2410 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 11812 event pairs, 720 based on Foata normal form. 0/2201 useless extension candidates. Maximal degree in co-relation 4829. Up to 2013 conditions per place. [2023-11-19 08:06:37,649 INFO L140 encePairwiseOnDemand]: 260/263 looper letters, 36 selfloop transitions, 2 changer transitions 2/44 dead transitions. [2023-11-19 08:06:37,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 44 transitions, 178 flow [2023-11-19 08:06:37,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 08:06:37,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 08:06:37,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 392 transitions. [2023-11-19 08:06:37,653 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4968314321926489 [2023-11-19 08:06:37,653 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 392 transitions. [2023-11-19 08:06:37,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 392 transitions. [2023-11-19 08:06:37,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:06:37,654 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 392 transitions. [2023-11-19 08:06:37,656 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 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 08:06:37,659 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 263.0) internal successors, (1052), 4 states have internal predecessors, (1052), 0 states have call successors, (0), 0 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 08:06:37,660 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 263.0) internal successors, (1052), 4 states have internal predecessors, (1052), 0 states have call successors, (0), 0 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 08:06:37,660 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 62 flow. Second operand 3 states and 392 transitions. [2023-11-19 08:06:37,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 44 transitions, 178 flow [2023-11-19 08:06:37,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 44 transitions, 178 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 08:06:37,662 INFO L231 Difference]: Finished difference. Result has 37 places, 26 transitions, 62 flow [2023-11-19 08:06:37,663 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=37, PETRI_TRANSITIONS=26} [2023-11-19 08:06:37,664 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -7 predicate places. [2023-11-19 08:06:37,664 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 26 transitions, 62 flow [2023-11-19 08:06:37,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 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 08:06:37,665 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:06:37,665 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:06:37,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 08:06:37,665 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 08:06:37,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:06:37,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1275354710, now seen corresponding path program 1 times [2023-11-19 08:06:37,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:06:37,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3054676] [2023-11-19 08:06:37,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:06:37,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:06:37,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:06:38,094 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 08:06:38,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:06:38,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3054676] [2023-11-19 08:06:38,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3054676] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:06:38,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:06:38,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 08:06:38,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829511783] [2023-11-19 08:06:38,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:06:38,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 08:06:38,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:06:38,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 08:06:38,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 08:06:38,123 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 263 [2023-11-19 08:06:38,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 26 transitions, 62 flow. Second operand has 4 states, 4 states have (on average 108.5) internal successors, (434), 4 states have internal predecessors, (434), 0 states have call successors, (0), 0 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 08:06:38,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:06:38,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 263 [2023-11-19 08:06:38,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:06:39,013 INFO L124 PetriNetUnfolderBase]: 3647/5228 cut-off events. [2023-11-19 08:06:39,014 INFO L125 PetriNetUnfolderBase]: For 257/257 co-relation queries the response was YES. [2023-11-19 08:06:39,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10805 conditions, 5228 events. 3647/5228 cut-off events. For 257/257 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 24116 event pairs, 1755 based on Foata normal form. 0/5020 useless extension candidates. Maximal degree in co-relation 10801. Up to 4585 conditions per place. [2023-11-19 08:06:39,055 INFO L140 encePairwiseOnDemand]: 256/263 looper letters, 52 selfloop transitions, 10 changer transitions 0/62 dead transitions. [2023-11-19 08:06:39,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 62 transitions, 268 flow [2023-11-19 08:06:39,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 08:06:39,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 08:06:39,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 594 transitions. [2023-11-19 08:06:39,058 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45171102661596957 [2023-11-19 08:06:39,059 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 594 transitions. [2023-11-19 08:06:39,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 594 transitions. [2023-11-19 08:06:39,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:06:39,060 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 594 transitions. [2023-11-19 08:06:39,062 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:06:39,065 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 263.0) internal successors, (1578), 6 states have internal predecessors, (1578), 0 states have call successors, (0), 0 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 08:06:39,067 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 263.0) internal successors, (1578), 6 states have internal predecessors, (1578), 0 states have call successors, (0), 0 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 08:06:39,127 INFO L175 Difference]: Start difference. First operand has 37 places, 26 transitions, 62 flow. Second operand 5 states and 594 transitions. [2023-11-19 08:06:39,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 62 transitions, 268 flow [2023-11-19 08:06:39,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 62 transitions, 258 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 08:06:39,130 INFO L231 Difference]: Finished difference. Result has 41 places, 35 transitions, 131 flow [2023-11-19 08:06:39,130 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=131, PETRI_PLACES=41, PETRI_TRANSITIONS=35} [2023-11-19 08:06:39,131 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -3 predicate places. [2023-11-19 08:06:39,132 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 35 transitions, 131 flow [2023-11-19 08:06:39,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.5) internal successors, (434), 4 states have internal predecessors, (434), 0 states have call successors, (0), 0 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 08:06:39,133 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:06:39,133 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:06:39,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 08:06:39,134 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 08:06:39,134 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:06:39,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1275354733, now seen corresponding path program 1 times [2023-11-19 08:06:39,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:06:39,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606095386] [2023-11-19 08:06:39,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:06:39,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:06:39,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:06:39,609 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 08:06:39,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:06:39,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606095386] [2023-11-19 08:06:39,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606095386] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:06:39,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:06:39,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 08:06:39,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155402247] [2023-11-19 08:06:39,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:06:39,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 08:06:39,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:06:39,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 08:06:39,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-19 08:06:39,815 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 263 [2023-11-19 08:06:39,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 35 transitions, 131 flow. Second operand has 6 states, 6 states have (on average 104.66666666666667) internal successors, (628), 6 states have internal predecessors, (628), 0 states have call successors, (0), 0 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 08:06:39,816 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:06:39,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 263 [2023-11-19 08:06:39,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:06:40,864 INFO L124 PetriNetUnfolderBase]: 2552/4018 cut-off events. [2023-11-19 08:06:40,864 INFO L125 PetriNetUnfolderBase]: For 1600/1630 co-relation queries the response was YES. [2023-11-19 08:06:40,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9379 conditions, 4018 events. 2552/4018 cut-off events. For 1600/1630 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 23813 event pairs, 1338 based on Foata normal form. 264/4163 useless extension candidates. Maximal degree in co-relation 9372. Up to 1519 conditions per place. [2023-11-19 08:06:40,905 INFO L140 encePairwiseOnDemand]: 258/263 looper letters, 52 selfloop transitions, 8 changer transitions 4/70 dead transitions. [2023-11-19 08:06:40,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 70 transitions, 346 flow [2023-11-19 08:06:40,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 08:06:40,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 08:06:40,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 678 transitions. [2023-11-19 08:06:40,909 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4296577946768061 [2023-11-19 08:06:40,910 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 678 transitions. [2023-11-19 08:06:40,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 678 transitions. [2023-11-19 08:06:40,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:06:40,911 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 678 transitions. [2023-11-19 08:06:40,913 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 113.0) internal successors, (678), 6 states have internal predecessors, (678), 0 states have call successors, (0), 0 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 08:06:40,917 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 263.0) internal successors, (1841), 7 states have internal predecessors, (1841), 0 states have call successors, (0), 0 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 08:06:40,919 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 263.0) internal successors, (1841), 7 states have internal predecessors, (1841), 0 states have call successors, (0), 0 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 08:06:40,919 INFO L175 Difference]: Start difference. First operand has 41 places, 35 transitions, 131 flow. Second operand 6 states and 678 transitions. [2023-11-19 08:06:40,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 70 transitions, 346 flow [2023-11-19 08:06:40,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 70 transitions, 346 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 08:06:40,927 INFO L231 Difference]: Finished difference. Result has 50 places, 34 transitions, 152 flow [2023-11-19 08:06:40,927 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=152, PETRI_PLACES=50, PETRI_TRANSITIONS=34} [2023-11-19 08:06:40,929 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 6 predicate places. [2023-11-19 08:06:40,930 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 34 transitions, 152 flow [2023-11-19 08:06:40,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 104.66666666666667) internal successors, (628), 6 states have internal predecessors, (628), 0 states have call successors, (0), 0 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 08:06:40,931 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:06:40,931 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:06:40,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 08:06:40,932 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 08:06:40,932 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:06:40,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1991348503, now seen corresponding path program 1 times [2023-11-19 08:06:40,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:06:40,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888591507] [2023-11-19 08:06:40,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:06:40,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:06:41,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:06:41,475 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 08:06:41,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:06:41,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888591507] [2023-11-19 08:06:41,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888591507] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:06:41,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:06:41,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 08:06:41,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082531599] [2023-11-19 08:06:41,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:06:41,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 08:06:41,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:06:41,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 08:06:41,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-19 08:06:41,778 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 263 [2023-11-19 08:06:41,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 34 transitions, 152 flow. Second operand has 6 states, 6 states have (on average 104.0) internal successors, (624), 6 states have internal predecessors, (624), 0 states have call successors, (0), 0 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 08:06:41,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:06:41,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 263 [2023-11-19 08:06:41,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:06:42,740 INFO L124 PetriNetUnfolderBase]: 2430/3663 cut-off events. [2023-11-19 08:06:42,741 INFO L125 PetriNetUnfolderBase]: For 2763/2783 co-relation queries the response was YES. [2023-11-19 08:06:42,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9197 conditions, 3663 events. 2430/3663 cut-off events. For 2763/2783 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 20002 event pairs, 508 based on Foata normal form. 86/3710 useless extension candidates. Maximal degree in co-relation 9185. Up to 2437 conditions per place. [2023-11-19 08:06:42,785 INFO L140 encePairwiseOnDemand]: 258/263 looper letters, 42 selfloop transitions, 7 changer transitions 0/53 dead transitions. [2023-11-19 08:06:42,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 53 transitions, 296 flow [2023-11-19 08:06:42,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 08:06:42,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 08:06:42,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 658 transitions. [2023-11-19 08:06:42,790 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41698352344740175 [2023-11-19 08:06:42,791 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 658 transitions. [2023-11-19 08:06:42,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 658 transitions. [2023-11-19 08:06:42,792 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:06:42,792 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 658 transitions. [2023-11-19 08:06:42,796 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 109.66666666666667) internal successors, (658), 6 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:06:42,801 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 263.0) internal successors, (1841), 7 states have internal predecessors, (1841), 0 states have call successors, (0), 0 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 08:06:42,803 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 263.0) internal successors, (1841), 7 states have internal predecessors, (1841), 0 states have call successors, (0), 0 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 08:06:42,803 INFO L175 Difference]: Start difference. First operand has 50 places, 34 transitions, 152 flow. Second operand 6 states and 658 transitions. [2023-11-19 08:06:42,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 53 transitions, 296 flow [2023-11-19 08:06:42,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 53 transitions, 273 flow, removed 3 selfloop flow, removed 5 redundant places. [2023-11-19 08:06:42,817 INFO L231 Difference]: Finished difference. Result has 47 places, 33 transitions, 139 flow [2023-11-19 08:06:42,818 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=139, PETRI_PLACES=47, PETRI_TRANSITIONS=33} [2023-11-19 08:06:42,819 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 3 predicate places. [2023-11-19 08:06:42,819 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 33 transitions, 139 flow [2023-11-19 08:06:42,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 104.0) internal successors, (624), 6 states have internal predecessors, (624), 0 states have call successors, (0), 0 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 08:06:42,820 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:06:42,821 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:06:42,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 08:06:42,821 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 08:06:42,822 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:06:42,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1991348526, now seen corresponding path program 1 times [2023-11-19 08:06:42,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:06:42,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520305878] [2023-11-19 08:06:42,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:06:42,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:06:42,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:06:43,057 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 08:06:43,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:06:43,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520305878] [2023-11-19 08:06:43,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520305878] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:06:43,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:06:43,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 08:06:43,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488074038] [2023-11-19 08:06:43,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:06:43,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 08:06:43,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:06:43,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 08:06:43,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 08:06:43,096 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 263 [2023-11-19 08:06:43,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 33 transitions, 139 flow. Second operand has 5 states, 5 states have (on average 108.4) internal successors, (542), 5 states have internal predecessors, (542), 0 states have call successors, (0), 0 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 08:06:43,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:06:43,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 263 [2023-11-19 08:06:43,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:06:44,171 INFO L124 PetriNetUnfolderBase]: 4213/6218 cut-off events. [2023-11-19 08:06:44,171 INFO L125 PetriNetUnfolderBase]: For 3142/3142 co-relation queries the response was YES. [2023-11-19 08:06:44,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15159 conditions, 6218 events. 4213/6218 cut-off events. For 3142/3142 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 31164 event pairs, 1141 based on Foata normal form. 336/6554 useless extension candidates. Maximal degree in co-relation 15151. Up to 4001 conditions per place. [2023-11-19 08:06:44,221 INFO L140 encePairwiseOnDemand]: 259/263 looper letters, 42 selfloop transitions, 3 changer transitions 26/71 dead transitions. [2023-11-19 08:06:44,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 71 transitions, 395 flow [2023-11-19 08:06:44,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 08:06:44,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 08:06:44,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 595 transitions. [2023-11-19 08:06:44,225 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4524714828897338 [2023-11-19 08:06:44,225 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 595 transitions. [2023-11-19 08:06:44,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 595 transitions. [2023-11-19 08:06:44,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:06:44,227 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 595 transitions. [2023-11-19 08:06:44,229 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 119.0) internal successors, (595), 5 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:06:44,233 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 263.0) internal successors, (1578), 6 states have internal predecessors, (1578), 0 states have call successors, (0), 0 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 08:06:44,234 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 263.0) internal successors, (1578), 6 states have internal predecessors, (1578), 0 states have call successors, (0), 0 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 08:06:44,234 INFO L175 Difference]: Start difference. First operand has 47 places, 33 transitions, 139 flow. Second operand 5 states and 595 transitions. [2023-11-19 08:06:44,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 71 transitions, 395 flow [2023-11-19 08:06:44,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 71 transitions, 382 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-19 08:06:44,244 INFO L231 Difference]: Finished difference. Result has 50 places, 33 transitions, 142 flow [2023-11-19 08:06:44,244 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=142, PETRI_PLACES=50, PETRI_TRANSITIONS=33} [2023-11-19 08:06:44,247 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 6 predicate places. [2023-11-19 08:06:44,251 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 33 transitions, 142 flow [2023-11-19 08:06:44,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.4) internal successors, (542), 5 states have internal predecessors, (542), 0 states have call successors, (0), 0 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 08:06:44,252 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:06:44,252 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:06:44,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 08:06:44,253 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 08:06:44,253 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:06:44,253 INFO L85 PathProgramCache]: Analyzing trace with hash 422784586, now seen corresponding path program 1 times [2023-11-19 08:06:44,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:06:44,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122744822] [2023-11-19 08:06:44,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:06:44,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:06:44,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:06:44,467 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 08:06:44,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:06:44,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122744822] [2023-11-19 08:06:44,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122744822] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:06:44,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:06:44,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 08:06:44,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348917890] [2023-11-19 08:06:44,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:06:44,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 08:06:44,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:06:44,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 08:06:44,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 08:06:44,509 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 263 [2023-11-19 08:06:44,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 33 transitions, 142 flow. Second operand has 5 states, 5 states have (on average 108.4) internal successors, (542), 5 states have internal predecessors, (542), 0 states have call successors, (0), 0 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 08:06:44,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:06:44,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 263 [2023-11-19 08:06:44,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:06:45,420 INFO L124 PetriNetUnfolderBase]: 3621/5338 cut-off events. [2023-11-19 08:06:45,421 INFO L125 PetriNetUnfolderBase]: For 4059/4059 co-relation queries the response was YES. [2023-11-19 08:06:45,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13792 conditions, 5338 events. 3621/5338 cut-off events. For 4059/4059 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 26208 event pairs, 2021 based on Foata normal form. 144/5482 useless extension candidates. Maximal degree in co-relation 13781. Up to 4267 conditions per place. [2023-11-19 08:06:45,458 INFO L140 encePairwiseOnDemand]: 259/263 looper letters, 41 selfloop transitions, 6 changer transitions 22/69 dead transitions. [2023-11-19 08:06:45,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 69 transitions, 386 flow [2023-11-19 08:06:45,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 08:06:45,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 08:06:45,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 595 transitions. [2023-11-19 08:06:45,462 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4524714828897338 [2023-11-19 08:06:45,462 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 595 transitions. [2023-11-19 08:06:45,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 595 transitions. [2023-11-19 08:06:45,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:06:45,463 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 595 transitions. [2023-11-19 08:06:45,466 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 119.0) internal successors, (595), 5 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:06:45,470 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 263.0) internal successors, (1578), 6 states have internal predecessors, (1578), 0 states have call successors, (0), 0 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 08:06:45,471 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 263.0) internal successors, (1578), 6 states have internal predecessors, (1578), 0 states have call successors, (0), 0 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 08:06:45,471 INFO L175 Difference]: Start difference. First operand has 50 places, 33 transitions, 142 flow. Second operand 5 states and 595 transitions. [2023-11-19 08:06:45,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 69 transitions, 386 flow [2023-11-19 08:06:45,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 69 transitions, 374 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-11-19 08:06:45,501 INFO L231 Difference]: Finished difference. Result has 51 places, 33 transitions, 156 flow [2023-11-19 08:06:45,501 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=156, PETRI_PLACES=51, PETRI_TRANSITIONS=33} [2023-11-19 08:06:45,503 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 7 predicate places. [2023-11-19 08:06:45,504 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 33 transitions, 156 flow [2023-11-19 08:06:45,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.4) internal successors, (542), 5 states have internal predecessors, (542), 0 states have call successors, (0), 0 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 08:06:45,506 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:06:45,506 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:06:45,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 08:06:45,506 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 08:06:45,507 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:06:45,507 INFO L85 PathProgramCache]: Analyzing trace with hash 739156336, now seen corresponding path program 1 times [2023-11-19 08:06:45,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:06:45,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961674037] [2023-11-19 08:06:45,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:06:45,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:06:45,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:06:45,756 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 08:06:45,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:06:45,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961674037] [2023-11-19 08:06:45,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961674037] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:06:45,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:06:45,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 08:06:45,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369570230] [2023-11-19 08:06:45,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:06:45,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 08:06:45,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:06:45,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 08:06:45,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 08:06:45,791 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 263 [2023-11-19 08:06:45,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 33 transitions, 156 flow. Second operand has 5 states, 5 states have (on average 108.8) internal successors, (544), 5 states have internal predecessors, (544), 0 states have call successors, (0), 0 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 08:06:45,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:06:45,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 263 [2023-11-19 08:06:45,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:06:46,734 INFO L124 PetriNetUnfolderBase]: 3369/5006 cut-off events. [2023-11-19 08:06:46,735 INFO L125 PetriNetUnfolderBase]: For 4122/4122 co-relation queries the response was YES. [2023-11-19 08:06:46,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12913 conditions, 5006 events. 3369/5006 cut-off events. For 4122/4122 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 24670 event pairs, 1066 based on Foata normal form. 192/5198 useless extension candidates. Maximal degree in co-relation 12901. Up to 3389 conditions per place. [2023-11-19 08:06:46,775 INFO L140 encePairwiseOnDemand]: 259/263 looper letters, 45 selfloop transitions, 3 changer transitions 18/66 dead transitions. [2023-11-19 08:06:46,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 66 transitions, 386 flow [2023-11-19 08:06:46,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 08:06:46,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 08:06:46,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 589 transitions. [2023-11-19 08:06:46,784 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4479087452471483 [2023-11-19 08:06:46,784 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 589 transitions. [2023-11-19 08:06:46,784 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 589 transitions. [2023-11-19 08:06:46,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:06:46,785 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 589 transitions. [2023-11-19 08:06:46,788 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:06:46,793 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 263.0) internal successors, (1578), 6 states have internal predecessors, (1578), 0 states have call successors, (0), 0 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 08:06:46,795 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 263.0) internal successors, (1578), 6 states have internal predecessors, (1578), 0 states have call successors, (0), 0 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 08:06:46,795 INFO L175 Difference]: Start difference. First operand has 51 places, 33 transitions, 156 flow. Second operand 5 states and 589 transitions. [2023-11-19 08:06:46,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 66 transitions, 386 flow [2023-11-19 08:06:46,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 66 transitions, 368 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-11-19 08:06:46,807 INFO L231 Difference]: Finished difference. Result has 52 places, 33 transitions, 155 flow [2023-11-19 08:06:46,808 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=155, PETRI_PLACES=52, PETRI_TRANSITIONS=33} [2023-11-19 08:06:46,812 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 8 predicate places. [2023-11-19 08:06:46,812 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 33 transitions, 155 flow [2023-11-19 08:06:46,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.8) internal successors, (544), 5 states have internal predecessors, (544), 0 states have call successors, (0), 0 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 08:06:46,813 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:06:46,813 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:06:46,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 08:06:46,814 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 08:06:46,819 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:06:46,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1807018903, now seen corresponding path program 1 times [2023-11-19 08:06:46,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:06:46,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804786742] [2023-11-19 08:06:46,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:06:46,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:06:46,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:06:47,087 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 08:06:47,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:06:47,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804786742] [2023-11-19 08:06:47,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804786742] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:06:47,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:06:47,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 08:06:47,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716001747] [2023-11-19 08:06:47,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:06:47,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 08:06:47,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:06:47,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 08:06:47,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 08:06:47,106 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 263 [2023-11-19 08:06:47,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 33 transitions, 155 flow. Second operand has 4 states, 4 states have (on average 115.5) internal successors, (462), 4 states have internal predecessors, (462), 0 states have call successors, (0), 0 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 08:06:47,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:06:47,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 263 [2023-11-19 08:06:47,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:06:47,508 INFO L124 PetriNetUnfolderBase]: 1173/1987 cut-off events. [2023-11-19 08:06:47,509 INFO L125 PetriNetUnfolderBase]: For 1117/1144 co-relation queries the response was YES. [2023-11-19 08:06:47,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4887 conditions, 1987 events. 1173/1987 cut-off events. For 1117/1144 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 11411 event pairs, 234 based on Foata normal form. 202/2166 useless extension candidates. Maximal degree in co-relation 4874. Up to 1117 conditions per place. [2023-11-19 08:06:47,523 INFO L140 encePairwiseOnDemand]: 257/263 looper letters, 60 selfloop transitions, 8 changer transitions 0/74 dead transitions. [2023-11-19 08:06:47,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 74 transitions, 415 flow [2023-11-19 08:06:47,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 08:06:47,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 08:06:47,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 621 transitions. [2023-11-19 08:06:47,527 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47224334600760454 [2023-11-19 08:06:47,527 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 621 transitions. [2023-11-19 08:06:47,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 621 transitions. [2023-11-19 08:06:47,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:06:47,528 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 621 transitions. [2023-11-19 08:06:47,531 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 124.2) internal successors, (621), 5 states have internal predecessors, (621), 0 states have call successors, (0), 0 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 08:06:47,534 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 263.0) internal successors, (1578), 6 states have internal predecessors, (1578), 0 states have call successors, (0), 0 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 08:06:47,535 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 263.0) internal successors, (1578), 6 states have internal predecessors, (1578), 0 states have call successors, (0), 0 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 08:06:47,535 INFO L175 Difference]: Start difference. First operand has 52 places, 33 transitions, 155 flow. Second operand 5 states and 621 transitions. [2023-11-19 08:06:47,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 74 transitions, 415 flow [2023-11-19 08:06:47,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 74 transitions, 403 flow, removed 3 selfloop flow, removed 4 redundant places. [2023-11-19 08:06:47,540 INFO L231 Difference]: Finished difference. Result has 53 places, 40 transitions, 203 flow [2023-11-19 08:06:47,541 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=203, PETRI_PLACES=53, PETRI_TRANSITIONS=40} [2023-11-19 08:06:47,541 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 9 predicate places. [2023-11-19 08:06:47,542 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 40 transitions, 203 flow [2023-11-19 08:06:47,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.5) internal successors, (462), 4 states have internal predecessors, (462), 0 states have call successors, (0), 0 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 08:06:47,542 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:06:47,542 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:06:47,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 08:06:47,543 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 08:06:47,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:06:47,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1842781598, now seen corresponding path program 1 times [2023-11-19 08:06:47,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:06:47,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730669727] [2023-11-19 08:06:47,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:06:47,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:06:47,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:06:47,760 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 08:06:47,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:06:47,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730669727] [2023-11-19 08:06:47,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730669727] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:06:47,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:06:47,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 08:06:47,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852986031] [2023-11-19 08:06:47,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:06:47,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 08:06:47,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:06:47,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 08:06:47,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 08:06:47,781 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 263 [2023-11-19 08:06:47,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 40 transitions, 203 flow. Second operand has 5 states, 5 states have (on average 115.2) internal successors, (576), 5 states have internal predecessors, (576), 0 states have call successors, (0), 0 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 08:06:47,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:06:47,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 263 [2023-11-19 08:06:47,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:06:48,289 INFO L124 PetriNetUnfolderBase]: 890/1585 cut-off events. [2023-11-19 08:06:48,290 INFO L125 PetriNetUnfolderBase]: For 1343/1355 co-relation queries the response was YES. [2023-11-19 08:06:48,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4816 conditions, 1585 events. 890/1585 cut-off events. For 1343/1355 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 9129 event pairs, 144 based on Foata normal form. 104/1668 useless extension candidates. Maximal degree in co-relation 4802. Up to 474 conditions per place. [2023-11-19 08:06:48,299 INFO L140 encePairwiseOnDemand]: 257/263 looper letters, 69 selfloop transitions, 15 changer transitions 9/99 dead transitions. [2023-11-19 08:06:48,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 99 transitions, 605 flow [2023-11-19 08:06:48,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 08:06:48,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-19 08:06:48,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 870 transitions. [2023-11-19 08:06:48,305 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4725692558392178 [2023-11-19 08:06:48,305 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 870 transitions. [2023-11-19 08:06:48,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 870 transitions. [2023-11-19 08:06:48,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:06:48,306 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 870 transitions. [2023-11-19 08:06:48,310 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.28571428571429) internal successors, (870), 7 states have internal predecessors, (870), 0 states have call successors, (0), 0 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 08:06:48,314 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 263.0) internal successors, (2104), 8 states have internal predecessors, (2104), 0 states have call successors, (0), 0 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 08:06:48,316 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 263.0) internal successors, (2104), 8 states have internal predecessors, (2104), 0 states have call successors, (0), 0 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 08:06:48,316 INFO L175 Difference]: Start difference. First operand has 53 places, 40 transitions, 203 flow. Second operand 7 states and 870 transitions. [2023-11-19 08:06:48,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 99 transitions, 605 flow [2023-11-19 08:06:48,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 99 transitions, 585 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-11-19 08:06:48,323 INFO L231 Difference]: Finished difference. Result has 60 places, 47 transitions, 292 flow [2023-11-19 08:06:48,323 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=292, PETRI_PLACES=60, PETRI_TRANSITIONS=47} [2023-11-19 08:06:48,324 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 16 predicate places. [2023-11-19 08:06:48,324 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 47 transitions, 292 flow [2023-11-19 08:06:48,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.2) internal successors, (576), 5 states have internal predecessors, (576), 0 states have call successors, (0), 0 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 08:06:48,325 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:06:48,325 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] [2023-11-19 08:06:48,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 08:06:48,326 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 08:06:48,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:06:48,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1555965993, now seen corresponding path program 1 times [2023-11-19 08:06:48,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:06:48,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724211643] [2023-11-19 08:06:48,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:06:48,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:06:48,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:06:48,596 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 08:06:48,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:06:48,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724211643] [2023-11-19 08:06:48,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724211643] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:06:48,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:06:48,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 08:06:48,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057197025] [2023-11-19 08:06:48,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:06:48,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 08:06:48,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:06:48,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 08:06:48,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 08:06:48,643 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 263 [2023-11-19 08:06:48,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 47 transitions, 292 flow. Second operand has 5 states, 5 states have (on average 108.4) internal successors, (542), 5 states have internal predecessors, (542), 0 states have call successors, (0), 0 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 08:06:48,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:06:48,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 263 [2023-11-19 08:06:48,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:06:49,485 INFO L124 PetriNetUnfolderBase]: 2385/3936 cut-off events. [2023-11-19 08:06:49,485 INFO L125 PetriNetUnfolderBase]: For 7693/7693 co-relation queries the response was YES. [2023-11-19 08:06:49,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13712 conditions, 3936 events. 2385/3936 cut-off events. For 7693/7693 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 22342 event pairs, 191 based on Foata normal form. 28/3964 useless extension candidates. Maximal degree in co-relation 13696. Up to 2425 conditions per place. [2023-11-19 08:06:49,513 INFO L140 encePairwiseOnDemand]: 253/263 looper letters, 65 selfloop transitions, 15 changer transitions 38/118 dead transitions. [2023-11-19 08:06:49,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 118 transitions, 947 flow [2023-11-19 08:06:49,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 08:06:49,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-19 08:06:49,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 806 transitions. [2023-11-19 08:06:49,518 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43780554046713743 [2023-11-19 08:06:49,519 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 806 transitions. [2023-11-19 08:06:49,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 806 transitions. [2023-11-19 08:06:49,520 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:06:49,520 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 806 transitions. [2023-11-19 08:06:49,523 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 115.14285714285714) internal successors, (806), 7 states have internal predecessors, (806), 0 states have call successors, (0), 0 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 08:06:49,527 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 263.0) internal successors, (2104), 8 states have internal predecessors, (2104), 0 states have call successors, (0), 0 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 08:06:49,529 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 263.0) internal successors, (2104), 8 states have internal predecessors, (2104), 0 states have call successors, (0), 0 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 08:06:49,529 INFO L175 Difference]: Start difference. First operand has 60 places, 47 transitions, 292 flow. Second operand 7 states and 806 transitions. [2023-11-19 08:06:49,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 118 transitions, 947 flow [2023-11-19 08:06:49,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 118 transitions, 852 flow, removed 35 selfloop flow, removed 2 redundant places. [2023-11-19 08:06:49,607 INFO L231 Difference]: Finished difference. Result has 68 places, 47 transitions, 304 flow [2023-11-19 08:06:49,607 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=304, PETRI_PLACES=68, PETRI_TRANSITIONS=47} [2023-11-19 08:06:49,608 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 24 predicate places. [2023-11-19 08:06:49,608 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 47 transitions, 304 flow [2023-11-19 08:06:49,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.4) internal successors, (542), 5 states have internal predecessors, (542), 0 states have call successors, (0), 0 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 08:06:49,609 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:06:49,609 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] [2023-11-19 08:06:49,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 08:06:49,610 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 08:06:49,610 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:06:49,610 INFO L85 PathProgramCache]: Analyzing trace with hash 331353707, now seen corresponding path program 2 times [2023-11-19 08:06:49,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:06:49,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175131747] [2023-11-19 08:06:49,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:06:49,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:06:49,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:06:49,889 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 08:06:49,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:06:49,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175131747] [2023-11-19 08:06:49,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175131747] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:06:49,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:06:49,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 08:06:49,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026864055] [2023-11-19 08:06:49,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:06:49,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 08:06:49,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:06:49,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 08:06:49,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 08:06:49,913 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 263 [2023-11-19 08:06:49,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 47 transitions, 304 flow. Second operand has 5 states, 5 states have (on average 115.8) internal successors, (579), 5 states have internal predecessors, (579), 0 states have call successors, (0), 0 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 08:06:49,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:06:49,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 263 [2023-11-19 08:06:49,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:06:50,378 INFO L124 PetriNetUnfolderBase]: 1113/2212 cut-off events. [2023-11-19 08:06:50,378 INFO L125 PetriNetUnfolderBase]: For 3498/3530 co-relation queries the response was YES. [2023-11-19 08:06:50,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7855 conditions, 2212 events. 1113/2212 cut-off events. For 3498/3530 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 14345 event pairs, 269 based on Foata normal form. 24/2193 useless extension candidates. Maximal degree in co-relation 7834. Up to 1063 conditions per place. [2023-11-19 08:06:50,394 INFO L140 encePairwiseOnDemand]: 259/263 looper letters, 62 selfloop transitions, 2 changer transitions 23/95 dead transitions. [2023-11-19 08:06:50,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 95 transitions, 753 flow [2023-11-19 08:06:50,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 08:06:50,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 08:06:50,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 617 transitions. [2023-11-19 08:06:50,398 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4692015209125475 [2023-11-19 08:06:50,398 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 617 transitions. [2023-11-19 08:06:50,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 617 transitions. [2023-11-19 08:06:50,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:06:50,399 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 617 transitions. [2023-11-19 08:06:50,401 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 123.4) internal successors, (617), 5 states have internal predecessors, (617), 0 states have call successors, (0), 0 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 08:06:50,404 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 263.0) internal successors, (1578), 6 states have internal predecessors, (1578), 0 states have call successors, (0), 0 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 08:06:50,404 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 263.0) internal successors, (1578), 6 states have internal predecessors, (1578), 0 states have call successors, (0), 0 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 08:06:50,405 INFO L175 Difference]: Start difference. First operand has 68 places, 47 transitions, 304 flow. Second operand 5 states and 617 transitions. [2023-11-19 08:06:50,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 95 transitions, 753 flow [2023-11-19 08:06:50,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 95 transitions, 731 flow, removed 11 selfloop flow, removed 4 redundant places. [2023-11-19 08:06:50,420 INFO L231 Difference]: Finished difference. Result has 65 places, 47 transitions, 309 flow [2023-11-19 08:06:50,421 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=309, PETRI_PLACES=65, PETRI_TRANSITIONS=47} [2023-11-19 08:06:50,421 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 21 predicate places. [2023-11-19 08:06:50,421 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 47 transitions, 309 flow [2023-11-19 08:06:50,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.8) internal successors, (579), 5 states have internal predecessors, (579), 0 states have call successors, (0), 0 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 08:06:50,422 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:06:50,422 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] [2023-11-19 08:06:50,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-19 08:06:50,423 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 08:06:50,423 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:06:50,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1057223201, now seen corresponding path program 3 times [2023-11-19 08:06:50,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:06:50,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333660448] [2023-11-19 08:06:50,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:06:50,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:06:50,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:06:50,661 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 08:06:50,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:06:50,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333660448] [2023-11-19 08:06:50,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333660448] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:06:50,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:06:50,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 08:06:50,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278813584] [2023-11-19 08:06:50,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:06:50,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 08:06:50,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:06:50,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 08:06:50,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-19 08:06:50,681 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 263 [2023-11-19 08:06:50,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 47 transitions, 309 flow. Second operand has 6 states, 6 states have (on average 115.0) internal successors, (690), 6 states have internal predecessors, (690), 0 states have call successors, (0), 0 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 08:06:50,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:06:50,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 263 [2023-11-19 08:06:50,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:06:51,169 INFO L124 PetriNetUnfolderBase]: 885/1744 cut-off events. [2023-11-19 08:06:51,169 INFO L125 PetriNetUnfolderBase]: For 2145/2174 co-relation queries the response was YES. [2023-11-19 08:06:51,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5976 conditions, 1744 events. 885/1744 cut-off events. For 2145/2174 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 11123 event pairs, 276 based on Foata normal form. 91/1773 useless extension candidates. Maximal degree in co-relation 5955. Up to 608 conditions per place. [2023-11-19 08:06:51,178 INFO L140 encePairwiseOnDemand]: 257/263 looper letters, 44 selfloop transitions, 11 changer transitions 27/89 dead transitions. [2023-11-19 08:06:51,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 89 transitions, 683 flow [2023-11-19 08:06:51,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 08:06:51,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-19 08:06:51,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 847 transitions. [2023-11-19 08:06:51,191 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4600760456273764 [2023-11-19 08:06:51,191 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 847 transitions. [2023-11-19 08:06:51,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 847 transitions. [2023-11-19 08:06:51,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:06:51,193 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 847 transitions. [2023-11-19 08:06:51,195 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.0) internal successors, (847), 7 states have internal predecessors, (847), 0 states have call successors, (0), 0 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 08:06:51,211 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 263.0) internal successors, (2104), 8 states have internal predecessors, (2104), 0 states have call successors, (0), 0 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 08:06:51,212 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 263.0) internal successors, (2104), 8 states have internal predecessors, (2104), 0 states have call successors, (0), 0 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 08:06:51,212 INFO L175 Difference]: Start difference. First operand has 65 places, 47 transitions, 309 flow. Second operand 7 states and 847 transitions. [2023-11-19 08:06:51,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 89 transitions, 683 flow [2023-11-19 08:06:51,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 89 transitions, 632 flow, removed 12 selfloop flow, removed 5 redundant places. [2023-11-19 08:06:51,230 INFO L231 Difference]: Finished difference. Result has 68 places, 43 transitions, 276 flow [2023-11-19 08:06:51,230 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=276, PETRI_PLACES=68, PETRI_TRANSITIONS=43} [2023-11-19 08:06:51,231 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 24 predicate places. [2023-11-19 08:06:51,231 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 43 transitions, 276 flow [2023-11-19 08:06:51,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.0) internal successors, (690), 6 states have internal predecessors, (690), 0 states have call successors, (0), 0 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 08:06:51,232 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:06:51,232 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:06:51,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-19 08:06:51,233 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 08:06:51,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:06:51,233 INFO L85 PathProgramCache]: Analyzing trace with hash 757783445, now seen corresponding path program 1 times [2023-11-19 08:06:51,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:06:51,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331070886] [2023-11-19 08:06:51,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:06:51,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:06:51,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:06:53,088 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 08:06:53,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:06:53,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331070886] [2023-11-19 08:06:53,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331070886] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:06:53,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:06:53,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 08:06:53,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469182653] [2023-11-19 08:06:53,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:06:53,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-19 08:06:53,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:06:53,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-19 08:06:53,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-19 08:06:53,226 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 263 [2023-11-19 08:06:53,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 43 transitions, 276 flow. Second operand has 9 states, 9 states have (on average 112.33333333333333) internal successors, (1011), 9 states have internal predecessors, (1011), 0 states have call successors, (0), 0 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 08:06:53,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:06:53,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 263 [2023-11-19 08:06:53,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:06:54,125 INFO L124 PetriNetUnfolderBase]: 738/1572 cut-off events. [2023-11-19 08:06:54,125 INFO L125 PetriNetUnfolderBase]: For 3010/3048 co-relation queries the response was YES. [2023-11-19 08:06:54,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5963 conditions, 1572 events. 738/1572 cut-off events. For 3010/3048 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 10342 event pairs, 87 based on Foata normal form. 6/1528 useless extension candidates. Maximal degree in co-relation 5943. Up to 575 conditions per place. [2023-11-19 08:06:54,134 INFO L140 encePairwiseOnDemand]: 253/263 looper letters, 66 selfloop transitions, 15 changer transitions 52/140 dead transitions. [2023-11-19 08:06:54,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 140 transitions, 1130 flow [2023-11-19 08:06:54,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-19 08:06:54,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-19 08:06:54,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1304 transitions. [2023-11-19 08:06:54,141 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45074317317663326 [2023-11-19 08:06:54,141 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1304 transitions. [2023-11-19 08:06:54,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1304 transitions. [2023-11-19 08:06:54,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:06:54,143 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1304 transitions. [2023-11-19 08:06:54,147 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 118.54545454545455) internal successors, (1304), 11 states have internal predecessors, (1304), 0 states have call successors, (0), 0 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 08:06:54,152 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 263.0) internal successors, (3156), 12 states have internal predecessors, (3156), 0 states have call successors, (0), 0 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 08:06:54,154 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 263.0) internal successors, (3156), 12 states have internal predecessors, (3156), 0 states have call successors, (0), 0 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 08:06:54,154 INFO L175 Difference]: Start difference. First operand has 68 places, 43 transitions, 276 flow. Second operand 11 states and 1304 transitions. [2023-11-19 08:06:54,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 140 transitions, 1130 flow [2023-11-19 08:06:54,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 140 transitions, 955 flow, removed 51 selfloop flow, removed 8 redundant places. [2023-11-19 08:06:54,173 INFO L231 Difference]: Finished difference. Result has 76 places, 50 transitions, 337 flow [2023-11-19 08:06:54,174 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=337, PETRI_PLACES=76, PETRI_TRANSITIONS=50} [2023-11-19 08:06:54,174 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 32 predicate places. [2023-11-19 08:06:54,174 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 50 transitions, 337 flow [2023-11-19 08:06:54,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 112.33333333333333) internal successors, (1011), 9 states have internal predecessors, (1011), 0 states have call successors, (0), 0 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 08:06:54,175 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:06:54,176 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:06:54,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-19 08:06:54,176 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 08:06:54,176 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:06:54,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1912902031, now seen corresponding path program 2 times [2023-11-19 08:06:54,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:06:54,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524122934] [2023-11-19 08:06:54,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:06:54,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:06:54,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:06:56,193 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 08:06:56,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:06:56,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524122934] [2023-11-19 08:06:56,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524122934] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:06:56,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:06:56,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 08:06:56,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856923353] [2023-11-19 08:06:56,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:06:56,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-19 08:06:56,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:06:56,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-19 08:06:56,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-19 08:06:56,388 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 263 [2023-11-19 08:06:56,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 50 transitions, 337 flow. Second operand has 9 states, 9 states have (on average 112.33333333333333) internal successors, (1011), 9 states have internal predecessors, (1011), 0 states have call successors, (0), 0 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 08:06:56,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:06:56,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 263 [2023-11-19 08:06:56,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:06:56,970 INFO L124 PetriNetUnfolderBase]: 476/1085 cut-off events. [2023-11-19 08:06:56,970 INFO L125 PetriNetUnfolderBase]: For 2379/2475 co-relation queries the response was YES. [2023-11-19 08:06:56,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4179 conditions, 1085 events. 476/1085 cut-off events. For 2379/2475 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 6827 event pairs, 100 based on Foata normal form. 47/1101 useless extension candidates. Maximal degree in co-relation 4156. Up to 590 conditions per place. [2023-11-19 08:06:56,977 INFO L140 encePairwiseOnDemand]: 255/263 looper letters, 49 selfloop transitions, 12 changer transitions 19/87 dead transitions. [2023-11-19 08:06:56,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 87 transitions, 706 flow [2023-11-19 08:06:56,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-19 08:06:56,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-19 08:06:56,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1043 transitions. [2023-11-19 08:06:56,982 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44064216307562315 [2023-11-19 08:06:56,982 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1043 transitions. [2023-11-19 08:06:56,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1043 transitions. [2023-11-19 08:06:56,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:06:56,984 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1043 transitions. [2023-11-19 08:06:56,987 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 115.88888888888889) internal successors, (1043), 9 states have internal predecessors, (1043), 0 states have call successors, (0), 0 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 08:06:56,991 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 263.0) internal successors, (2630), 10 states have internal predecessors, (2630), 0 states have call successors, (0), 0 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 08:06:56,993 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 263.0) internal successors, (2630), 10 states have internal predecessors, (2630), 0 states have call successors, (0), 0 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 08:06:56,993 INFO L175 Difference]: Start difference. First operand has 76 places, 50 transitions, 337 flow. Second operand 9 states and 1043 transitions. [2023-11-19 08:06:56,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 87 transitions, 706 flow [2023-11-19 08:06:57,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 87 transitions, 674 flow, removed 12 selfloop flow, removed 6 redundant places. [2023-11-19 08:06:57,006 INFO L231 Difference]: Finished difference. Result has 77 places, 50 transitions, 354 flow [2023-11-19 08:06:57,007 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=354, PETRI_PLACES=77, PETRI_TRANSITIONS=50} [2023-11-19 08:06:57,007 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 33 predicate places. [2023-11-19 08:06:57,008 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 50 transitions, 354 flow [2023-11-19 08:06:57,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 112.33333333333333) internal successors, (1011), 9 states have internal predecessors, (1011), 0 states have call successors, (0), 0 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 08:06:57,009 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:06:57,009 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:06:57,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-19 08:06:57,009 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 08:06:57,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:06:57,010 INFO L85 PathProgramCache]: Analyzing trace with hash -861872217, now seen corresponding path program 3 times [2023-11-19 08:06:57,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:06:57,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830807125] [2023-11-19 08:06:57,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:06:57,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:06:57,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:06:57,084 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 08:06:57,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:06:57,197 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 08:06:57,200 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 08:06:57,202 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-19 08:06:57,204 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-19 08:06:57,205 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-19 08:06:57,205 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-19 08:06:57,205 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-19 08:06:57,206 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-19 08:06:57,206 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-19 08:06:57,206 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-19 08:06:57,206 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-19 08:06:57,207 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-19 08:06:57,207 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-19 08:06:57,207 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-19 08:06:57,207 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-19 08:06:57,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-19 08:06:57,208 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:06:57,215 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-19 08:06:57,216 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 08:06:57,301 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-19 08:06:57,304 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-19 08:06:57,324 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-19 08:06:57,333 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-19 08:06:57,357 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 08:06:57 BasicIcfg [2023-11-19 08:06:57,358 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 08:06:57,359 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 08:06:57,359 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 08:06:57,359 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 08:06:57,360 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:06:29" (3/4) ... [2023-11-19 08:06:57,362 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-19 08:06:57,363 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 08:06:57,364 INFO L158 Benchmark]: Toolchain (without parser) took 29384.54ms. Allocated memory was 159.4MB in the beginning and 786.4MB in the end (delta: 627.0MB). Free memory was 115.0MB in the beginning and 532.2MB in the end (delta: -417.2MB). Peak memory consumption was 211.9MB. Max. memory is 16.1GB. [2023-11-19 08:06:57,364 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 117.4MB. Free memory is still 64.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 08:06:57,365 INFO L158 Benchmark]: CACSL2BoogieTranslator took 711.33ms. Allocated memory is still 159.4MB. Free memory was 115.0MB in the beginning and 90.4MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-19 08:06:57,365 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.76ms. Allocated memory is still 159.4MB. Free memory was 89.9MB in the beginning and 87.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 08:06:57,365 INFO L158 Benchmark]: Boogie Preprocessor took 40.05ms. Allocated memory is still 159.4MB. Free memory was 87.2MB in the beginning and 85.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 08:06:57,366 INFO L158 Benchmark]: RCFGBuilder took 1097.17ms. Allocated memory is still 159.4MB. Free memory was 85.2MB in the beginning and 86.0MB in the end (delta: -855.2kB). Peak memory consumption was 10.4MB. Max. memory is 16.1GB. [2023-11-19 08:06:57,367 INFO L158 Benchmark]: TraceAbstraction took 27456.18ms. Allocated memory was 159.4MB in the beginning and 786.4MB in the end (delta: 627.0MB). Free memory was 85.3MB in the beginning and 532.2MB in the end (delta: -446.9MB). Peak memory consumption was 180.6MB. Max. memory is 16.1GB. [2023-11-19 08:06:57,367 INFO L158 Benchmark]: Witness Printer took 4.54ms. Allocated memory is still 786.4MB. Free memory is still 532.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 08:06:57,369 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 117.4MB. Free memory is still 64.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 711.33ms. Allocated memory is still 159.4MB. Free memory was 115.0MB in the beginning and 90.4MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.76ms. Allocated memory is still 159.4MB. Free memory was 89.9MB in the beginning and 87.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.05ms. Allocated memory is still 159.4MB. Free memory was 87.2MB in the beginning and 85.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1097.17ms. Allocated memory is still 159.4MB. Free memory was 85.2MB in the beginning and 86.0MB in the end (delta: -855.2kB). Peak memory consumption was 10.4MB. Max. memory is 16.1GB. * TraceAbstraction took 27456.18ms. Allocated memory was 159.4MB in the beginning and 786.4MB in the end (delta: 627.0MB). Free memory was 85.3MB in the beginning and 532.2MB in the end (delta: -446.9MB). Peak memory consumption was 180.6MB. Max. memory is 16.1GB. * Witness Printer took 4.54ms. Allocated memory is still 786.4MB. Free memory is still 532.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.5s, 137 PlacesBefore, 44 PlacesAfterwards, 131 TransitionsBefore, 35 TransitionsAfterwards, 3084 CoEnabledTransitionPairs, 7 FixpointIterations, 50 TrivialSequentialCompositions, 66 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 3 ChoiceCompositions, 129 TotalNumberOfCompositions, 8799 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4338, independent: 4108, independent conditional: 0, independent unconditional: 4108, dependent: 230, dependent conditional: 0, dependent unconditional: 230, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1672, independent: 1632, independent conditional: 0, independent unconditional: 1632, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4338, independent: 2476, independent conditional: 0, independent unconditional: 2476, dependent: 190, dependent conditional: 0, dependent unconditional: 190, unknown: 1672, unknown conditional: 0, unknown unconditional: 1672] , Statistics on independence cache: Total cache size (in pairs): 164, Positive cache size: 145, Positive conditional cache size: 0, Positive unconditional cache size: 145, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p0_EBX = 0; [L716] 0 int __unbuffered_p1_EAX = 0; [L718] 0 int __unbuffered_p1_EBX = 0; [L720] 0 int __unbuffered_p2_EAX = 0; [L722] 0 int __unbuffered_p2_EBX = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff1_thd0; [L738] 0 _Bool z$r_buff1_thd1; [L739] 0 _Bool z$r_buff1_thd2; [L740] 0 _Bool z$r_buff1_thd3; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L864] 0 pthread_t t14; [L865] FCALL, FORK 0 pthread_create(&t14, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t14={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L866] 0 pthread_t t15; [L867] FCALL, FORK 0 pthread_create(&t15, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t14={5:0}, t15={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L752] 1 z$w_buff1 = z$w_buff0 [L753] 1 z$w_buff0 = 1 [L754] 1 z$w_buff1_used = z$w_buff0_used [L755] 1 z$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L19] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L757] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L758] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L759] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L760] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L761] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 z$flush_delayed = weak$$choice2 [L767] 1 z$mem_tmp = z [L768] 1 z = !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff1) [L769] 1 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff0)) [L770] 1 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff1 : z$w_buff1)) [L771] 1 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used)) [L772] 1 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L773] 1 z$r_buff0_thd1 = weak$$choice2 ? z$r_buff0_thd1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff0_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1)) [L774] 1 z$r_buff1_thd1 = weak$$choice2 ? z$r_buff1_thd1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff1_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] 1 __unbuffered_p0_EAX = z [L776] 1 z = z$flush_delayed ? z$mem_tmp : z [L777] 1 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L780] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L797] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L800] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L803] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L806] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L807] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L808] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L809] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L810] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L868] 0 pthread_t t16; [L869] FCALL, FORK 0 pthread_create(&t16, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t14={5:0}, t15={6:0}, t16={3:0}, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L820] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L823] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L826] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L827] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L828] 3 z$flush_delayed = weak$$choice2 [L829] 3 z$mem_tmp = z [L830] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L831] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L832] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L833] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L834] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L835] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L836] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L837] 3 __unbuffered_p2_EBX = z [L838] 3 z = z$flush_delayed ? z$mem_tmp : z [L839] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L842] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L843] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L844] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L845] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L846] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L783] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L784] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L785] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L786] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L787] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L790] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L792] 1 return 0; [L813] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L815] 2 return 0; [L849] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L851] 3 return 0; [L871] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L873] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L873] RET 0 assume_abort_if_not(main$tmp_guard0) [L875] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L876] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L877] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L878] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L879] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t14={5:0}, t15={6:0}, t16={3:0}, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L882] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L884] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "mix001.oepc.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 862]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 865]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 867]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 162 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 27.1s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 13.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1182 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 893 mSDsluCounter, 768 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 628 mSDsCounter, 115 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2906 IncrementalHoareTripleChecker+Invalid, 3021 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 115 mSolverCounterUnsat, 140 mSDtfsCounter, 2906 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 80 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=354occurred in iteration=15, InterpolantAutomatonStates: 88, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 250 NumberOfCodeBlocks, 250 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 210 ConstructedInterpolants, 0 QuantifiedInterpolants, 2516 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-19 08:06:57,427 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_747f0cbf-672f-4579-b731-985cc1384ef3/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_747f0cbf-672f-4579-b731-985cc1384ef3/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_747f0cbf-672f-4579-b731-985cc1384ef3/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_747f0cbf-672f-4579-b731-985cc1384ef3/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_747f0cbf-672f-4579-b731-985cc1384ef3/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix001.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_747f0cbf-672f-4579-b731-985cc1384ef3/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_747f0cbf-672f-4579-b731-985cc1384ef3/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 54b7204af3591799bdde98d626e5c17b99e9c1ebc668ecbb3e0b1bb3bb8aa3c2 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 08:07:00,226 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 08:07:00,307 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_747f0cbf-672f-4579-b731-985cc1384ef3/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-19 08:07:00,332 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 08:07:00,333 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 08:07:00,369 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 08:07:00,370 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 08:07:00,371 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 08:07:00,372 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 08:07:00,372 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 08:07:00,373 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 08:07:00,374 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 08:07:00,375 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 08:07:00,375 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 08:07:00,380 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 08:07:00,381 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 08:07:00,384 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 08:07:00,388 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 08:07:00,388 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-19 08:07:00,389 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-19 08:07:00,390 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-19 08:07:00,391 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 08:07:00,392 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-19 08:07:00,392 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-19 08:07:00,393 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-19 08:07:00,393 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 08:07:00,394 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 08:07:00,394 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 08:07:00,395 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 08:07:00,396 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 08:07:00,397 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 08:07:00,398 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 08:07:00,398 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 08:07:00,399 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 08:07:00,399 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-19 08:07:00,400 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-19 08:07:00,400 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 08:07:00,400 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 08:07:00,400 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 08:07:00,401 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-19 08:07:00,402 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 08:07:00,402 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_747f0cbf-672f-4579-b731-985cc1384ef3/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_747f0cbf-672f-4579-b731-985cc1384ef3/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 -> 54b7204af3591799bdde98d626e5c17b99e9c1ebc668ecbb3e0b1bb3bb8aa3c2 [2023-11-19 08:07:00,860 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 08:07:00,897 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 08:07:00,901 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 08:07:00,902 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 08:07:00,903 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 08:07:00,905 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_747f0cbf-672f-4579-b731-985cc1384ef3/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/pthread-wmm/mix001.oepc.i [2023-11-19 08:07:04,280 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 08:07:04,654 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 08:07:04,658 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_747f0cbf-672f-4579-b731-985cc1384ef3/sv-benchmarks/c/pthread-wmm/mix001.oepc.i [2023-11-19 08:07:04,682 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_747f0cbf-672f-4579-b731-985cc1384ef3/bin/uautomizer-verify-uCwYo4JHxu/data/2408c5608/4679b1b4a0b047ef8282bd13207891e2/FLAGb6d6ad8d9 [2023-11-19 08:07:04,701 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_747f0cbf-672f-4579-b731-985cc1384ef3/bin/uautomizer-verify-uCwYo4JHxu/data/2408c5608/4679b1b4a0b047ef8282bd13207891e2 [2023-11-19 08:07:04,707 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 08:07:04,709 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 08:07:04,715 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 08:07:04,715 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 08:07:04,721 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 08:07:04,722 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:07:04" (1/1) ... [2023-11-19 08:07:04,723 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39e7de42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:07:04, skipping insertion in model container [2023-11-19 08:07:04,724 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:07:04" (1/1) ... [2023-11-19 08:07:04,803 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 08:07:05,268 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 08:07:05,286 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 08:07:05,355 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 08:07:05,416 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 08:07:05,416 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 08:07:05,424 INFO L206 MainTranslator]: Completed translation [2023-11-19 08:07:05,425 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:07:05 WrapperNode [2023-11-19 08:07:05,425 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 08:07:05,427 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 08:07:05,427 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 08:07:05,427 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 08:07:05,435 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:07:05" (1/1) ... [2023-11-19 08:07:05,473 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:07:05" (1/1) ... [2023-11-19 08:07:05,536 INFO L138 Inliner]: procedures = 179, calls = 61, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 158 [2023-11-19 08:07:05,537 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 08:07:05,538 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 08:07:05,539 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 08:07:05,539 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 08:07:05,550 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:07:05" (1/1) ... [2023-11-19 08:07:05,551 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:07:05" (1/1) ... [2023-11-19 08:07:05,556 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:07:05" (1/1) ... [2023-11-19 08:07:05,556 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:07:05" (1/1) ... [2023-11-19 08:07:05,569 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:07:05" (1/1) ... [2023-11-19 08:07:05,577 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:07:05" (1/1) ... [2023-11-19 08:07:05,580 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:07:05" (1/1) ... [2023-11-19 08:07:05,593 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:07:05" (1/1) ... [2023-11-19 08:07:05,598 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 08:07:05,607 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 08:07:05,607 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 08:07:05,607 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 08:07:05,608 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:07:05" (1/1) ... [2023-11-19 08:07:05,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 08:07:05,630 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_747f0cbf-672f-4579-b731-985cc1384ef3/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:07:05,643 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_747f0cbf-672f-4579-b731-985cc1384ef3/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 08:07:05,680 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_747f0cbf-672f-4579-b731-985cc1384ef3/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 08:07:05,689 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-19 08:07:05,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 08:07:05,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 08:07:05,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 08:07:05,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-19 08:07:05,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-19 08:07:05,691 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-19 08:07:05,692 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-19 08:07:05,692 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-19 08:07:05,692 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-19 08:07:05,692 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-19 08:07:05,693 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-19 08:07:05,694 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-19 08:07:05,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 08:07:05,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 08:07:05,696 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 08:07:05,900 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 08:07:05,903 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 08:07:06,500 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 08:07:06,686 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 08:07:06,686 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 08:07:06,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:07:06 BoogieIcfgContainer [2023-11-19 08:07:06,691 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 08:07:06,694 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 08:07:06,694 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 08:07:06,698 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 08:07:06,698 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:07:04" (1/3) ... [2023-11-19 08:07:06,699 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b7b8d33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:07:06, skipping insertion in model container [2023-11-19 08:07:06,699 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:07:05" (2/3) ... [2023-11-19 08:07:06,700 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b7b8d33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:07:06, skipping insertion in model container [2023-11-19 08:07:06,700 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:07:06" (3/3) ... [2023-11-19 08:07:06,701 INFO L112 eAbstractionObserver]: Analyzing ICFG mix001.oepc.i [2023-11-19 08:07:06,724 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 08:07:06,724 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-19 08:07:06,724 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 08:07:06,821 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 08:07:06,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 135 transitions, 282 flow [2023-11-19 08:07:06,939 INFO L124 PetriNetUnfolderBase]: 4/132 cut-off events. [2023-11-19 08:07:06,939 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:07:06,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 132 events. 4/132 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 104 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2023-11-19 08:07:06,946 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 135 transitions, 282 flow [2023-11-19 08:07:06,953 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 132 transitions, 273 flow [2023-11-19 08:07:06,957 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 08:07:06,968 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 132 transitions, 273 flow [2023-11-19 08:07:06,971 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 132 transitions, 273 flow [2023-11-19 08:07:06,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 132 transitions, 273 flow [2023-11-19 08:07:07,012 INFO L124 PetriNetUnfolderBase]: 4/132 cut-off events. [2023-11-19 08:07:07,013 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:07:07,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 132 events. 4/132 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 104 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2023-11-19 08:07:07,019 INFO L119 LiptonReduction]: Number of co-enabled transitions 3084